English
Related papers

Related papers: Yet Another Proof of the Entropy Power Inequality

200 papers

This paper is twofold. In the first part, we present a refinement of the R\'enyi Entropy Power Inequality (EPI) recently obtained in \cite{BM16}. The proof largely follows the approach in \cite{DCT91} of employing Young's convolution…

Probability · Mathematics 2018-05-01 Jiange Li

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…

Information Theory · Computer Science 2018-07-24 Arnaud Marsiglietti , James Melbourne

Following a recent proof of Shannon's entropy power inequality (EPI), a comprehensive framework for deriving various EPIs for the R\'enyi entropy is presented that uses transport arguments from normal densities and a change of variable by…

Information Theory · Computer Science 2018-10-17 Olivier Rioul

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Yaming Yu

A framework for deriving R\'enyi entropy-power inequalities (EPIs) is presented that uses linearization and an inequality of Dembo, Cover, and Thomas. Simple arguments are given to recover the previously known R\'enyi EPIs and derive new…

Information Theory · Computer Science 2020-04-08 Olivier Rioul

We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential…

Information Theory · Computer Science 2017-03-07 Olivier Rioul

The matrix version of the entropy-power inequality for real or complex coefficients and variables is proved using a transportation argument that easily settles the equality case. An application to blind source extraction is given.

Information Theory · Computer Science 2019-06-04 Olivier Rioul , Ram Zamir

An extension of the entropy power inequality to the form $N_r^\alpha(X+Y) \geq N_r^\alpha(X) + N_r^\alpha(Y)$ with arbitrary independent summands $X$ and $Y$ in $\mathbb{R}^n$ is obtained for the R\'enyi entropy and powers $\alpha \geq…

Information Theory · Computer Science 2017-10-25 Sergey Bobkov , Arnaud Marsiglietti

This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed…

Information Theory · Computer Science 2021-10-20 Mokshay Madiman , Piotr Nayar , Tomasz Tkocz

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon's entropy power inequality (EPI) seems to be an exception: available information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul

A lower bound on the R\'enyi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the…

Information Theory · Computer Science 2015-05-07 Liyao Wang , Mokshay Madiman

We show that there is equality in Shannon's Entropy Power Inequality (EPI) if and only if the random variables involved are Gaussian, assuming nothing beyond the existence of differential entropies. This is done by justifying de Bruijn's…

Probability · Mathematics 2025-09-30 Lampros Gavalakis , Ioannis Kontoyiannis

We study the $p$-R\'{e}nyi entropy power inequality with a weight factor $t$ on two independent continuous random variables $X$ and $Y$. The extension essentially relies on a modulation on the sharp Young's inequality due to Bobkov and…

Quantum Physics · Physics 2023-11-28 Junseo Lee , Hyeonjun Yeo , Kabgyun Jeong

Let $\mathsf{N}_{\rm d}\left[X\right]=\frac{1}{2\pi {\rm e}}{\rm e}^{2\mathsf{H}\left[X\right]}$ denote the entropy power of the discrete random variable $X$ where $\mathsf{H}\left[X\right]$ denotes the discrete entropy of $X$. In this…

Information Theory · Computer Science 2019-05-09 Ehsan Nekouei , Mikael Skoglund , Karl Henrik Johansson

The conditional entropy power inequality is a fundamental inequality in information theory, stating that the conditional entropy of the sum of two conditionally independent vector-valued random variables each with an assigned conditional…

Quantum Physics · Physics 2019-02-01 Giacomo De Palma

We prove a sharp analog of Young's inequality on $S^N$, and deduce from it certain sharp entropy inequalities. The proof turns on constructing a nonlinear heat flow that drives trial functions to optimizers in a monotonic manner. This…

Functional Analysis · Mathematics 2007-05-23 Eric Carlen , Elliott Lieb , Michael Loss

The paper establishes the equality condition in the I-MMSE proof of the entropy power inequality (EPI). This is done by establishing an exact expression for the deficit between the two sides of the EPI. Interestingly, a necessary condition…

Information Theory · Computer Science 2017-03-23 Alex Dytso , Ronit Bustin , H. Vincent Poor , Shlomo Shamai

The entropy power inequality for independent random vectors is a foundational result of information theory, with deep connections to probability and geometric functional analysis. Several extensions of the entropy power inequality have been…

Information Theory · Computer Science 2025-12-23 Mokshay Madiman , James Melbourne , Cyril Roberto

We tighten the Entropy Power Inequality (EPI) when one of the random summands is Gaussian. Our strengthening is closely connected to the concept of strong data processing for Gaussian channels and generalizes the (vector extension of)…

Information Theory · Computer Science 2016-02-10 Thomas A. Courtade
‹ Prev 1 2 3 10 Next ›