Reinterpreting Importance-Weighted Autoencoders
Chris Cremer, Quaid Morris, David Duvenaud

TL;DR
This paper offers a new perspective on importance-weighted autoencoders, showing they optimize the standard variational lower bound with a more complex distribution, and introduces a tighter lower bound and visualization of the implicit distribution.
Contribution
It provides an alternative interpretation of importance-weighted autoencoders and derives a tighter lower bound, enhancing understanding of their optimization process.
Findings
Importance-weighted autoencoders optimize the standard variational lower bound with a complex distribution.
A new, tighter lower bound for importance-weighted autoencoders is derived.
Visualization of the implicit importance-weighted distribution is presented.
Abstract
The standard interpretation of importance-weighted autoencoders is that they maximize a tighter lower bound on the marginal likelihood than the standard evidence lower bound. We give an alternate interpretation of this procedure: that it optimizes the standard variational lower bound, but using a more complex distribution. We formally derive this result, present a tighter lower bound, and visualize the implicit importance-weighted distribution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI) · Generative Adversarial Networks and Image Synthesis
