2000 character limit reached
On the entropy power inequality for the Rényi entropy of order [0,1]
Published 2 Oct 2017 in cs.IT, math.IT, and math.PR | (1710.00800v3)
Abstract: Using a sharp version of the reverse Young inequality, and a R\'enyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive R\'enyi entropy power inequalities for log-concave random vectors when R\'enyi parameters belong to $(0,1)$. Furthermore, the estimates are shown to be sharp up to absolute constants.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
