On the entropy power inequality for the Rényi entropy of order [0,1]

2017/10/02 by Marsiglietti, Arnaud, Melbourne, James · 1 citation
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Probability (math.PR)

paper · doi:10.48550/arxiv.1710.00800

Abstract

Using a sharp version of the reverse Young inequality, and a Rényi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive Rényi entropy power inequalities for log-concave random vectors when Rényi parameters belong to (0,1). Furthermore, the estimates are shown to be sharp up to absolute constants.

Cited by

• A Quantitative Entropy Power Inequality for Dependent Random Vectors

Related

• Further investigations of Rényi entropy power inequalities and an entropic characterization of s-concave densities
• On Renyi Entropy Power Inequalities
• Rényi Entropy Power and Normal Transport
• A reverse entropy power inequality for i.i.d. log-concave random variables
• Sharp Bounds Between Two Rényi Entropies of Distinct Positive Orders