Optimal transport to rényi entropies

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recently, an optimal transportation argument was proposed by the author to provide a simple proof of Shannon’s entropy-power inequality. Interestingly, such a proof could have been given by Shannon himself in his 1948 seminal paper. In fact, by 1948 Shannon established all the ingredients necessary for the proof and the transport argument takes the form of a simple change of variables. In this paper, the optimal transportation argument is extended to Rényi entropies in relation to Shannon’s entropy-power inequality and to a reverse version involving a certain conditional entropy. The transportation argument turns out to coincide with Barthe’s proof of sharp direct and reverse Young’s convolutional inequalities and can be applied to derive recent Rényi entropy-power inequalities.

Original languageEnglish
Title of host publicationGeometric Science of Information - 3rd International Conference, GSI 2017, Proceedings
EditorsFrank Nielsen, Frederic Barbaresco, Frank Nielsen
PublisherSpringer Verlag
Pages143-150
Number of pages8
ISBN (Print)9783319684444
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes
Event3rd International Conference on Geometric Science of Information, GSI 2017 - Paris, France
Duration: 7 Nov 20179 Nov 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10589 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Geometric Science of Information, GSI 2017
Country/TerritoryFrance
CityParis
Period7/11/179/11/17

Keywords

  • Entropy-power inequality
  • Optimal transport
  • Rényi entropy

Fingerprint

Dive into the research topics of 'Optimal transport to rényi entropies'. Together they form a unique fingerprint.

Cite this