mlsanityData to 7 Oct 2026

Path-Guided Particle-based Sampling

arXiv 2412.03312 ↗First posted 4 Dec 2024cs.LG cs.AI stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Particle-based Bayesian inference methods by sampling from a partition-free target (posterior) distribution, e.g., Stein variational gradient descent (SVGD), have attracted significant attention. We propose a path-guided particle-based sampling~(PGPS) method based on a novel Log-weighted Shrinkage (LwS) density path linking an initial distribution to the target distribution. We propose to utilize a Neural network to learn a vector field motivated by the Fokker-Planck equation of the designed density path. Particles, initiated from the initial distribution, evolve according to the ordinary differential equation defined by the vector field. The distribution of these particles is guided along a density path from the initial distribution to the target distribution. The proposed LwS density path allows for an efficient search of modes of the target distribution while canonical methods fail. We theoretically analyze the Wasserstein distance of the distribution of the PGPS-generated samples and the target distribution due to approximation and discretization errors. Practically, the proposed PGPS-LwS method demonstrates higher Bayesian inference accuracy and better calibration ability in experiments conducted on both synthetic and real-world Bayesian learning tasks, compared to baselines, such as SVGD and Langevin dynamics, etc.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 24 of its 42 references that are in the map. First posted on arXiv 4 Dec 2024.

Builds on

24 of 42 references.

References · 24

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  2. 2022Flow Matching for Generative Modelingcited by 5,426
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  5. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  6. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
  7. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  8. 2016Input Convex Neural Networkscited by 407
  9. 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
  10. 2016A Kernel Test of Goodness of Fitcited by 143
  11. 2020Bayesian Neural Networks: An Introduction and Surveycited by 130
  12. 2023Error Bounds for Flow Matching Methodscited by 88
12 more
  1. 2020Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimationcited by 87
  2. 2021Large-Scale Wasserstein Gradient Flowscited by 76
  3. 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
  4. 2020Projected Stein Variational Gradient Descentcited by 33
  5. 2024Sampling in Unit Time with Kernel Fisher-Rao Flowcited by 27
  6. 2021Projected Wasserstein gradient descent for high-dimensional Bayesian inferencecited by 24
  7. 2020Sliced Kernelized Stein Discrepancycited by 23
  8. 2022Particle-based Variational Inference with Preconditioned Functional Gradient Flowcited by 20
  9. 2021Neural Variational Gradient Descentcited by 19
  10. 2023Provable benefits of annealing for estimating normalizing constants: Importance Sampling, Noise-Contrastive Estimation, and beyondcited by 13
  11. 2022Grassmann Stein Variational Gradient Descentcited by 12
  12. 2024Measure transport with kernel mean embeddingscited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 6; 2026: 2.

8 papers.