Stein variational gradient descent with local approximations
Liang Yan, Tao Zhou

TL;DR
This paper introduces a local surrogate approach for Stein variational gradient descent (SVGD) using deep neural networks to approximate gradients, significantly reducing computational costs in Bayesian inference.
Contribution
It proposes a novel adaptive local approximation method for SVGD that enables efficient inference when gradients are unavailable or expensive to compute.
Findings
Reduces computational cost of SVGD by using neural network surrogates.
Improves performance and applicability of SVGD in Bayesian inverse problems.
Demonstrates effectiveness through numerical experiments on challenging problems.
Abstract
Bayesian computation plays an important role in modern machine learning and statistics to reason about uncertainty. A key computational challenge in Bayesian inference is to develop efficient techniques to approximate, or draw samples from posterior distributions. Stein variational gradient decent (SVGD) has been shown to be a powerful approximate inference algorithm for this issue. However, the vanilla SVGD requires calculating the gradient of the target density and cannot be applied when the gradient is unavailable or too expensive to evaluate. In this paper we explore one way to address this challenge by the construction of a local surrogate for the target distribution in which the gradient can be obtained in a much more computationally feasible manner. More specifically, we approximate the forward model using a deep neural network (DNN) which is trained on a carefully chosen…
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.
