SUMO: Unbiased Estimation of Log Marginal Probability for Latent Variable Models
arXiv:2004.00353
Abstract
Standard variational lower bounds used to train latent variable models produce biased estimates of most quantities of interest. We introduce an unbiased estimator of the log marginal likelihood and its gradients for latent variable models based on randomized truncation of infinite series. If parameterized by an encoder-decoder architecture, the parameters of the encoder can be optimized to minimize its variance of this estimator. We show that models trained using our estimator give better test-set likelihoods than a standard importance-sampling based approach for the same average computational cost. This estimator also allows use of latent variable models for tasks where unbiased estimators, rather than marginal likelihood lower bounds, are preferred, such as minimizing reverse KL divergences and estimating score functions.
arXiv commentICLR 2020
References in corpus (16)
- Auto-Encoding Variational Bayes
- On the Convergence of Adam and Beyond
- Expectation Propagation for approximate Bayesian inference
- Variational Inference with Normalizing Flows
- Residual Flows for Invertible Generative Modeling
- REBAR: Low-variance, unbiased gradient estimates for discrete latent variable models
- Latent Space Policies for Hierarchical Reinforcement Learning
- Unbiasing Truncated Backpropagation Through Time
- Importance Weighting and Variational Inference
- Discrete Flows: Invertible Generative Models of Discrete Data
- Unbiased Markov chain Monte Carlo with couplings
- Overdispersed Black-Box Variational Inference
- Efficient Optimization of Loops and Limits with Randomized Telescoping Sums
- Markov Chain Truncation for Doubly-Intractable Inference
- Hierarchical Importance Weighted Autoencoders
- Stochastic Chebyshev Gradient Descent for Spectral Optimization
Cited by in corpus (6)
- Deep Generative Modelling: A Comparative Review of VAEs, GANs, Normalizing Flows, Energy-Based and Autoregressive Models
- Randomized Automatic Differentiation
- Unbiased Gradient Estimation for Variational Auto-Encoders using Coupled Markov Chains
- Efficient Learning of Generative Models via Finite-Difference Score Matching
- Density Deconvolution with Normalizing Flows
- Differentiable Annealed Importance Sampling and the Perils of Gradient Noise