Optimal Concentration of Information Content For Log-Concave Densities

Liyao Wang; Matthieu Fradelizi; Mokshay Madiman

REVIEW

Optimal Concentration of Information Content For Log-Concave Densities

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1508.04093 v2 pith:ZCMIHZIU submitted 2015-08-17 math.PR cs.ITmath.FAmath.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

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

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).

Optimal Concentration of Information Content For Log-Concave Densities

discussion (0)