Skip to content

Avoiding unsafe sets when training with Langevin Dynamics

Jul 2026 · arXiv.org · Vol abs/2607.07538 · 0 citations · 30 references
Computer Science Mathematics

TL;DR

A local relaxation rate is introduced through the spectral measure of the region's centered indicator rather than a Dirichlet-form Rayleigh quotient, which exceeds the global one, shrinking the burn-in, and with a maximum-principle ceiling it caps the trajectory probability uniformly in time.

Abstract

Training a model with noisy gradient descent can be idealized as overdamped Langevin dynamics, and a natural safety question is to bound the probability $\nu_t(\mathcal{A}_H) = \mathbb{P}(Q_t \in \mathcal{A}_H)$ that the trajectory lies in a designated failure region $\mathcal{A}_H$. We study this for a smooth, strongly convex loss in $d$ dimensions, with $\mathcal{A}_H$ separated from the minimizer by an energy gap. At the end of training, the equilibrium mass $\pi(\mathcal{A}_H)$ is exponentially small in $d$, with a complementary energy-barrier rate when the noise is small. Along the trajectory, a shape-free bound $\nu_t(\mathcal{A}_H) \le \pi(\mathcal{A}_H)(1 + \sqrt{\chi_0^2/\pi(\mathcal{A}_H)}\,e^{-mt})$ shows the in-set probability relaxes to (twice) the static value after a burn-in of order $d$, using only the global spectral gap $m$. A worked Ornstein-Uhlenbeck example shows this burn-in is necessary: an angular slice of the equilibrium shell can transiently swell by a factor exponential in $d$, though its equilibrium mass is tiny. To rule this out we introduce a local relaxation rate, defined through the spectral measure of the region's centered indicator rather than a Dirichlet-form Rayleigh quotient. For geometrically isolated regions this rate exceeds the global one, shrinking the burn-in, and with a maximum-principle ceiling it caps the trajectory probability uniformly in time. Strong convexity sets how fast training relaxes, but the shape of the unsafe set decides whether the trajectory bulges through it on the way to equilibrium.

View source

Similar papers

Preprint Sep 2026

The Fenchel Game of Underdamped Langevin Dynamics: Insights into Accelerated Convergence

For $(Q_t,P_t)$ governed by suitably damped underdamped Langevin dynamics, we quantify the convergence in KL divergence of the positional marginal to a $\sigma$-strongly log-concave target $\pi(dq) = \frac{1}{Z}e^{-V(q)}dq$ as \begin{align*} \operatorname{KL}(\operatorname{Law}(Q_t) \| \pi) \leq e^{-\sqrt{\sigma} t}\op...

Alexandra G. Borkowski, N. Nüsken · 1 citation
Preprint Sep 2026

A global spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\,\mathrm{d} x$ on $\mathbb R^d$, where $0<m\leq L<\infty$, $mI_d\preceq\nabla^2U(x)\preceq LI_d$, and $\kappa=L/m$. It is known that, under warm-start assumptions, fixed-step Metropolis-adjusted Langevin algorithm (MALA) with properly tuned step size has mixing time of order $\ka...

Qian Qin · 0 citations
Preprint Aug 2026

Sharp hypocoercive convergence estimates for underdamped Langevin dynamics with specular reflection

We study the underdamped (kinetic) Langevin dynamics confined to a bounded domain $\Omega\subset\mathbb{R}^d$ by specular reflection of the velocity at the boundary. This process is the natural momentum-based analogue of the normally reflected overdamped Langevin diffusion, and it is used in practice for constrained sa...

Hengrong Du, Qi Feng, Lin Zhu · 0 citations
Preprint Aug 2026

Optimal Learning Under Tsybakov Noise

This work improves the upper bound to match the best known lower bound, thus establishing the optimal error guarantee for learning under Tsybakov noise.

Steve Hanneke, Hongao Wang, Mingyue Xu · 0 citations
Preprint Aug 2026

Beyond the Static Barrier for Ordinary Dynamic Approximate Membership

This work proves a strict space separation between static and ordinary dynamic approximate membership at every fixed error rate, and produces a two-variable analytic envelope with no selected thresholds, dyadic witnesses, or numerical assumptions.

Qi-Zhi Chen, Zhebei Shen, Zhehan Yu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.