Methods › Computer Vision › Likelihood-Based Generative Models › Beta-VAE

Beta-VAE

30 papers tagged archive 2025-07-28

Introduced by Irina Higgins et al. in beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Beta-VAE is a type of variational autoencoder that seeks to discover disentangled latent factors. It modifies VAEs with an adjustable hyperparameter β that balances latent channel capacity and independence constraints with reconstruction accuracy. The idea is to maximize the probability of generating the real data while keeping the distance between the real and estimated distributions small, under a threshold ϵ. We can use the Kuhn-Tucker conditions to write this as a single equation:

ℱ(θ, ϕ, β; x, z) = 𝔼_(q_ϕ(z|x))[logp_θ(x|z)] - β[D_(KL)(logq_θ(z|x)||p(z)) - ϵ]

where the KKT multiplier β is the regularization coefficient that constrains the capacity of the latent channel z and puts implicit independence pressure on the learnt posterior due to the isotropic nature of the Gaussian prior p(z).

We write this again using the complementary slackness assumption to get the Beta-VAE formulation:

ℱ(θ, ϕ, β; x, z) ≥ℒ(θ, ϕ, β; x, z) = 𝔼_(q_ϕ(z|x))[logp_θ(x|z)] - β{D_(KL)(logq_θ(z|x)||p(z))

PaperSourceSee Code · AntixK/PyTorch-VAE

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: BETA; M-VAE; σ-VAE; V-VAE; λ-VAE; Q-VAE; DA-VAE; DU-VAE.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 30 · with a code link: 11 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 30 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 30 of 30, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 22 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Disentanglement14
Representation Learning5
Clustering2
Data Compression2
Graph Generation2
Variational Inference2
Anomaly Detection1
Anomaly Localization1
BIG-bench Machine Learning1
Data Visualization1
Decoder1
Deep Learning1
Finger Vein Recognition1
Graph Embedding1
Graph Neural Network1
Graph Representation Learning1
Model Compression1
Novelty Detection1
Recommendation Systems1
Scheduling1

Usage over time archive 2025-07-28

Papers per year tagged with Beta-VAE: 2017 to 2025, peak 7 7 0 2017: 1 paper 2017 2018: 1 paper 2018 2019: 7 papers 2019 2020: 4 papers 2020 2021: 6 papers 2021 2022: 4 papers 2022 2023: 4 papers 2023 2024: 2 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (30 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Likelihood-Based Generative ModelsGenerative Models

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