Normalizing constants of log-concave densities
Abstract
We derive explicit bounds for the computation of normalizing constants Z for log-concave densities π = (-U)/Z with respect to the Lebesgue measure on Rd. Our approach relies on a Gaussian annealing combined with recent and precise bounds on the Unadjusted Langevin Algorithm (High-dimensional Bayesian inference via the Unadjusted Langevin Algorithm, A. Durmus and E. Moulines). Polynomial bounds in the dimension d are obtained with an exponent that depends on the assumptions made on U. The algorithm also provides a theoretically grounded choice of the annealing sequence of variances. A numerical experiment supports our findings. Results of independent interest on the mean squared error of the empirical average of locally Lipschitz functions are established.
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.