Dual Swap Disentangling
Not on the map. Why?
Abstract (arXiv)
Learning interpretable disentangled representations is a crucial yet challenging task. In this paper, we propose a weakly semi-supervised method, termed as Dual Swap Disentangling (DSD), for disentangling using both labeled and unlabeled data. Unlike conventional weakly supervised methods that rely on full annotations on the group of samples, we require only limited annotations on paired samples that indicate their shared attribute like the color. Our model takes the form of a dual autoencoder structure. To achieve disentangling using the labeled pairs, we follow a "encoding-swap-decoding" process, where we first swap the parts of their encodings corresponding to the shared attribute and then decode the obtained hybrid codes to reconstruct the original input pairs. For unlabeled pairs, we follow the "encoding-swap-decoding" process twice on designated encoding parts and enforce the final outputs to approximate the input pairs. By isolating parts of the encoding and swapping them back and forth, we impose the dimension-wise modularity and portability of the encodings of the unlabeled samples, which implicitly encourages disentangling under the guidance of labeled pairs. This dual swap mechanism, tailored for semi-supervised setting, turns out to be very effective. Experiments on image datasets from a wide domain show that our model yields state-of-the-art disentangling performances.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 5; 2023: 3; 2024: 0; 2025: 0; 2026: 1.
12 papers.
- 2022Factorizing Knowledge in Neural Networkscited by 59
- 2021Disentanglement and Generalization Under Correlation Shiftscited by 8
- 2021DisUnknown: Distilling Unknown Factors for Disentanglement Learningcited by 6
- 2023Disentanglement Learning via Topologycited by 4
- 2022Do-Operation Guided Causal Representation Learning with Reduced Supervision Strengthcited by 3
- 2022SW-VAE: Weakly Supervised Learn Disentangled Representation Via Latent Factor Swappingcited by 3
- 2023Shadow Datasets, New challenging datasets for Causal Representation Learningcited by 3
- 2022Weakly Supervised Disentangled Representation for Goal-conditioned Reinforcement Learningcited by 2
- 2022Variational Transfer Learning using Cross-Domain Latent Modulationcited by 1
- 2021Weakly Supervised Recovery of Semantic Attributescited by 0
- 2023ProtoVAE: Prototypical Networks for Unsupervised Disentanglementcited by 0
- 2026XFACTORS: Disentangled Information Bottleneck via Contrastive Supervisioncited by 0
- 2026XFACTORS: Disentangled Information Bottleneck via Contrastive Supervision29 Jan 2026
- 2023Disentanglement Learning via Topology24 Aug 2023
- 2023Shadow Datasets, New challenging datasets for Causal Representation Learning10 Aug 2023
- 2023ProtoVAE: Prototypical Networks for Unsupervised Disentanglement16 May 2023
- 2022SW-VAE: Weakly Supervised Learn Disentangled Representation Via Latent Factor Swapping21 Sep 2022
- 2022Factorizing Knowledge in Neural Networks4 Jul 2022
- 2022Do-Operation Guided Causal Representation Learning with Reduced Supervision Strength3 Jun 2022
- 2022Variational Transfer Learning using Cross-Domain Latent Modulation31 May 2022
- 2022Weakly Supervised Disentangled Representation for Goal-conditioned Reinforcement Learning28 Feb 2022
- 2021Disentanglement and Generalization Under Correlation Shifts29 Dec 2021
- 2021DisUnknown: Distilling Unknown Factors for Disentanglement Learning16 Sep 2021
- 2021Weakly Supervised Recovery of Semantic Attributes22 Mar 2021