Multirate Stein Variational Gradient Descent for Efficient Bayesian Sampling
Arash Sarshar

TL;DR
This paper introduces a multirate version of Stein variational gradient descent (SVGD) that updates different components at different rates, improving robustness and efficiency in complex Bayesian inference tasks.
Contribution
The authors develop a multirate SVGD framework with practical algorithms, including adaptive and fixed variants, tailored for high-dimensional and complex posteriors.
Findings
Multirate SVGD improves robustness across diverse Bayesian inference problems.
Adaptive multirate SVGD performs best on stiff, anisotropic, and multimodal targets.
Fixed multirate SVGD offers a simpler, cost-effective alternative with strong performance.
Abstract
Many particle-based Bayesian inference methods use a single global step size for all parts of the update. In Stein variational gradient descent (SVGD), however, each update combines two qualitatively different effects: attraction toward high-posterior regions and repulsion that preserves particle diversity. These effects can evolve at different rates, especially in high-dimensional, anisotropic, or hierarchical posteriors, so one step size can be unstable in some regions and inefficient in others. We derive a multirate version of SVGD that updates these components on different time scales. The framework yields practical algorithms, including a symmetric split method, a fixed multirate method (MR-SVGD), and an adaptive multirate method (Adapt-MR-SVGD) with local error control. We evaluate the methods in a broad and rigorous benchmark suite covering six problem families: a 50D Gaussian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
