Pith. sign in

REVIEW 4 cited by

Variational Inference of Disentangled Latent Concepts from Unlabeled Observations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.00848 v3 pith:KT6V46AF submitted 2017-11-02 cs.LG cs.AIcs.CVstat.ML

Variational Inference of Disentangled Latent Concepts from Unlabeled Observations

classification cs.LG cs.AIcs.CVstat.ML
keywords disentangleddisentanglementdatalatentrepresentationsfactorsinferenceobservations
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant representations, transferability to other tasks, interpretability, etc. We consider the problem of unsupervised learning of disentangled representations from large pool of unlabeled observations, and propose a variational inference based approach to infer disentangled latent factors. We introduce a regularizer on the expectation of the approximate posterior over observed data that encourages the disentanglement. We also propose a new disentanglement metric which is better aligned with the qualitative disentanglement observed in the decoder's output. We empirically observe significant improvement over existing methods in terms of both disentanglement and data likelihood (reconstruction quality).

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    cs.LG 2026-06 unverdicted novelty 7.0

    Enforcing local orthogonality on the Jacobian of the generative mapping yields identifiability for general nonlinear models when the latent domain has full combinatorial support.

  2. Monotonic Kolmogorov-Arnold Networks: A Theoretical and Empirical Study of Monotonicity as an Inductive Bias

    cs.LG 2026-06 unverdicted novelty 7.0

    MKAN adds hard unconstrained monotonicity to KANs via reparameterization and proves a size bound of at most 2N* for monotone equivalents of ball-partition feature extractors.

  3. MB-Loc: Multi-planar Bird's-eye-view Localization in outdoor LiDAR scenes

    cs.CV 2026-06 unverdicted novelty 6.0

    MB-Loc projects LiDAR point clouds into multi-planar BEV images, applies 2D CNNs with a KL-regularized latent bottleneck and 3D augmentations, and reports real-time state-of-the-art localization accuracy on the NCLT dataset.

  4. A Systematic Study of Behavioral Cloning for Scientific Data Annotation

    cs.HC 2026-05 unverdicted novelty 6.0

    Introduces 9 synthetic annotation tasks and benchmarks for behavioral cloning, finding hierarchical skill learning, scaling benefits, effective multi-task pretraining, and shared internal representations of task phase...