Indexed metadata

Annealed Underdamped Langevin Dynamics

Laurenz Nagler, Alexander Falk, Andreas Habring

Source record

Source: arXiv

Published: Sep 26, 2026

arXiv: 2609.32446

Open original source ↗

Source abstract

In sampling, different flavours of annealing, tempering, or other successive approximation approaches are widely used and studied. In this work we investigate annealed underdamped Langevin sampling for logconcave distributions of the form π(x)∝e−Ψ(x)π(x) \propto e^{-Ψ(x)} for a potential Ψ:Rd→RΨ:\mathbb{R}^d \rightarrow \mathbb{R}. That is, we assume access to the score of a general approximating family of distributions (πτ)τ∈[0,1](π_τ)_{τ\in [0,1]} with π0=ππ_0=π. This family is used in a time-inhomogeneous underdamped Langevin process with moving target πτ(t)π_{τ(t)} and an appropriate annealing schedule t↦τ(t)t\mapsto τ(t) such that τ(t)↓0τ(t)\downarrow 0 as t→Tt\to T for some T>0T>0. While the degeneracy of the Brownian motion prohibits conventional Girsanov arguments, we are able to circumvent this issue by relying on an appropriately designed auxiliary process. To the best of our knowledge these are the first (quantitative) results for sampling using time-inhomogeneous underdamped Langevin dynamics. Moreover, we obtain an iteration complexity of O(ε−2)\mathcal{O}(ε^{-2}) in total variation distance in comparison to O(ε−6)\mathcal{O}(ε^{-6}) for annealed overdamped Langevin sampling. While we currently assume convexity, our proof strategies are amenable to generalization for non-logconcave targets and enable for several future research directions.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Annealed Underdamped Langevin Dynamics — Mathematical Frontier Network