Adversarial Stacked Auto-Encoders for Fair Representation Learning
Not on the map. Why?
Abstract (arXiv)
Training machine learning models with the only accuracy as a final goal may promote prejudices and discriminatory behaviors embedded in the data. One solution is to learn latent representations that fulfill specific fairness metrics. Different types of learning methods are employed to map data into the fair representational space. The main purpose is to learn a latent representation of data that scores well on a fairness metric while maintaining the usability for the downstream task. In this paper, we propose a new fair representation learning approach that leverages different levels of representation of data to tighten the fairness bounds of the learned representation. Our results show that stacking different auto-encoders and enforcing fairness at different latent spaces result in an improvement of fairness compared to other existing approaches.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 11 of its 21 references that are in the map. First posted on arXiv 27 Jul 2021.
Builds on
11 of 21 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2017Multimodal Machine Learning: A Survey and Taxonomycited by 1,013
- 2018Learning Adversarially Fair and Transferable Representationscited by 353
- 2015The Variational Fair Autoencodercited by 223
- 2015Censoring Representations with an Adversarycited by 192
- 2017Data Decisions and Theoretical Implications when Adversarially Learning Fair Representationscited by 165
- 2016Stacked Generative Adversarial Networkscited by 44
- 2020Anomaly Detection based on Zero-Shot Outlier Synthesis and Hierarchical Feature Distillationcited by 18
- 2021On the Fairness of Generative Adversarial Networks (GANs)cited by 14
Built on by
Citing papers per year: 2022: 2; 2023: 1.
3 papers.