Papers › A Batch Normalized Inference Network Keeps the KL Vanishing Away

A Batch Normalized Inference Network Keeps the KL Vanishing Away

27 Apr 2020ACL 2020 6arXiv:2004.12585archive 2025-07-28

Qile Zhu, Jianlin Su, Wei Bi, Xiaojiang Liu, Xiyao Ma, Xiaolin Li, Dapeng Wu

Variational Autoencoder (VAE) is widely used as a generative model to approximate a model's posterior on latent variables by combining the amortized variational inference and deep neural networks. However, when paired with strong autoregressive decoders, VAE often converges to a degenerated local optimum known as "posterior collapse". Previous approaches consider the Kullback Leibler divergence (KL) individual for each datapoint. We propose to let the KL follow a distribution across the whole dataset, and analyze that it is sufficient to prevent posterior collapse by keeping the expectation of the KL's distribution positive. Then we propose Batch Normalized-VAE (BN-VAE), a simple but effective approach to set a lower bound of the expectation by regularizing the distribution of the approximate posterior's parameters. Without introducing any new model component or modifying the objective, our approach can avoid the posterior collapse effectively and efficiently. We further show that the proposed BN-VAE can be extended to conditional VAE (CVAE). Empirically, our approach surpasses strong autoregressive baselines on language modeling, text classification and dialogue generation, and rivals more complex approaches while keeping almost the same training time as VAE.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 11 samples from 1 repository, 5 ran (4 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

valdersoul/bn-vae officialmentioned in papermentioned on GitHubpytorchMITSyntology: 11 samples, 5 ran (1 instrument-failed) · 6 unverified 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

11 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong
3ran
6unverified

Licence: 2 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. For 2 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from valdersoul/bn-vae. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

valdersoul/bn-vae official repository 11 samples, 5 ran (1 instrument-failed) · 6 unverified
calc_mi utils.py ran MIT (permissive) · cd7e66b917a18914 · report fixture: signature model:callable/0/?, test_data_batch:list/1/Tensor · returned Tensor · level recorded 2026-09-25
create_exp_dir in 6 papers exp_utils.py ran MIT (permissive) · c8da81fe940d3ca2 · report fixture: signature dir_path:str/0/str, scripts_to_save:list/1/str, debug:bool/0/bool · returned partial · level recorded 2026-09-25
generate_grid in 14 papers modules/utils.py ran MIT (permissive) · 69f9f574272f9c32 · report fixture: signature zmin:float/0/float, zmax:float/0/float, dz:float/0/float, device:str/0/str, ndim:int/0/int · returned tuple · level recorded 2026-09-25
log_sum_exp in 51 papers
census: 10 implementations from 12 papers, 5 distinct outputs across 3 buckets, one shared input per bucket this sample: bucket 1 of 3, arg 1: rank 2, kind float, dtype float32
modules/utils.py ran · our draft was wrong MIT (permissive) · 5efe6eb2209f6591 · report fixture: signature value:Tensor/2/float, dim:int/0/int, keepdim:bool/0/bool · returned Tensor · level recorded 2026-09-22
safe_log in 27 papers
census: 5 implementations from 5 papers, 3 distinct outputs on one shared input this sample: bucket 1 of 1, arg 1: rank 2, kind float, dtype float32
modules/utils.py ran · honoured contract fingerprinted MIT (permissive) here; the stored copy is pointer only · 6298a45a525420e8 · report fixture: signature z:Tensor/2/float · returned Tensor · level recorded 2026-09-22
calc_au utils.py unverified MIT (permissive) · ecb556d46a1e1a8e · report
calc_iwnll utils.py unverified MIT (permissive) · 6df3d4cb4d4dc5c5 · report
get_confirm_token in 41 papers prepare_data.py unverified MIT (permissive) here; the stored copy is pointer only · 135b3dc835ffe6ad · report
get_logger in 383 papers exp_utils.py unverified MIT (permissive) · 2a751ef26f71f337 · report
test in 377 papers lm.py unverified MIT (permissive) · f1ba669623777faf · report
test in 377 papers t_s_f.py unverified MIT (permissive) · 7ad017041756a7ce · report

Tasks

Dialogue GenerationLanguage ModelingLanguage ModellingText ClassificationVariational Inferencetext-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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