On the convergence of MDL density estimation

Abstract

We present a general information exponential inequality that measures the statistical complexity of some deterministic and randomized density estimators. Using this inequality, we are able to improve classical results concerning the convergence of two-part code MDL in [1], Moreover, we are able to derive clean finite-sample convergence bounds that are not obtainable using previous approaches.