Papers
Topics
Authors
Recent
Search
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.

Citations (32)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.