用马尔可夫链蒙特卡洛修正扩散模型采样偏差,提升图像生成质量。
Metropolis-Adjusted Diffusion Models

- 引入基于梅特罗波利斯-汉斯方法的修正步骤,消除朗之万采样偏差。
- 提出首个精确修正方法,结合双币伯努利工厂算法实现无偏采样。
- 高效近似方案仅小幅增加计算成本,却显著提升图像质量(FID下降)。
基于得分的扩散模型在采样时因时间离散化和得分函数近似而产生偏差。通常采用预测-校正框架中基于无调整朗之万算法(ULA)的校正步骤来降低偏差,但ULA本身也存在离散化偏差。本文提出使用梅特罗波利斯-汉斯(MH)或巴克尔接受-拒绝步骤的调整型朗之万校正器,以纠正此偏差。由于标准MH算法所需的精确目标密度比难以获得,我们提出利用得分函数计算正确接受概率的方法。本文首次提出基于双币伯努利工厂算法的精确调整方法,并设计一种基于辛普森法则的高效近似方案,其精度达到步长的5/2阶,边际成本几乎为零。实验表明,这些方法在合成数据和图像数据集上均提升了样本质量,在图像数据集上的弗雷谢引子距离(FID)持续下降。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。