On Renyi Entropy Power Inequalities

January 25, 2016 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Eshed Ram, Igal Sason arXiv ID 1601.06555 Category cs.IT: Information Theory Cross-listed math.PR Citations 46 Venue IEEE Transactions on Information Theory Last Checked 6 months ago
Abstract
This paper gives improved RΓ©nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $Ξ±\in [1, \infty]$. An R-EPI provides a lower bound on the order-$Ξ±$ RΓ©nyi entropy power of $S_n$ that, up to a multiplicative constant (which may depend in general on $n, Ξ±, d$), is equal to the sum of the order-$Ξ±$ RΓ©nyi entropy powers of the $n$ random vectors $\{X_k\}_{k=1}^n$. For $Ξ±=1$, the R-EPI coincides with the well-known entropy power inequality by Shannon. The first improved R-EPI is obtained by tightening the recent R-EPI by Bobkov and Chistyakov which relies on the sharpened Young's inequality. A further improvement of the R-EPI also relies on convex optimization and results on rank-one modification of a real-valued diagonal matrix.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted