Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rényi Entropy Power and Normal Transport (1902.06120v3)

Published 16 Feb 2019 in cs.IT and math.IT

Abstract: A framework for deriving R\'enyi entropy-power inequalities (EPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to recover the previously known R\'enyi EPIs and derive new ones, by unifying a multiplicative form with constant c and a modification with exponent $\alpha$ of previous works. An information-theoretic proof of the Dembo-Cover-Thomas inequality---equivalent to Young's convolutional inequality with optimal constants---is provided, based on properties of R\'enyi conditional and relative entropies and using transportation arguments from Gaussian densities. For log-concave densities, a transportation proof of a sharp varentropy bound is presented.

Citations (2)

Summary

We haven't generated a summary for this paper yet.