Fairness with Overlapping Groups
In algorithmically fair prediction problems, a standard goal is to ensure the equality of fairness metrics across multiple overlapping groups simultaneously. We reconsider this standard fair classification problem using a probabilistic population analysis, which, in turn, reveals the Bayes-optimal classifier. Our approach unifies a variety of existing group-fair classification methods and enables extensions to a wide range of non-decomposable multiclass performance metrics and fairness measures. The Bayes-optimal classifier further inspires consistent procedures for algorithmically fair classification with overlapping groups. On a variety of real datasets, the proposed approach outperforms baselines in terms of its fairness-performance tradeoff.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationFairnessGeneral ClassificationSimilar Papers 제목 키워드 기반
Fairness with Overlapping Groups; a Probabilistic Perspective
In algorithmically fair prediction problems, a standard goal is to ensure the equality of fairness metrics across multiple overlapping groups simultaneously. We reconsider this standard fair classification problem using …
ClassificationFairnessGeneral ClassificationAdvancing subgroup fairness via sleeping experts
We study methods for improving fairness to subgroups in settings with overlapping populations and sequential predictions. Classical notions of fairness focus on the balance of some property across different populations. …
FairnessUnleashing Linear Optimizers for Group-Fair Learning and Optimization
Most systems and learning algorithms optimize average performance or average loss -- one reason being computational complexity. However, many objectives of practical interest are more complex than simply average loss. Th…
FairnessFairness in multi-class multi-group classification problems via contextial coherent risk measures
We propose a new design of fair classifiers for multi-class classification problems in the presence of vector-valued sensitive attributes. In that scenario each sensitive attribute has multiple values and forms several g…
Multi-class ClassificationFair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights
Data summarization tasks are often modeled as $k$-clustering problems, where the goal is to choose $k$ data points, called cluster centers, that best represent the dataset by minimizing a clustering objective. A popular …
ClusteringData SummarizationFairness