Enforcing Conditional Independence for Fair Representation Learning and Causal Image Generation
Not on the map. Why?
Abstract (arXiv)
Conditional independence (CI) constraints are critical for defining and evaluating fairness in machine learning, as well as for learning unconfounded or causal representations. Traditional methods for ensuring fairness either blindly learn invariant features with respect to a protected variable (e.g., race when classifying sex from face images) or enforce CI relative to the protected attribute only on the model output (e.g., the sex label). Neither of these methods are effective in enforcing CI in high-dimensional feature spaces. In this paper, we focus on a nascent approach characterizing the CI constraint in terms of two Jensen-Shannon divergence terms, and we extend it to high-dimensional feature spaces using a novel dynamic sampling strategy. In doing so, we introduce a new training paradigm that can be applied to any encoder architecture. We are able to enforce conditional independence of the diffusion autoencoder latent representation with respect to any protected attribute under the equalized odds constraint and show that this approach enables causal image generation with controllable latent spaces. Our experimental results demonstrate that our approach can achieve high accuracy on downstream tasks while upholding equality of odds.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 21 Apr 2024.
Builds on
22 of 37 references.
References · 22
- 2022Generative Adversarial Networkscited by 5,603
- 2016Equality of Opportunity in Supervised Learningcited by 2,000
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
- 2017Counterfactual Fairnesscited by 802
- 2018Mitigating Unwanted Biases with Adversarial Learningcited by 663
- 2021Diffusion Autoencoders: Toward a Meaningful and Decodable Representationcited by 447
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2018Learning Not to Learn: Training Deep Neural Networks with Biased Datacited by 255
- 2018Invariant Representations without Adversarial Trainingcited by 111
- 2021D2C: Diffusion-Denoising Models for Few-shot Conditional Generationcited by 96
- 2016Fully-adaptive Feature Sharing in Multi-Task Networks with Applications in Person Attribute Classificationcited by 93
- 2019Conditional Learning of Fair Representationscited by 78
10 more
- 2019Adversarial Invariant Feature Learning with Accuracy Constraint for Domain Generalizationcited by 43
- 2022Few-Shot Diffusion Modelscited by 37
- 2019Learning Fair Representations for Kernel Modelscited by 17
- 2021The DeCAMFounder: Non-Linear Causal Discovery in the Presence of Hidden Variablescited by 15
- 2021Metadata Normalizationcited by 14
- 2020Causal Imputation via Synthetic Interventionscited by 13
- 2021Through the Data Management Lens: Experimental Analysis and Evaluation of Fair Classificationcited by 13
- 2022A Penalty Approach for Normalizing Feature Distributions to Build Confounder-Free Modelscited by 8
- 2024OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transportcited by 8
- 2019Confounder-Aware Visualization of ConvNetscited by 7
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025CAD-VAE: Leveraging Correlation-Aware Latents for Comprehensive Fair Disentanglementcited by 10
- 2025Diffusion Counterfactual Generation with Semantic Abductioncited by 8
- 2025Revisiting Diffusion Autoencoder Training for Image Reconstruction Qualitycited by 0
- 2026MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairnesscited by 0
- 2026MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness30 Apr 2026
- 2025Diffusion Counterfactual Generation with Semantic Abduction9 Jun 2025
- 2025Revisiting Diffusion Autoencoder Training for Image Reconstruction Quality30 Apr 2025
- 2025CAD-VAE: Leveraging Correlation-Aware Latents for Comprehensive Fair Disentanglement11 Mar 2025