Simulation of Random Variables under Rényi Divergence Measures of All Orders

05/31/2018
by   Lei Yu, et al.
0

The random variable simulation problem consists in using a k-dimensional i.i.d. random vector X^k with distribution P_X^k to simulate an n-dimensional i.i.d. random vector Y^n so that its distribution is approximately Q_Y^n. In contrast to previous works, in this paper we consider the standard Rényi divergence and two variants of all orders to measure the level of approximation. These two variants are the max-Rényi divergence D_α^max(P,Q) and the sum-Rényi 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ényi divergence measures, we characterize the asymptotics of normalized divergences as well as the Rényi conversion rates. The latter is defined as the supremum of n/k such that the Rényi divergences vanish asymptotically. In addition, when the Rényi parameter is in the interval (0,1), the Rényi conversion rates equal the ratio of the Shannon entropies H(P_X)/H(Q_Y), which is consistent with traditional results in which the total variation measure was adopted. When the Rényi parameter is in the interval (1,∞], the Rényi conversion rates are, in general, larger than H(P_X)/H(Q_Y). When specialized to the case in which either P_X or Q_Y 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ényi divergences and the Rényi conversion rates for these two cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2021

Interval extropy and weighted interval extropy

Recently, Extropy was introduced by Lad, Sanfilippo and Agrò as a comple...
research
04/20/2022

An entropy functional bounded from above by one

Shannon entropy is widely used for quantifying uncertainty in discrete r...
research
04/25/2023

Statistics of Random Binning Based on Tsallis Divergence

Random binning is a powerful and widely used tool in information theory....
research
02/17/2018

Domination of Sample Maxima and Related Extremal Dependence Measures

For a given d-dimensional distribution function (df) H we introduce the ...
research
02/10/2023

Fast Gumbel-Max Sketch and its Applications

The well-known Gumbel-Max Trick for sampling elements from a categorical...
research
02/02/2020

Fast Generating A Large Number of Gumbel-Max Variables

The well-known Gumbel-Max Trick for sampling elements from a categorical...
research
02/10/2019

Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria

We consider zero-sum repeated games in which the players are restricted ...

Please sign up or login with your details

Forgot password? Click here to reset