On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]
Arnaud Marsiglietti, James Melbourne
Abstract
Open-access reader
Arnaud Marsiglietti, James Melbourne
Abstract
Open-access reader
Using a sharp version of the reverse Young inequality, and a Rényi entropy comparison result due to Fradelizi, Madiman, and Wang (2016), the authors 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.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Using a sharp version of the reverse Young inequality, and a Rényi entropy comparison result due to Fradelizi, Madiman, and Wang (2016), the authors 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.
Key concepts: Rényi entropy, Mathematics, Entropy power inequality, Min entropy, Entropy (arrow of time), Inequality, Maximum entropy probability distribution, Statistical physics