Conditional Rényi entropy and the relationships between Rényi capacities
arXiv:2005.00876 · doi:10.3390/e22050526
Abstract
The analogues of Arimoto's definition of conditional Rényi entropy and Rényi mutual information are explored for abstract alphabets. These quantities, although dependent on the reference measure, have some useful properties similar to those known in the discrete setting. In addition to laying out some such basic properties and the relations to Rényi divergences, the relationships between the families of mutual informations defined by Sibson, Augustin-Csiszár, and Lapidoth-Pfister, as well as the corresponding capacities, are explored.
arXiv comment17 pages, 1 figure
References in corpus (17)
- Rényi Divergence and Kullback-Leibler Divergence
- Sumset and inverse sumset theorems for Shannon entropy
- Beyond the entropy power inequality, via rearrangements
- Forward and Reverse Entropy Power Inequalities in Convex Geometry
- Sumset and Inverse Sumset Inequalities for Differential Entropy and Mutual Information
- Encoding Tasks and Rényi Entropy
- Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
- Entropy bounds on abelian groups and the Ruzsa divergence
- Entropy and set cardinality inequalities for partition-determined functions
- The Renyi Capacity and Center
- The Augustin Capacity and Center
- Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam region
- Entropy Inequalities for Sums in Prime Cyclic Groups
- Majorization and Rényi Entropy Inequalities via Sperner Theory
- Two Measures of Dependence
- Concentration of information content for convex measures
- Analysis of Remaining Uncertainties and Exponents under Various Conditional Rényi Entropies