Skip to content
Open access

Adaptive Momentum Langevin Dynamics for Efficient Posterior Sampling

Aug 2026 · Entropy · Vol 28, pp. 854 · 0 citations · 18 references
Medicine

TL;DR

Adaptive Momentum Langevin Dynamics (AMLD), a practical stochastic correction kernel that introduces a momentum variable into the annealed posterior sampling framework and equips it with an annealing-aware momentum retention schedule, is proposed.

Abstract

Sampling from high-dimensional posterior distributions is a central challenge in Bayesian inference and noisy inverse problems. Standard first-order Langevin-based methods often suffer from slow convergence and sensitivity to step-size hyperparameters, particularly in annealed score-based inverse imaging pipelines. We propose Adaptive Momentum Langevin Dynamics (AMLD), a practical stochastic correction kernel that introduces a momentum variable into the annealed posterior sampling framework and equips it with an annealing-aware momentum retention schedule. The method is fully compatible with the SNIPS framework and retains its coordinate-wise adaptive step structure, acting as a lightweight drop-in replacement for the conventional first-order Langevin correction step. Extensive experiments on three representative image inverse problems—Gaussian deblurring, inpainting, and 4× super-resolution—demonstrate that AMLD consistently achieves strong PSNR and LPIPS performance, with competitive FID in most settings, compared to three state-of-the-art baselines (DDRM, DPS, SNIPS) under both nearly noiseless and noisy measurement conditions, while reaching target reconstruction quality using fewer sampling iterations. The proposed momentum-based sampler provides empirically improved exploration and robustness across evolving posterior landscapes, offering a practical and computationally efficient alternative to first-order annealed Langevin samplers in high-dimensional Bayesian inverse problems.

Read PDF

Similar papers

#machine learning Preprint Aug 2026

Picard Proximal Monte Carlo for Parallel Bayesian Imaging with Score-Based Generative Priors

Bayesian imaging inverse problems often require sampling from high-dimensional posterior distributions. While recent score-based and diffusion models provide expressive Bayesian priors, their sampling procedures remain inherently sequential and computationally expensive for large-scale imaging applications. We propose...

Deliang Wei, Evan Bell, Wenhan Guo et al. · 0 citations
Preprint Aug 2026

A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors

This work defines an explicit surrogate posterior path and derives the Posterior-Dynamics Implicit--Explicit sampler (PD-IMEX), a stable method using one score evaluation per diffusion scale and an implicit data-consistency update, and derives continuous posterior dynamics.

Zhao-Qiang Liu, T. Pang, Ruibing Wang et al. · 1 citation
#machine learning Preprint Sep 2026

CLIMB-flow: Coupled Linear Inverse posterior sampling via Multiscale-Based flow

This paper introduces a posterior sampling algorithm customized for the pyramidal/cascaded architecture, which relies on a coarse to fine hierarchical strategy to generate images in the pixel domain and presents CLIMB-Flow which alternates between three steps: an end-point estimation from the current coarse and noisy i...

Ze-Qiu Yu, Rui Yuan, Mathews Jacob · 0 citations
Preprint Sep 2026

SNaP: One-Step Posterior Sampling for Noisy Inverse Problems

SNaP is introduced, a one-step MeanFlow posterior sampler for linear inverse problems with Gaussian noise, which produces diverse, high-quality samples with one network evaluation per draw, 30 to 2250 $\times$ faster than iterative samplers.

Shirin Shoushtari, Edward P. Chandler, Xiao Shi et al. · 0 citations
#machine learning Preprint Sep 2026

Learning to Bias: Machine Learning-Enhanced Particle Filters

Neural Optimal Particle Filters are introduced, which learn an amortized approximation to the optimal proposal from offline simulated one-step conditioning tuples, and improve sample efficiency and distributional accuracy over standard PF baselines with modest computational overhead.

Apoorv Srivastava, Eric F. Darve · 0 citations
#machine learning Preprint Sep 2026

Interacting particle guidance for sampling reward-tilted generative priors

Inference-time steering adapts pretrained diffusion and flow-based models to new tasks, e.g., to generate samples from a conditional distribution or samples with desired properties, without retraining. This can be formalized as sampling from a reward-tilted generative prior. As exact sampling from this distribution is...

Adhithyan Kalaivanan, Zheng Zhao, Jens Sjölund et al. · 0 citations

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