Simulation of Random Variables under R\'enyi Divergence Measures of All Orders
Abstract
The random variable simulation problem consists in using a k-dimensional i.i.d. random vector Xk with distribution PXk to simulate an n-dimensional i.i.d. random vector Yn so that its distribution is approximately QYn. In contrast to previous works, in this paper we consider the standard R\'enyi divergence and two variants of all orders to measure the level of approximation. These two variants are the max-R\'enyi divergence Dαmax(P,Q) and the sum-R\'enyi divergence Dα+(P,Q). When α=∞, these two measures are strong because for any ε>0, D∞max(P,Q)≤ε or D∞+(P,Q)≤ε implies e-ε≤P(x)Q(x)≤ eε for all x. Under these R\'enyi divergence measures, we characterize the asymptotics of normalized divergences as well as the R\'enyi conversion rates. The latter is defined as the supremum of nk such that the R\'enyi divergences vanish asymptotically. In addition, when the R\'enyi parameter is in the interval (0,1), the R\'enyi conversion rates equal the ratio of the Shannon entropies H(PX)H(QY), which is consistent with traditional results in which the total variation measure was adopted. When the R\'enyi parameter is in the interval (1,∞], the R\'enyi conversion rates are, in general, smaller than H(PX)H(QY). When specialized to the case in which either PX or QY is uniform, the simulation problem reduces to the source resolvability and intrinsic randomness problems. The preceding results are used to characterize the asymptotics of R\'enyi divergences and the R\'enyi conversion rates for these two cases.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.