On Renyi Entropy Power Inequalities
Abstract
This paper gives improved R\'enyi entropy power inequalities (R-EPIs). Consider a sum Sn = Σk=1n Xk of n independent continuous random vectors taking values on Rd, and let α ∈ [1, ∞]. An R-EPI provides a lower bound on the order-α R\'enyi entropy power of Sn that, up to a multiplicative constant (which may depend in general on n, α, d), is equal to the sum of the order-α R\'enyi entropy powers of the n random vectors \Xk\k=1n. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.