mlsanityData to 14 Oct 2026

Sampling with Mirrored Stein Operators

arXiv 2106.12506 ↗First posted 23 Jun 2021stat.ML cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

We introduce a new family of particle evolution samplers suitable for constrained domains and non-Euclidean geometries. Stein Variational Mirror Descent and Mirrored Stein Variational Gradient Descent minimize the Kullback-Leibler (KL) divergence to constrained target distributions by evolving particles in a dual space defined by a mirror map. Stein Variational Natural Gradient exploits non-Euclidean geometry to more efficiently minimize the KL divergence to unconstrained targets. We derive these samplers from a new class of mirrored Stein operators and adaptive kernels developed in this work. We demonstrate that these new samplers yield accurate approximations to distributions on the simplex, deliver valid confidence intervals in post-selection inference, and converge more rapidly than prior methods in large-scale unconstrained posterior inference. Finally, we establish the convergence of our new procedures under verifiable conditions on the target distribution.

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). Builds on 43 of its 88 references that are in the map. First posted on arXiv 23 Jun 2021.

Builds on

43 of 88 references.

References · 43

  1. 2017Reinforcement Learning with Deep Energy-Based Policiescited by 669
  2. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 507
  3. 2014New insights and perspectives on the natural gradient methodcited by 443
  4. 2016A Kernelized Stein Discrepancy for Goodness-of-fit Tests and Model Evaluationcited by 236
  5. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
  6. 2017Stein Variational Gradient Descent as Gradient Flowcited by 152
  7. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  8. 2016A Kernel Test of Goodness of Fitcited by 143
  9. 2015Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networkscited by 121
  10. 2017Measuring Sample Quality with Kernelscited by 119
  11. 2015Measuring Sample Quality with Stein's Methodcited by 94
  12. 2013Exact post-selection inference, with application to the lassocited by 91
31 more
  1. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 84
  2. 2019On the geometry of Stein variational gradient descentcited by 82
  3. 2018Mirrored Langevin Dynamicscited by 61
  4. 2020A Non-Asymptotic Analysis for Stein Variational Gradient Descentcited by 61
  5. 2014Control functionals for Monte Carlo integrationcited by 59
  6. 2019Minimum Stein Discrepancy Estimatorscited by 57
  7. 2020Wasserstein Control of Mirror Langevin Monte Carlocited by 55
  8. 2020Efficient constrained sampling via the mirror-Langevin algorithmcited by 55
  9. 2013The Information Geometry of Mirror Descentcited by 54
  10. 2018A Stein variational Newton methodcited by 50
  11. 2017Message Passing Stein Variational Gradient Descentcited by 47
  12. 2018A Spectral Approach to Gradient Estimation for Implicit Distributionscited by 45
  13. 2018Stein Pointscited by 43
  14. 2017A Linear-Time Kernel Goodness-of-Fit Testcited by 41
  15. 2018Fast yet Simple Natural-Gradient Descent for Variational Inference in Complex Modelscited by 38
  16. 2020Exponential ergodicity of mirror-Langevin diffusionscited by 37
  17. 2019Stein Variational Gradient Descent With Matrix-Valued Kernelscited by 32
  18. 2020Stochastic Stein Discrepanciescited by 30
  19. 2013Langevin diffusions and the Metropolis-adjusted Langevin algorithmcited by 29
  20. 2019Stein Point Markov Chain Monte Carlocited by 29
  21. 2017Learning to Draw Samples with Amortized Stein Variational Gradient Descentcited by 28
  22. 2020Optimal Thinning of MCMC Outputcited by 26
  23. 2016Measuring Sample Quality with Diffusionscited by 25
  24. 2017Riemannian Stein Variational Gradient Descent for Bayesian Inferencecited by 24
  25. 2018Random Feature Stein Discrepanciescited by 23
  26. 2019Projected Stein Variational Newton: A Fast and Scalable Bayesian Inference Method in High Dimensionscited by 21
  27. 2019Is There an Analog of Nesterov Acceleration for MCMC?cited by 19
  28. 2016Stochastic Quasi-Newton Langevin Monte Carlocited by 14
  29. 2019Understanding MCMC Dynamics as Flows on the Wasserstein Spacecited by 14
  30. 2018Variance Reduction in Stochastic Particle-Optimization Samplingcited by 11
  31. 2018Bayesian posterior approximation via greedy particle optimizationcited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 7; 2023: 4; 2024: 3; 2025: 0; 2026: 3.

17 papers.

Sort:

By area:

  1. 2022Sampling with Mollified Interaction Energy Descentcited by 17
  2. 2022Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Conditioncited by 16
  3. 2023Towards Understanding the Dynamics of Gaussian-Stein Variational Gradient Descentcited by 13
  4. 2022Grassmann Stein Variational Gradient Descentcited by 12
  5. 2024Constrained Sampling with Primal-Dual Langevin Monte Carlocited by 10
  6. 2026Probabilistic Inference and Learning with Stein's Methodcited by 5
  7. 2022A Note on the Convergence of Mirrored Stein Variational Gradient Descent under (L0,L1)-Smoothness Conditioncited by 4
  8. 2023Langevin Quasi-Monte Carlocited by 4
  9. 2023Learning Rate Free Sampling in Constrained Domainscited by 3
  10. 2022A Particle-Based Algorithm for Distributional Optimization on textitConstrained Domains via Variational Transport and Mirror Descentcited by 2
  11. 2022Improved Stein Variational Gradient Descent with Importance Weightscited by 2
  12. 2023Approximate Stein Classes for Truncated Density Estimationcited by 1
5 more
  1. 2024Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herdingcited by 1
  2. 2022Posterior sampling with CNN-based, Plug-and-Play regularization with applications to Post-Stack Seismic Inversioncited by 0
  3. 2024Functional Gradient Flows for Constrained Samplingcited by 0
  4. 2026Rethinking the Flow-Based Gradual Domain Adaptation: A Semi-Dual Optimal Transport Perspectivecited by 0
  5. 2026Analyzing and Improving Diffusion Models for Time-Series Data Imputation: A Proximal Recursion Perspectivecited by 0