Convergence of Noise-Free Sampling Algorithms with Regularized Wasserstein Proximals
<|reference_start|>Convergence of Noise-Free Sampling Algorithms with Regularized Wasserstein Proximals: In this work, we investigate the convergence properties of the backward regularized Wasserstein proximal (BRWP) method for sampling a target distribution. The BRWP approach can be shown as a semi-implicit time discretization for a probability flow ODE with the score function whose density satisfies the Fokker-Planck equation of the overdamped Langevin dynamics. Specifically, the evolution of the score function is computed using a kernel formula derived from the regularized Wasserstein proximal operator. By applying the Laplace method to obtain the asymptotic expansion of this kernel formula, we establish guaranteed convergence in terms of the Kullback-Leibler divergence for the BRWP method towards a strongly log-concave target distribution. Our analysis also identifies the optimal and maximum step sizes for convergence. Furthermore, we demonstrate that the deterministic and semi-implicit BRWP scheme outperforms many classical Langevin Monte Carlo methods, such as the Unadjusted Langevin Algorithm (ULA), by offering faster convergence and reduced bias. Numerical experiments further validate the convergence analysis of the BRWP method.<|reference_end|>
@article{han2024convergence,
    title={Convergence of Noise-Free Sampling Algorithms with Regularized
  Wasserstein Proximals},
    author={Fuqun Han, Stanley Osher, Wuchen Li},
    journal={arXiv preprint arXiv:2409.01567},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.01567},
    primaryClass={math.NA cs.NA math.ST stat.TH}
}