Pith. sign in

REVIEW 2 cited by

Disentangled Representation Learning with Wasserstein Total Correlation

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 1912.12818 v1 pith:4IWKCDGB submitted 2019-12-30 cs.LG stat.ML

classification cs.LGstat.ML
keywords correlationtotalwassersteindatadisentangleddisentanglementautoencoderintroduce
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Unsupervised learning of disentangled representations involves uncovering of different factors of variations that contribute to the data generation process. Total correlation penalization has been a key component in recent methods towards disentanglement. However, Kullback-Leibler (KL) divergence-based total correlation is metric-agnostic and sensitive to data samples. In this paper, we introduce Wasserstein total correlation in both variational autoencoder and Wasserstein autoencoder settings to learn disentangled latent representations. A critic is adversarially trained along with the main objective to estimate the Wasserstein total correlation term. We discuss the benefits of using Wasserstein distance over KL divergence to measure independence and conduct quantitative and qualitative experiments on several data sets. Moreover, we introduce a new metric to measure disentanglement. We show that the proposed approach has comparable performances on disentanglement with smaller sacrifices in reconstruction abilities.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Post-Training Augmentation Invariance

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Develops post-training augmentation invariance via augmented encoders and two Wasserstein-based losses to train lightweight MLP adapters that boost robustness on DINOv2 features for STL10 without fine-tuning.

  2. Statistical Inference for Optimal Transport Maps: Recent Advances and Perspectives

    math.ST 2025-06 conditional

    A survey of minimax rates and limit laws for estimating optimal transport maps from samples, covering smooth, Gaussian, semi-discrete, entropic, and divergence-regularized settings.

Pith tools