paper-with-me

홈 › Papers

Tighter Variational Bounds are Not Necessarily Better. A Research Report on Implementation, Ablation Study, and Extensions

2022-09-23 · Amine M'Charrak, Vít Růžička, Sangyun Shin, Madhu Vankadari

This report explains, implements and extends the works presented in "Tighter Variational Bounds are Not Necessarily Better" (T Rainforth et al., 2018). We provide theoretical and empirical evidence that increasing the number of importance samples $K$ in the importance weighted autoencoder (IWAE) (Burda et al., 2016) degrades the signal-to-noise ratio (SNR) of the gradient estimator in the inference network and thereby affecting the full learning process. In other words, even though increasing $K$ decreases the standard deviation of the gradients, it also reduces the magnitude of the true gradient faster, thereby increasing the relative variance of the gradient updates. Extensive experiments are performed to understand the importance of $K$. These experiments suggest that tighter variational bounds are beneficial for the generative network, whereas looser bounds are preferable for the inference network. With these insights, three methods are implemented and studied: the partially importance weighted autoencoder (PIWAE), the multiply importance weighted autoencoder (MIWAE) and the combination importance weighted autoencoder (CIWAE). Each of these three methods entails IWAE as a special case but employs the importance weights in different ways to ensure a higher SNR of the gradient estimators. In our research study and analysis, the efficacy of these algorithms is tested on multiple datasets such as MNIST and Omniglot. Finally, we demonstrate that the three presented IWAE variations are able to generate approximate posterior distributions that are much closer to the true posterior distribution than for the IWAE, while matching the performance of the IWAE generative network or potentially outperforming it in the case of PIWAE.

📄 PDF Abstract BibTeX arXiv:2209.11875

Code (1)

madhubabuv/TightIWAE 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Tighter Variational Bounds are Not Necessarily Better

2018-02-13 · ICML 2018 7 · Tom Rainforth, Adam R. Kosiorek, Tuan Anh Le, Chris J. Maddison 외

We provide theoretical and empirical evidence that using tighter evidence lower bounds (ELBOs) can be detrimental to the process of learning an inference network by reducing the signal-to-noise ratio of the gradient esti…

Variational autoencoders trained with q-deformed lower bounds

2019-03-27 · ICLR Workshop DeepGenStruct 2019 · Septimia Sârbu, Luigi Malagò

Variational autoencoders (VAEs) have been successful at learning a low-dimensional manifold from high-dimensional data with complex dependencies. At their core, they consist of a powerful Bayesian probabilistic inference…

Variational Inference

Variational Inference with Locally Enhanced Bounds for Hierarchical Models

2022-03-08 · Tomas Geffner, Justin Domke

Hierarchical models represent a challenging setting for inference algorithms. MCMC methods struggle to scale to large models with many local variables and observations, and variational inference (VI) may fail to provide …

Variational Inference

Collapsed Variational Bounds for Bayesian Neural Networks

2021-12-01 · NeurIPS 2021 12 · Marcin Tomczak, Siddharth Swaroop, Andrew Foong, Richard Turner

Recent interest in learning large variational Bayesian Neural Networks (BNNs) has been partly hampered by poor predictive performance caused by underfitting, and their performance is known to be very sensitive to the pri…

Variational Inference

Tighter Bounds on the Information Bottleneck with Application to Deep Learning

2024-02-12 · Nir Weingarten, Zohar Yakhini, Moshe Butman, Ran Gilad-Bachrach

Deep Neural Nets (DNNs) learn latent representations induced by their downstream task, objective function, and other parameters. The quality of the learned representations impacts the DNN's generalization ability and the…

Adversarial RobustnessDeep Learning