Learning and Inference in Imaginary Noise Models
Not on the map. Why?
Abstract (arXiv)
Inspired by recent developments in learning smoothed densities with empirical Bayes, we study variational autoencoders with a decoder that is tailored for the random variable Y=X+N(0,σ2 Id). A notion of smoothed variational inference emerges where the smoothing is implicitly enforced by the noise model of the decoder; "implicit", since during training the encoder only sees clean samples. This is the concept of imaginary noise model, where the noise model dictates the functional form of the variational lower bound L(σ), but the noisy data are never seen during learning. The model is named σ-VAE. We prove that all σ-VAEs are equivalent to each other via a simple β-VAE expansion: L(σ2) equiv L(σ1,β), where β=σ22/σ12. We prove a similar result for the Laplace distribution in exponential families. Empirically, we report an intriguing power law Drm KL ~ σ-nu for the learned models and we study the inference in the σ-VAE for unseen noisy data. The experiments were performed on MNIST, where we show that quite remarkably the model can make reasonable inferences on extremely noisy samples even though it has not seen any during training. The vanilla VAE completely breaks down in this regime. We finish with a hypothesis (the XYZ hypothesis) on the findings here.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 18 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Multimeasurement Generative Modelscited by 8
- 2021Multimeasurement Generative Models18 Dec 2021