Weakly Supervised Invariant Representation Learning Via Disentangling Known and Unknown Nuisance Factors
Not on the map. Why?
Abstract (arXiv)
Disentangled and invariant representations are two critical goals of representation learning and many approaches have been proposed to achieve either one of them. However, those two goals are actually complementary to each other so that we propose a framework to accomplish both of them simultaneously. We introduce a weakly supervised signal to learn disentangled representation which consists of three splits containing predictive, known nuisance and unknown nuisance information respectively. Furthermore, we incorporate contrastive method to enforce representation invariance. Experiments shows that the proposed method outperforms state-of-the-art (SOTA) methods on four standard benchmarks and shows that the proposed method can have better adversarial defense ability comparing to other methods without adversarial training.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 32 references that are in the map. First posted on arXiv 15 Sep 2022.
Builds on
26 of 32 references.
References · 26
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2020Supervised Contrastive Learningcited by 2,829
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2016Adversarial Machine Learning at Scalecited by 936
- 2018Disentangling by Factorisingcited by 616
- 2020Understanding the Behaviour of Contrastive Losscited by 398
- 2018Understanding disentangling in β-VAEcited by 335
- 2017Variational Inference of Disentangled Latent Concepts from Unlabeled Observationscited by 241
14 more
- 2020Weakly-Supervised Disentanglement Without Compromisescited by 239
- 2015The Variational Fair Autoencodercited by 223
- 2018Isolating Sources of Disentanglement in Variational Autoencoderscited by 167
- 2019Scalable methods for computing state similarity in deterministic Markov Decision Processescited by 133
- 2017Controllable Invariance through Adversarial Feature Learningcited by 127
- 2018Invariant Representations without Adversarial Trainingcited by 112
- 2018Robustly Disentangled Causal Mechanisms: Validating Deep Representations for Interventional Robustnesscited by 108
- 2019Are Disentangled Representations Helpful for Abstract Visual Reasoning?cited by 100
- 2019On the Transfer of Inductive Bias from Simulation to the Real World: a New Disentanglement Datasetcited by 100
- 2019Disentangling Factors of Variation Using Few Labelscited by 57
- 2019Learning Disentangled Representations via Mutual Information Estimationcited by 52
- 2018Unsupervised Adversarial Invariancecited by 14
- 2014Learning unbiased featurescited by 10
- 2019A Cyclically-Trained Adversarial Network for Invariant Representation Learningcited by 3
Built on by
Not cited yet.