Estimating normalizing constants for log-concave distributions: algorithms and lower bounds

Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistics. In this work, we consider the problem of estimating the normalizing constant Z = R d e -f (x) dx to within a multiplication factor of 1 ± ε for a µ-strongly convex and L-smooth function f , given query access to f (x) and ∇f (x). We give both algorithms and lowerbounds for this problem. Using an annealing algorithm combined with a multilevel Monte Carlo method based on underdamped Langevin dynamics, we show that O d 4/3 κ+d 7/6 κ 7/6 ε 2 queries to ∇f are sufficient, where κ = L/µ is the condition number. Moreover, we provide an information theoretic lowerbound, showing that at least d 1-o(1) ε 2-o(1) queries are necessary. This provides a first nontrivial lowerbound for the problem.