For probability mass functions on the finite alphabet, take logarithms to base two and define the relative entropy by
A term with is zero, including ; a term with is . Fix and write . For ,
Thus is a convex function on by continuous extension to zero. For , applying this scalar convexity to each coordinate and summing proves
If has zero coordinates, the finite-valued domain consists of probability mass functions supported on ; it is convex and the same proof applies there. Outside that domain the right side is infinite whenever an offending probability mass function has a positive mixture weight, so the extended-valued convexity assertion still holds. At mixture weights zero or one the inequality is an identity, without needing the expression .
Index correction: the printed definition only permits , although the required average includes . Extend the same deletion formula to . Without that extension the final summand is undefined; there is no new sample or different estimator to supply.
For a fixed outcome of the sample and a fixed symbol , put . The leave-one-out empirical distribution then satisfies
Dividing by gives . Each of the indicator functions was counted exactly times before division by . This leave-one-out identity for empirical distributions is deterministic; independence plays no part in this part.
Reference-distribution ambiguity: is not defined in the paper. If it is an arbitrary probability mass function, the printed inequality is false. For instance, choose and . Every empirical distribution equals , making the printed left side one bit and its right side zero. This is a counterexample for every .
Under the consistent interpretation , the preceding leave-one-out identity for empirical distributions and convexity of relative entropy in its first argument give, for every sample,
Deleting any one observation from independent and identically distributed random variables leaves independent observations with probability mass function . Consequently each has the same distribution as . They need not be independent of one another. Taking expected values and using linearity of expectation therefore proves
Zero coordinates of are never sampled, almost surely, so the calculation can be restricted to its probability support. In particular the expected values are finite on this finite alphabet.
The discrepancy cannot be removed by silently choosing any fixed reference. Whenever is positive on the probability support of , direct subtraction and give the expected relative entropy decomposition
Thus the valid arbitrary-reference version has on both sides; the printed mixed-reference version has an additional term whose sign prevents the proposed conclusion.

Articles by others on the same topic (0)

There are currently no matching articles.