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

Arnaud Marsiglietti, James Melbourne

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish (US)
Article number8502868
Pages (from-to)1387-1396
Number of pages10
JournalIEEE Transactions on Information Theory
Volume65
Issue number3
DOIs
StatePublished - Mar 2019

Bibliographical note

Funding Information:
Manuscript received November 10, 2017; revised July 20, 2018; accepted October 7, 2018. Date of publication October 23, 2018; date of current version February 14, 2019. A. Marsiglietti was supported by the Walter S. Baer and Jeri Weiss CMI Postdoctoral Fellowship. J. Melbourne was supported by NSF under Grant CNS 1544721 and Grant ECCS 1809194. This paper was presented at the 2018 IEEE International Symposium on Information Theory.

Publisher Copyright:
© 1963-2012 IEEE.

Keywords

  • Entropy power inequality
  • Rényi entropy
  • log-concave

Fingerprint Dive into the research topics of 'On the entropy power inequality for the rényi entropy of order [0, 1]'. Together they form a unique fingerprint.

Cite this