paper-with-me

Papers

Metropolis-Adjusted Diffusion Models

2026-05-10 · Kevin H. Lam, Tyler Farghly, Christopher Williams, Jun Yang, Yee Whye Teh, Arnaud Doucet arxiv

Sampling from score-based diffusion models incurs bias due to both time discretisation and the approximation of the score function. A common strategy for reducing this bias is to apply corrector steps based on the unadjusted Langevin algorithm (ULA) at each noise level within a predictor-corrector framework. However, ULA is itself a biased sampler, as it discretises a continuous diffusion process. In this work, we consider adjusted Langevin correctors that employ Metropolis--Hastings (MH) or Barker's accept-reject steps to correct for this bias. Since the target density ratio typically required by MH-based algorithms is unavailable, we propose methods that instead utilise the score function to compute the correct acceptance probability. We introduce the first exact method for adjusting Langevin corrections in diffusion models, based on a two-coin Bernoulli factory algorithm. We also propose an efficient approximation based on Simpson's rule that achieves accuracy of order $5/2$ in the step size at near-zero marginal cost. We demonstrate that these procedures improve sample quality on both synthetic and image datasets, yielding consistent gains in Fréchet Inception Distance (FID) on the latter.

📄 PDF Abstract BibTeX arXiv:2605.09654

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Score-Based Metropolis-Hastings Algorithms

2024-12-31 · Ahmed Aloui, Ali Hasan, Juncheng Dong, Zihao Wu 외

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 da…

Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm

2020-12-23 · Sinho Chewi, Chen Lu, Kwangjun Ahn, Xiang Cheng 외

Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scales as $O(d^{1/3})$, where $d$ is the dim…

Efficiently handling constraints with Metropolis-adjusted Langevin algorithm

2023-02-23 · Jinyuan Chang, Cheng Yong Tang, Yuanzheng Zhu

In this study, we investigate the performance of the Metropolis-adjusted Langevin algorithm in a setting with constraints on the support of the target distribution. We provide a rigorous analysis of the resulting Markov …

Log-concave sampling: Metropolis-Hastings algorithms are fast

2018-01-08 · Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu

We consider the problem of sampling from a strongly log-concave density in $\mathbb{R}^d$, and prove a non-asymptotic upper bound on the mixing time of the Metropolis-adjusted Langevin algorithm (MALA). The method draws …

Score-based Metropolis-Hastings for Fractional Langevin Algorithms

2026-01-31 · Ahmed Aloui, Junyi Liao, Ali Hasan, Jose Blanchet 외 arxiv

Sampling from heavy-tailed and multimodal distributions is challenging when neither the target density nor the proposal density can be evaluated, as in $α$-stable Lévy-driven fractional Langevin algorithms. While the tar…