Skip to main content

Optimal Transport to Rényi Entropies

  • Conference paper
  • First Online:
Geometric Science of Information (GSI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10589))

Included in the following conference series:

  • 2247 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  2. Shannon, C.E., Weaver, W.: La théorie mathématique de la communication. Cassini, Paris (2017)

    Google Scholar 

  3. Rioul, O.: Information theoretic proofs of entropy power inequalities. IEEE Trans. Inf. Theory 57(1), 33–55 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  4. Rioul, O.: Yet another proof of the entropy power inequality. IEEE Trans. Inf. Theory 63(6), 3595–3599 (2017)

    Article  MATH  MathSciNet  Google Scholar 

  5. Rioul, O.: Optimal transportation to the entropy-power inequality. In: IEEE Information Theory and Applications Workshop (ITA 2017), San Diego, USA, February 2017

    Google Scholar 

  6. Barthe, F.: Optimal Young’s inequality and its converse: a simple proof. GAFA Geom. Funct. Anal. 8(2), 234–242 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bobkov, S.G., Chistyakov, G.P.: Entropy power inequality for the Rényi entropy. IEEE Trans. Inf. Theory 61(2), 708–714 (2015)

    Article  MATH  Google Scholar 

  8. Ram, E., Sason, I.: On Rényi entropy power inequalities. IEEE Trans. Inf. Theory 62(12), 6800–6815 (2016)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olivier Rioul .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Rioul, O. (2017). Optimal Transport to Rényi Entropies. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2017. Lecture Notes in Computer Science(), vol 10589. Springer, Cham. https://doi.org/10.1007/978-3-319-68445-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68445-1_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68444-4

  • Online ISBN: 978-3-319-68445-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics