FairMixRep : Self-supervised Robust Representation Learning for
Heterogeneous Data with Fairness constraints
- URL: http://arxiv.org/abs/2010.03228v2
- Date: Wed, 14 Oct 2020 06:12:38 GMT
- Title: FairMixRep : Self-supervised Robust Representation Learning for
Heterogeneous Data with Fairness constraints
- Authors: Souradip Chakraborty, Ekansh Verma, Saswata Sahoo, Jyotishka Datta
- Abstract summary: We address the problem of Mixed Space Fair Representation learning from an unsupervised perspective.
We learn a Universal representation that is timely, unique, and a novel research contribution.
- Score: 1.1661238776379117
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Representation Learning in a heterogeneous space with mixed variables of
numerical and categorical types has interesting challenges due to its complex
feature manifold. Moreover, feature learning in an unsupervised setup, without
class labels and a suitable learning loss function, adds to the problem
complexity. Further, the learned representation and subsequent predictions
should not reflect discriminatory behavior towards certain sensitive groups or
attributes. The proposed feature map should preserve maximum variations present
in the data and needs to be fair with respect to the sensitive variables. We
propose, in the first phase of our work, an efficient encoder-decoder framework
to capture the mixed-domain information. The second phase of our work focuses
on de-biasing the mixed space representations by adding relevant fairness
constraints. This ensures minimal information loss between the representations
before and after the fairness-preserving projections. Both the information
content and the fairness aspect of the final representation learned has been
validated through several metrics where it shows excellent performance. Our
work (FairMixRep) addresses the problem of Mixed Space Fair Representation
learning from an unsupervised perspective and learns a Universal representation
that is timely, unique, and a novel research contribution.
Related papers
- Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning [49.417414031031264]
This paper studies learning fair encoders in a self-supervised learning setting.
All data are unlabeled and only a small portion of them are annotated with sensitive attributes.
arXiv Detail & Related papers (2024-06-09T08:11:12Z) - Leveraging sparse and shared feature activations for disentangled
representation learning [112.22699167017471]
We propose to leverage knowledge extracted from a diversified set of supervised tasks to learn a common disentangled representation.
We validate our approach on six real world distribution shift benchmarks, and different data modalities.
arXiv Detail & Related papers (2023-04-17T01:33:24Z) - Learning Fair Representation via Distributional Contrastive
Disentanglement [9.577369164287813]
Learning fair representation is crucial for achieving fairness or debiasing sensitive information.
We propose a new approach, learning FAir Representation via distributional CONtrastive Variational AutoEncoder (FarconVAE)
We show superior performance on fairness, pretrained model debiasing, and domain generalization tasks from various modalities.
arXiv Detail & Related papers (2022-06-17T12:58:58Z) - Fair Contrastive Learning for Facial Attribute Classification [25.436462696033846]
We propose a new Fair Supervised Contrastive Loss (FSCL) for fair visual representation learning.
In this paper, we for the first time analyze unfairness caused by supervised contrastive learning.
Our method is robust to the intensity of data bias and effectively works in incomplete supervised settings.
arXiv Detail & Related papers (2022-03-30T11:16:18Z) - Adversarial Stacked Auto-Encoders for Fair Representation Learning [1.061960673667643]
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.
arXiv Detail & Related papers (2021-07-27T13:49:18Z) - MultiFair: Multi-Group Fairness in Machine Learning [52.24956510371455]
We study multi-group fairness in machine learning (MultiFair)
We propose a generic end-to-end algorithmic framework to solve it.
Our proposed framework is generalizable to many different settings.
arXiv Detail & Related papers (2021-05-24T02:30:22Z) - i-Mix: A Domain-Agnostic Strategy for Contrastive Representation
Learning [117.63815437385321]
We propose i-Mix, a simple yet effective domain-agnostic regularization strategy for improving contrastive representation learning.
In experiments, we demonstrate that i-Mix consistently improves the quality of learned representations across domains.
arXiv Detail & Related papers (2020-10-17T23:32:26Z) - Fairness in Semi-supervised Learning: Unlabeled Data Help to Reduce
Discrimination [53.3082498402884]
A growing specter in the rise of machine learning is whether the decisions made by machine learning models are fair.
We present a framework of fair semi-supervised learning in the pre-processing phase, including pseudo labeling to predict labels for unlabeled data.
A theoretical decomposition analysis of bias, variance and noise highlights the different sources of discrimination and the impact they have on fairness in semi-supervised learning.
arXiv Detail & Related papers (2020-09-25T05:48:56Z) - Fairness by Learning Orthogonal Disentangled Representations [50.82638766862974]
We propose a novel disentanglement approach to invariant representation problem.
We enforce the meaningful representation to be agnostic to sensitive information by entropy.
The proposed approach is evaluated on five publicly available datasets.
arXiv Detail & Related papers (2020-03-12T11:09:15Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.