MLLGAug 5, 2020

Optimal Variance Control of the Score Function Gradient Estimator for Importance Weighted Bounds

arXiv:2008.01998v27 citations
Originality Incremental advance
AI Analysis

This addresses variance issues in variational inference for researchers, offering a competitive reparameterization-free alternative, though it is incremental as it builds on existing methods like VIMCO.

The paper tackles the problem of high variance in gradient estimators for importance weighted variational bounds by proving that with an optimal control variate, the Signal-to-Noise ratio (SNR) can grow as √K with large K, and develops a method that yields superior variance reduction in training generative models.

This paper introduces novel results for the score function gradient estimator of the importance weighted variational bound (IWAE). We prove that in the limit of large $K$ (number of importance samples) one can choose the control variate such that the Signal-to-Noise ratio (SNR) of the estimator grows as $\sqrt{K}$. This is in contrast to the standard pathwise gradient estimator where the SNR decreases as $1/\sqrt{K}$. Based on our theoretical findings we develop a novel control variate that extends on VIMCO. Empirically, for the training of both continuous and discrete generative models, the proposed method yields superior variance reduction, resulting in an SNR for IWAE that increases with $K$ without relying on the reparameterization trick. The novel estimator is competitive with state-of-the-art reparameterization-free gradient estimators such as Reweighted Wake-Sleep (RWS) and the thermodynamic variational objective (TVO) when training generative models.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes