Optimal Concentration of Information Content For Log-Concave Densities

Liyao Wang; Matthieu Fradelizi; Mokshay Madiman

arxiv: 1508.04093 · v2 · pith:ZCMIHZIUnew · submitted 2015-08-17 · 🧮 math.PR · cs.IT· math.FA· math.IT

Optimal Concentration of Information Content For Log-Concave Densities

Matthieu Fradelizi , Mokshay Madiman , Liyao Wang This is my paper

classification 🧮 math.PR cs.ITmath.FAmath.IT

keywords boundscontentdensitiesinformationlog-concavebobkovconcentrationdeviations

0 comments

read the original abstract

An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained by Bobkov and Madiman ({\it Ann. Probab.}, 39(4):1528--1543, 2011).

This paper has not been read by Pith yet.

Optimal Concentration of Information Content For Log-Concave Densities

discussion (0)