A simple proof of the entropy-power inequality

142 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The Composition Theorem for Differential Privacy (2013, neutral): “Comparing to (4), the privacy guarantee is signiﬁcantly improved from ˜ ε ˜ δ = O kε 2 + kε 2 log(1 / ˜ δ ) to ˜ ε ˜ δ = O kε 2 + min kε 2 log(1 / ˜ δ ) , ε log( ε/ ˜ δ ) (cid:9)(cid:17) , especially when composing a large number k of interactive queries.”
PacGAN: The Power of Two Samples in Generative Adversarial Networks (2017, background): “, [26], [27], [28], [29], [30], [31], [32], [33], [34]) where operational interpretations of mutual information and corresponding data processing inequalities have given rise to simple proofs of strong technical results.”
On the entropy of sums (2008, methodology): “…sums and inequalities for joint distributions using a common framework; even the recent innovative treatment of entropy power inequalities by Rioul [15] , which partially addresses this issue, requires some delicate analysis in the end to justify the vanishing of higher-order terms in a Taylor…”