arXiv Analytics

Sign in

arXiv:1806.02775 [stat.ML]AbstractReferencesReviewsResources

Stein Variational Gradient Descent Without Gradient

Jun Han, Qiang Liu

Published 2018-06-07Version 1

Stein variational gradient decent (SVGD) has been shown to be a powerful approximate inference algorithm for complex distributions. However, the standard SVGD requires calculating the gradient of the target density and cannot be applied when the gradient is unavailable. In this work, we develop a gradient-free variant of SVGD (GF-SVGD), which replaces the true gradient with a surrogate gradient, and corrects the induced bias by re-weighting the gradients in a proper form. We show that our GF-SVGD can be viewed as the standard SVGD with a special choice of kernel, and hence directly inherits the theoretical properties of SVGD. We shed insights on the empirical choice of the surrogate gradient and propose an annealed GF-SVGD that leverages the idea of simulated annealing to improve the performance on high dimensional complex distributions. Empirical studies show that our method consistently outperforms a number of recent advanced gradient-free MCMC methods.

Related articles: Most relevant | Search more
arXiv:2102.12956 [stat.ML] (Published 2021-02-25)
Stein Variational Gradient Descent: many-particle and long-time asymptotics
arXiv:1810.11693 [stat.ML] (Published 2018-10-27)
Stein Variational Gradient Descent as Moment Matching
arXiv:1902.03394 [stat.ML] (Published 2019-02-09)
A stochastic version of Stein Variational Gradient Descent for efficient sampling