PRLGMLOct 25, 2021

On quantitative Laplace-type convergence results for some exponential probability measures, with two applications

arXiv:2110.12922v18 citations
Originality Incremental advance
AI Analysis

This work provides incremental theoretical advances in probability theory and optimization, with applications in statistical mechanics and machine learning algorithms.

The paper tackles the problem of establishing quantitative convergence bounds for Laplace-type probability measures with norm-like potentials, deriving Wasserstein distance bounds under a generalized Jacobian invertibility condition. It applies these results to maximum entropy models and the convergence of Stochastic Gradient Langevin Dynamics for non-convex minimization.

Laplace-type results characterize the limit of sequence of measures $(π_\varepsilon)_{\varepsilon >0}$ with density w.r.t the Lebesgue measure $(\mathrm{d} π_\varepsilon / \mathrm{d} \mathrm{Leb})(x) \propto \exp[-U(x)/\varepsilon]$ when the temperature $\varepsilon>0$ converges to $0$. If a limiting distribution $π_0$ exists, it concentrates on the minimizers of the potential $U$. Classical results require the invertibility of the Hessian of $U$ in order to establish such asymptotics. In this work, we study the particular case of norm-like potentials $U$ and establish quantitative bounds between $π_\varepsilon$ and $π_0$ w.r.t. the Wasserstein distance of order $1$ under an invertibility condition of a generalized Jacobian. One key element of our proof is the use of geometric measure theory tools such as the coarea formula. We apply our results to the study of maximum entropy models (microcanonical/macrocanonical distributions) and to the convergence of the iterates of the Stochastic Gradient Langevin Dynamics (SGLD) algorithm at low temperatures for non-convex minimization.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes