pith. sign in

arxiv: 1707.06626 · v2 · pith:VTABMKUXnew · submitted 2017-07-20 · 📊 stat.ML

Learning to Draw Samples with Amortized Stein Variational Gradient Descent

classification 📊 stat.ML
keywords methodtargetvariationaldistributiondrawgradientinferencelearning
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Uniform-in-time Propagation-of-Chaos for Stein Variational Gradient Descent

    math.PR 2026-06 unverdicted novelty 7.0

    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).