Backpropagation-Free Metropolis-Adjusted Langevin Algorithm

• URL: http://arxiv.org/abs/2505.18081v1
• Date: Fri, 23 May 2025 16:39:21 GMT
• Title: Backpropagation-Free Metropolis-Adjusted Langevin Algorithm
• Abstract summary: We show how the sampling of a tangent vector can be incorporated into the proposal mechanism for the Metropolis-Adjusted Langevin Algorithm (MALA)<n>We are the first to introduce a backpropagation-free gradient-based Markov chain Monte Carlo algorithm.<n>Overall, we propose four new algorithms: Forward MALA; Line Forward MALA; Pre-conditioned Forward MALA, and Pre-conditioned Line Forward MALA.
• Score: 13.032984331926158
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent work on backpropagation-free learning has shown that it is possible to use forward-mode automatic differentiation (AD) to perform optimization on differentiable models. Forward-mode AD requires sampling a tangent vector for each forward pass of a model. The result is the model evaluation with the directional derivative along the tangent. In this paper, we illustrate how the sampling of this tangent vector can be incorporated into the proposal mechanism for the Metropolis-Adjusted Langevin Algorithm (MALA). As such, we are the first to introduce a backpropagation-free gradient-based Markov chain Monte Carlo (MCMC) algorithm. We also extend to a novel backpropagation-free position-specific preconditioned forward-mode MALA that leverages Hessian information. Overall, we propose four new algorithms: Forward MALA; Line Forward MALA; Pre-conditioned Forward MALA, and Pre-conditioned Line Forward MALA. We highlight the reduced computational cost of the forward-mode samplers and show that forward-mode is competitive with the original MALA, while even outperforming it depending on the probabilistic model. We include Bayesian inference results on a range of probabilistic models, including hierarchical distributions and Bayesian neural networks.

Related papers

• Inference-Time Alignment of Diffusion Models via Trust-Region Iterative Twisted Sequential Monte Carlo [15.105260031413698]
  We study inference-time alignment for diffusion-based generative models.<n>We propose a trust-region framework for learning twisting functions in SMC-based inference-time alignment.
  arXiv  Detail & Related papers  (2026-05-24T15:08:52Z)
• Self-Supervised Laplace Approximation for Bayesian Uncertainty Quantification [45.61685127984694]
  We quantify a Bayesian model's predictive uncertainty by refitting on self-predicted data.<n>The modular structure of our Self-Supervised Laplace Approximation (SSLA) allows us to plug in different prior specifications.<n>In order to bypass expensive refitting, we further introduce an approximate version of SSLA, called ASSLA.
  arXiv  Detail & Related papers  (2026-05-12T14:46:08Z)
• A Predictive View on Streaming Hidden Markov Models [0.8122270502556375]
  We develop a predictive-first optimisation framework for streaming hidden Markov models.<n>Our objective is to sequentially identify latent regimes while maintaining accurate step-ahead predictive distributions.
  arXiv  Detail & Related papers  (2026-04-10T10:51:50Z)
• Transport Reversible Jump Markov Chain Monte Carlo with proposals generated by Variational Inference with Normalizing Flows [0.0]
  We present a framework using variational inference with normalizing flows (VI-NFs) to generate proposals of reversible jump Markov chain Monte Carlo (RJMCMC)<n>Our approach minimizes the reverse KL divergence which requires only samples from a base distribution, eliminating costly target sampling.<n>The proposed algorithm can be extended to conditional flows for amortized vairiational inference across models.
  arXiv  Detail & Related papers  (2025-12-14T15:38:47Z)
• Gradient-Informed Monte Carlo Fine-Tuning of Diffusion Models for Low-Thrust Trajectory Design [0.0]
  A global search for spacecraft trajectories in the Circular Three-Body Problem is characterized by a complex objective landscape and numerous local minima.<n>Formulating the problem as sampling from an unnormalized distribution supported on neighborhoods of locally optimal solutions provides the opportunity to deploy chain Monte Carlo methods.<n>In this work, we extend our previous self-supervised diffusion model fine-tuning framework to employ gradient-informed Markov chain Monte Carlo.
  arXiv  Detail & Related papers  (2025-12-09T15:21:11Z)
• Self-Boost via Optimal Retraining: An Analysis via Approximate Message Passing [58.52119063742121]
  Retraining a model using its own predictions together with the original, potentially noisy labels is a well-known strategy for improving the model performance.<n>This paper addresses the question of how to optimally combine the model's predictions and the provided labels.<n>Our main contribution is the derivation of the Bayes optimal aggregator function to combine the current model's predictions and the given labels.
  arXiv  Detail & Related papers  (2025-05-21T07:16:44Z)
• Diffusion models for probabilistic programming [56.47577824219207]
  Diffusion Model Variational Inference (DMVI) is a novel method for automated approximate inference in probabilistic programming languages (PPLs) DMVI is easy to implement, allows hassle-free inference in PPLs without the drawbacks of, e.g., variational inference using normalizing flows, and does not make any constraints on the underlying neural network model.
  arXiv  Detail & Related papers  (2023-11-01T12:17:05Z)
• A probabilistic, data-driven closure model for RANS simulations with aleatoric, model uncertainty [1.8416014644193066]
  We propose a data-driven, closure model for Reynolds-averaged Navier-Stokes (RANS) simulations that incorporates aleatoric, model uncertainty. A fully Bayesian formulation is proposed, combined with a sparsity-inducing prior in order to identify regions in the problem domain where the parametric closure is insufficient.
  arXiv  Detail & Related papers  (2023-07-05T16:53:31Z)
• Object based Bayesian full-waveform inversion for shear elastography [0.0]
  We develop a computational framework to quantify uncertainty in shear elastography imaging of anomalies in tissues. We find the posterior probability of parameter fields representing the geometry of the anomalies and their shear moduli. We demonstrate the approach on synthetic two dimensional tests with smooth and irregular shapes.
  arXiv  Detail & Related papers  (2023-05-11T08:25:25Z)
• Variational Laplace Autoencoders [53.08170674326728]
  Variational autoencoders employ an amortized inference model to approximate the posterior of latent variables. We present a novel approach that addresses the limited posterior expressiveness of fully-factorized Gaussian assumption. We also present a general framework named Variational Laplace Autoencoders (VLAEs) for training deep generative models.
  arXiv  Detail & Related papers  (2022-11-30T18:59:27Z)
• Bayesian Neural Network Inference via Implicit Models and the Posterior Predictive Distribution [0.8122270502556371]
  We propose a novel approach to perform approximate Bayesian inference in complex models such as Bayesian neural networks. The approach is more scalable to large data than Markov Chain Monte Carlo. We see this being useful in applications such as surrogate and physics-based models.
  arXiv  Detail & Related papers  (2022-09-06T02:43:19Z)
• Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling [58.14878401145309]
  We develop a novel approach to producing more sample-efficient estimators of expectations in the PL model. We illustrate our findings both theoretically and empirically using real-world recommendation data from Amazon Music and the Yahoo learning-to-rank challenge.
  arXiv  Detail & Related papers  (2022-05-12T11:15:47Z)
• A new perspective on probabilistic image modeling [92.89846887298852]
  We present a new probabilistic approach for image modeling capable of density estimation, sampling and tractable inference. DCGMMs can be trained end-to-end by SGD from random initial conditions, much like CNNs. We show that DCGMMs compare favorably to several recent PC and SPN models in terms of inference, classification and sampling.
  arXiv  Detail & Related papers  (2022-03-21T14:53:57Z)
• Structured Stochastic Gradient MCMC [20.68905354115655]
  We propose a new non-parametric variational approximation that makes no assumptions about the approximate posterior's functional form. We obtain better predictive likelihoods and larger effective sample sizes than full SGMCMC.
  arXiv  Detail & Related papers  (2021-07-19T17:18:10Z)
• Semi-Supervised Learning with Normalizing Flows [54.376602201489995]
  FlowGMM is an end-to-end approach to generative semi supervised learning with normalizing flows. We show promising results on a wide range of applications, including AG-News and Yahoo Answers text data.
  arXiv  Detail & Related papers  (2019-12-30T17:36:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.