Learning to Draw Samples: With Application to Amortized MLE for Generative Adversarial Learning
Dilin Wang, Qiang Liu
TL;DR
The paper tackles efficient probabilistic inference when the target distribution is known only up to a normalization constant. It introduces Amortized SVGD, training a neural sampler to mimic Stein variational dynamics so that the sampler can rapidly generate samples for many related tasks without computing the proposal density. Building on this, SteinGAN couples the neural sampler with an energy-based model to perform amortized MLE in a GAN-like framework, achieving realistic image synthesis and competitive performance on multiple datasets. This approach automates sampler design, leverages a principled kernelized Stein discrepancy to maintain diversity, and demonstrates practical gains in both sample quality and downstream predictive tasks. The work lays groundwork for automatic, task-adaptive probabilistic inference and fast inner-loop optimization in deep energy models.
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 that maximumly 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. As an application of our method, we propose an amortized MLE algorithm for training deep energy model, where a neural sampler is adaptively trained to approximate the likelihood function. Our method mimics an adversarial game between the deep energy model and the neural sampler, and obtains realistic-looking images competitive with the state-of-the-art results.
