vix.ing · top · new · best · stats · spec

Score-Based Metropolis-Hastings Algorithms

2024/12/31 by Ahmed Aloui, Hasan Ali, Aloui, Ahmed +7 · 2 citations
Mathematics · Physics and Astronomy · #Computation (stat.CO) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Markov Chains and Monte Carlo Methods #Model Reduction and Neural Networks

paper · pdf · doi:10.48550/arxiv.2501.00467

openalex publication_date 2024/12/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we introduce a new approach for integrating score-based models with the Metropolis-Hastings algorithm. While traditional score-based diffusion models excel in accurately learning the score function from data points, they lack an energy function, making the Metropolis-Hastings adjustment step inaccessible. Consequently, the unadjusted Langevin algorithm is often used for sampling using estimated score functions. The lack of an energy function then prevents the application of the Metropolis-adjusted Langevin algorithm and other Metropolis-Hastings methods, limiting the wealth of other algorithms developed that use acceptance functions. We address this limitation by introducing a new loss function based on the detailed balance condition, allowing the estimation of the Metropolis-Hastings acceptance probabilities given a learned score function. We demonstrate the effectiveness of the proposed method for various scenarios, including sampling from heavy-tail distributions.

Cited by

Related