Iterative Refinement of the Approximate Posterior for Directed Belief Networks
Devon Hjelm, Ruslan Salakhutdinov, Kyunghyun Cho, Nebojsa Jojic, Vince Calhoun, Junyoung Chung
Abstract
Variational methods that rely on a recognition network to approximate the posterior of directed graphical models offer better inference and learning than previous methods. Recent advances that exploit the capacity and flexibility in this approach have expanded what kinds of models can be trained. However, as a proposal for the posterior, the capacity of the recognition network is limited, which can constrain the representational power of the generative model and increase the variance of Monte Carlo estimates. To address these issues, we introduce an iterative refinement procedure for improving the approximate posterior of the recognition network and show that training with the refined posterior is competitive with state-of-the-art methods. The advantages of refinement are further evident in an increased effective sample size, which implies a lower variance of gradient estimates.
BibTeX
@inproceedings{NIPS2016_20c9f570,
author = {Hjelm, Devon and Salakhutdinov, Russ R and Cho, Kyunghyun and Jojic, Nebojsa and Calhoun, Vince and Chung, Junyoung},
booktitle = {Advances in Neural Information Processing Systems},
editor = {D. Lee and M. Sugiyama and U. Luxburg and I. Guyon and R. Garnett},
pages = {},
publisher = {Curran Associates, Inc.},
title = {Iterative Refinement of the Approximate Posterior for Directed Belief Networks},
url = {https://proceedings.neurips.cc/paper_files/paper/2016/file/20c9f5700da1088260df60fcc5df2b53-Paper.pdf},
volume = {29},
year = {2016}
}