De-randomizing MCMC dynamics with the diffusion Stein operator
Not on the map. Why?
Abstract (arXiv)
Approximate Bayesian inference estimates descriptors of an intractable target distribution - in essence, an optimization problem within a family of distributions. For example, Langevin dynamics (LD) extracts asymptotically exact samples from a diffusion process because the time evolution of its marginal distributions constitutes a curve that minimizes the KL-divergence via steepest descent in the Wasserstein space. Parallel to LD, Stein variational gradient descent (SVGD) similarly minimizes the KL, albeit endowed with a novel Stein-Wasserstein distance, by deterministically transporting a set of particle samples, thus de-randomizes the stochastic diffusion process. We propose de-randomized kernel-based particle samplers to all diffusion-based samplers known as MCMC dynamics. Following previous work in interpreting MCMC dynamics, we equip the Stein-Wasserstein space with a fiber-Riemannian Poisson structure, with the capacity of characterizing a fiber-gradient Hamiltonian flow that simulates MCMC dynamics. Such dynamics discretizes into generalized SVGD (GSVGD), a Stein-type deterministic particle sampler, with particle updates coinciding with applying the diffusion Stein operator to a kernel function. We demonstrate empirically that GSVGD can de-randomize complex MCMC dynamics, which combine the advantages of auxiliary momentum variables and Riemannian structure, while maintaining the high sample quality from an interacting particle system.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 18 of its 33 references that are in the map. First posted on arXiv 7 Oct 2021.
Builds on
18 of 33 references.
References · 18
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
- 2017Stein Variational Gradient Descent as Gradient Flowcited by 152
- 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
- 2019On the geometry of Stein variational gradient descentcited by 82
- 2020SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergencecited by 64
- 2017Gradient Estimators for Implicit Modelscited by 58
- 2019Minimum Stein Discrepancy Estimatorscited by 57
- 2018A Unified Particle-Optimization Framework for Scalable Bayesian Samplingcited by 44
- 2019Accelerated Information Gradient flowcited by 39
- 2019High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithmcited by 36
6 more
- 2016Measuring Sample Quality with Diffusionscited by 25
- 2017Riemannian Stein Variational Gradient Descent for Bayesian Inferencecited by 24
- 2018Stochastic Particle-Optimization Sampling and the Non-Asymptotic Convergence Theorycited by 20
- 2019Is There an Analog of Nesterov Acceleration for MCMC?cited by 19
- 2018Stochastic Gradient MCMC with Repulsive Forcescited by 18
- 2019Understanding MCMC Dynamics as Flows on the Wasserstein Spacecited by 14
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.