mlsanityData to 14 Oct 2026

Particle-based Variational Inference with Generalized Wasserstein Gradient Flow

arXiv 2310.16516 ↗First posted 25 Oct 2023stat.ML cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Particle-based variational inference methods (ParVIs) such as Stein variational gradient descent (SVGD) update the particles based on the kernelized Wasserstein gradient flow for the Kullback-Leibler (KL) divergence. However, the design of kernels is often non-trivial and can be restrictive for the flexibility of the method. Recent works show that functional gradient flow approximations with quadratic form regularization terms can improve performance. In this paper, we propose a ParVI framework, called generalized Wasserstein gradient descent (GWG), based on a generalized Wasserstein gradient flow of the KL divergence, which can be viewed as a functional gradient method with a broader class of regularizers induced by convex functions. We show that GWG exhibits strong convergence guarantees. We also provide an adaptive version that automatically chooses Wasserstein metric to accelerate convergence. In experiments, we demonstrate the effectiveness and efficiency of the proposed framework on both simulated and real data problems.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 25 Oct 2023.

Builds on

24 of 45 references.

References · 24

  1. 2016Variational Inference: A Review for Statisticianscited by 1,472
  2. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
  3. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
  4. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 343
  5. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
  6. 2017Stein Variational Gradient Descent as Gradient Flowcited by 152
  7. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
  8. 2020SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergencecited by 64
  9. 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 64
  10. 2022Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlocited by 63
  11. 2020A Non-Asymptotic Analysis for Stein Variational Gradient Descentcited by 61
  12. 2019Minimum Stein Discrepancy Estimatorscited by 57
12 more
  1. 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
  2. 2021Variational Wasserstein gradient flowcited by 53
  3. 2018A Stein variational Newton methodcited by 50
  4. 2018A Unified Particle-Optimization Framework for Scalable Bayesian Samplingcited by 44
  5. 2019Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexitycited by 39
  6. 2014Dimension-independent likelihood-informed MCMCcited by 37
  7. 2018Variational Inference with Tail-adaptive f-Divergencecited by 25
  8. 2020Information Newton's flow: second-order optimization method in probability spacecited by 24
  9. 2022Particle-based Variational Inference with Preconditioned Functional Gradient Flowcited by 20
  10. 2018Stein Neural Samplercited by 19
  11. 2021Neural Variational Gradient Descentcited by 19
  12. 2022Optimal Neural Network Approximation of Wasserstein Gradient Direction via Convex Optimizationcited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 5; 2025: 3; 2026: 2.

10 papers.