Uniform-in-time propagation-of-chaos bounds for SVGD are obtained via cutoff for distributional metrics (logarithmic rates) and via finite-dimensional closure plus conjugacy for Gaussian targets (parametric N^{-1/2} rates).
Learning to Draw Samples with Amortized Stein Variational Gradient Descent
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We propose a simple algorithm to train stochastic neural networks to draw samples from given target distributions for probabilistic inference. Our method is based on iteratively adjusting the neural network parameters so that the output changes along a Stein variational gradient direction (Liu & Wang, 2016) that maximally decreases the KL divergence with the target distribution. Our method works for any target distribution specified by their unnormalized density function, and can train any black-box architectures that are differentiable in terms of the parameters we want to adapt. We demonstrate our method with a number of applications, including variational autoencoder (VAE) with expressive encoders to model complex latent space structures, and hyper-parameter learning of MCMC samplers that allows Bayesian inference to adaptively improve itself when seeing more data.
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Uniform-in-time Propagation-of-Chaos for Stein Variational Gradient Descent
Uniform-in-time propagation-of-chaos bounds for SVGD are obtained via cutoff for distributional metrics (logarithmic rates) and via finite-dimensional closure plus conjugacy for Gaussian targets (parametric N^{-1/2} rates).