Papers › Ladder Variational Autoencoders

Ladder Variational Autoencoders

6 Feb 2016NeurIPS 2016 12arXiv:1602.02282archive 2025-07-28

Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, Ole Winther

Variational Autoencoders are powerful models for unsupervised learning. However deep models with several layers of dependent stochastic variables are difficult to train which limits the improvements obtained using these highly expressive models. We propose a new inference model, the Ladder Variational Autoencoder, that recursively corrects the generative distribution by a data dependent approximate likelihood in a process resembling the recently proposed Ladder Network. We show that this model provides state of the art predictive log-likelihood and tighter log-likelihood lower bound compared to the purely bottom-up inference in layered Variational Autoencoders and other generative models. We provide a detailed analysis of the learned hierarchical latent representation and show that our new inference model is qualitatively different and utilizes a deeper more distributed hierarchy of latent variables. Finally, we observe that batch normalization and deterministic warm-up (gradually turning on the KL-term) are crucial for training variational models with many stochastic layers.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1602.02282")

Code

Syntology Ran 3 of 9 code samples harvested from 2 repositories linked to this paper; 6 have no recorded run. Of those that ran: 2 ran · fixture could not drive it; 1 ran with no contract checked.

By repository: community (archive-listed): 9 samples from 2 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

casperkaae/LVAE officialmentioned in papermentioned on GitHub report
Leozyc-waseda/DeepLearning_Course_Homework mentioned on GitHubpytorchMIT report
divymurli/VAEs mentioned on GitHubpytorch report
simonamtoft/ml-library mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 3 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

2ran · fixture could not drive it
1ran
6unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

IOU Leozyc-waseda/DeepLearning_Course_Homework/gen_anchors.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · ff92ad8f00e93bbc · report
avg_IOU Leozyc-waseda/DeepLearning_Course_Homework/gen_anchors.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · 1a3fa3dda9a8b100 · report
convert Leozyc-waseda/DeepLearning_Course_Homework/gen_files.py community (archive-listed) ran MIT (permissive) · 04bbdadb21f8b94d · report
discretized_mix_logistic_loss addtt/ladder-vae-pytorch/lib/likelihoods.py community (archive-listed) unverified MIT (permissive) · 02f3a50faf2e52a3 · report
kl_normal_mc addtt/ladder-vae-pytorch/lib/stochastic.py community (archive-listed) unverified MIT (permissive) · 1ab085dba2b341ea · report
log_bernoulli addtt/ladder-vae-pytorch/lib/likelihoods.py community (archive-listed) unverified MIT (permissive) · 84eb98948d67591f · report
log_discretized_logistic addtt/ladder-vae-pytorch/lib/likelihoods.py community (archive-listed) unverified MIT (permissive) · fabc798a2d64531f · report
logistic_rsample addtt/ladder-vae-pytorch/lib/stochastic.py community (archive-listed) unverified MIT (permissive) · 4686a937eb425646 · report
sample_from_discretized_mix_logistic addtt/ladder-vae-pytorch/lib/stochastic.py community (archive-listed) unverified MIT (permissive) · be3871d2562a0801 · report

Tasks

Unsupervised MNIST

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: Hierarchical VAE

Batch NormalizationHierarchical VAE

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections