Preconditioned Regularized Wasserstein Proximal Sampling
Not on the map. Why?
Abstract (arXiv)
We consider sampling from a Gibbs distribution by evolving finitely many particles. We propose a preconditioned version of a recently proposed noise-free sampling method, governed by approximating the score function with the numerically tractable score of a regularized Wasserstein proximal operator. This is derived by a Cole--Hopf transformation on coupled anisotropic heat equations, yielding a kernel formulation for the preconditioned regularized Wasserstein proximal. The diffusion component of the proposed method is also interpreted as a modified self-attention block, as in transformer architectures. For quadratic potentials, we provide a discrete-time non-asymptotic convergence analysis and explicitly characterize the bias, which is dependent on regularization and independent of step-size. Experiments demonstrate acceleration and particle-level stability on various log-concave and non-log-concave toy examples to Bayesian total-variation regularized image deconvolution, and competitive/better performance on non-convex Bayesian neural network training when utilizing variable preconditioning matrices.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 1 Sep 2025.
Builds on
23 of 46 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2021Deep Generative Modelling: A Comparative Review of VAEs, GANs, Normalizing Flows, Energy-Based and Autoregressive Modelscited by 252
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
- 2017VEEGAN: Reducing Mode Collapse in GANs using Implicit Variational Learningcited by 200
- 2023A mathematical perspective on Transformerscited by 164
- 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 146
- 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 138
- 2021Bayesian imaging using Plug & Play priors: when Langevin meets Tweediecited by 97
- 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 84
- 2018Mirrored Langevin Dynamicscited by 61
11 more
- 2019Accelerated Information Gradient flowcited by 39
- 2025A Unified Perspective on the Dynamics of Deep Transformerscited by 32
- 2025DeepInverse: A Python package for solving imaging inverse problems with deep learningcited by 28
- 2024FAdam: Adam is a natural gradient optimizer using diagonal empirical Fisher informationcited by 18
- 2023A kernel formula for regularized Wasserstein proximal operatorscited by 11
- 2023Subgradient Langevin Methods for Sampling from Non-smooth Potentialscited by 11
- 2023Noise-Free Sampling Algorithms via Regularized Wasserstein Proximalscited by 7
- 2024Laplace Meets Moreau: Smooth Approximation to Infimal Convolutions Using Laplace's Methodcited by 7
- 2025Diffusion at Absolute Zero: Langevin Sampling Using Successive Moreau Envelopes [conference paper]cited by 6
- 2024Tensor train based sampling algorithms for approximating regularized Wasserstein proximal operatorscited by 4
- 2024Unsupervised Training of Convex Regularizers using Maximum Likelihood Estimationcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.