AIAny

Variational Lossy Autoencoder

Reframes the VAE's tendency to ignore its latent code as a controllable design choice: by limiting a PixelCNN decoder's receptive field and using autoregressive flow priors, the code is forced to keep only global structure and discard local texture.

Introduction

The famous complaint about VAEs paired with strong autoregressive decoders is that they "ignore" the latent code entirely — the decoder is expressive enough to model the data on its own, so the code collapses to noise. This paper's quiet brilliance is to stop treating that as a bug. It gives a bits-back argument for why the code gets ignored (the decoder will only use latents for information that is cheaper to store there than to model autoregressively), and then weaponizes the principle: shape the decoder so that local detail is cheap to model locally, and the latent is left holding exactly the global structure you wanted.

Key Findings
  • Lossy coding is a feature, not a failure. By capping the PixelCNN decoder's receptive field, local texture becomes cheap to reconstruct pixel-by-pixel, so the latent code is forced to encode only what the decoder can't see locally — global structure. Reconstructions keep the shape and identity while swapping the fine texture.
  • A bits-back account of latent collapse. The "information preference" argument explains posterior collapse not as an optimization quirk but as the model rationally storing each bit wherever it is cheapest, which makes latent usage something you can engineer rather than hope for.
  • Autoregressive flows as the prior. Using autoregressive models for both the prior p(z) and the decoder p(x|z) tightened the bound enough to set new likelihood records on MNIST, Omniglot and Caltech-101 Silhouettes, with competitive CIFAR-10 numbers.
  • Receptive field as a representation knob. What the code learns is dialed by the decoder's window size, turning "what to abstract away" into an explicit architectural decision.
Great Fit / When to Skip

Great fit if you want the conceptual root of why expressive decoders starve the latent space, or a principled way to control what a VAE abstracts versus reconstructs — it remains the cleanest statement of the information-preference idea. Look elsewhere if you want today's image generators; diffusion and large autoregressive transformers long since overtook these likelihood numbers, and the lasting value here is the reasoning, not the benchmark.

Information

  • Websitearxiv.org
  • OrganizationsOpenAI, UC Berkeley
  • AuthorsXi Chen, Diederik P. Kingma, Tim Salimans, Yan Duan, Prafulla Dhariwal, John Schulman, Ilya Sutskever, Pieter Abbeel
  • Published date2016/11/08

More Items

Performs native structural reasoning for proteins, small molecules and inorganic crystals by tokenizing coordinates, topologies and periodic connectivities into a unified structure-aware vocabulary. Treats structural tokens as addressable evidence to produce interpretable prediction traces and improves accuracy across biology, chemistry and materials benchmarks.

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.