A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classification
Not on the map. Why?
Abstract (arXiv)
One of the pursued objectives of deep learning is to provide tools that learn abstract representations of reality from the observation of multiple contextual situations. More precisely, one wishes to extract disentangled representations which are (i) low dimensional and (ii) whose components are independent and correspond to concepts capturing the essence of the objects under consideration (Locatello et al., 2019b). One step towards this ambitious project consists in learning disentangled representations with respect to a predefined (sensitive) attribute, e.g., the gender or age of the writer. Perhaps one of the main application for such disentangled representations is fair classification. Existing methods extract the last layer of a neural network trained with a loss that is composed of a cross-entropy objective and a disentanglement regularizer. In this work, we adopt an information-theoretic view of this problem which motivates a novel family of regularizers that minimizes the mutual information between the latent representation and the sensitive attribute conditional to the target. The resulting set of losses, called CLINIC, is parameter free and thus, it is easier and faster to train. CLINIC losses are studied through extensive numerical experiments by training over 2k neural networks. We demonstrate that our methods offer a better disentanglement/accuracy trade-off than previous techniques, and generalize better than training with cross-entropy loss solely provided that the disentanglement task is not too constraining.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 81 of its 120 references that are in the map. First posted on arXiv 21 Oct 2023.
Builds on
81 of 120 references.
References · 81
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2020Supervised Contrastive Learningcited by 2,829
38 more
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,367
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2020Fast is better than free: Revisiting adversarial trainingcited by 727
- 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
- 2020Contrastive Learning with Hard Negative Samplescited by 628
- 2015Empirical Evaluation of Rectified Activations in Convolutional Networkcited by 519
- 2020Null It Out: Guarding Protected Attributes by Iterative Nullspace Projectioncited by 455
- 2020Understanding the Behaviour of Contrastive Losscited by 398
- 2020Spatiotemporal Contrastive Video Representation Learningcited by 372
- 2020Fairness in Machine Learning: A Surveycited by 370
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 349
- 2020DeCLUTR: Deep Contrastive Learning for Unsupervised Textual Representationscited by 251
- 2020CLUB: A Contrastive Log-ratio Upper Bound of Mutual Informationcited by 235
- 2019Towards Stable and Efficient Training of Verifiably Robust Neural Networkscited by 205
- 2018An efficient framework for learning sentence representationscited by 198
- 2016Demographic Dialectal Variation in Social Media: A Case Study of African-American Englishcited by 196
- 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
- 2018Adversarial Removal of Demographic Attributes from Text Datacited by 170
- 2020CERT: Contrastive Self-supervised Learning for Language Understandingcited by 169
- 2019On the Fairness of Disentangled Representationscited by 144
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2017Controllable Invariance through Adversarial Feature Learningcited by 127
- 2018Disentangled Representation Learning for Non-Parallel Text Style Transfercited by 127
- 2021Scaling Deep Contrastive Learning Batch Size under Memory Limited Setupcited by 127
- 2019Learning Dense Representations for Entity Retrievalcited by 122
- 2018Understanding the Origins of Bias in Word Embeddingscited by 91
- 2020Hate Speech Detection and Racial Bias Mitigation in Social Media based on BERT modelcited by 87
- 2021Mitigating Language-Dependent Ethnic Bias in BERTcited by 87
- 2020Multi-Dimensional Gender Bias Classificationcited by 80
- 2022Of Human Criteria and Automatic Metrics: A Benchmark of the Evaluation of Story Generationcited by 75
- 2020A Simple but Tough-to-Beat Data Augmentation Approach for Natural Language Understanding and Generationcited by 72
- 2017On Formalizing Fairness in Prediction with Machine Learningcited by 65
- 2021Stereotype and Skew: Quantifying Gender Bias in Pre-trained and Fine-tuned Language Modelscited by 57
- 2019Conscientious Classification: A Data Scientist's Guide to Discrimination-Aware Classificationcited by 55
- 2018Privacy-preserving Neural Representations of Textcited by 54
50 most cited of 81 All 81 (JSON)
Built on by
Citing papers per year: 2024: 1.
1 paper.