Unified approach for fair classification with overlapping groups.
problem Ensuring fairness across multiple overlapping groups in prediction problems.
method Probabilistic population analysis leading to Bayes-optimal classifier, unifying existing methods.
result Outperforms baselines in fairness-performance tradeoff on real datasets.
FaiREE provides fair classification with guarantees for small datasets.
problem Fairness in classification often requires large sample sizes and distributional assumptions.
method FaiREE offers finite-sample and distribution-free fairness guarantees.
result FaiREE achieves optimal accuracy and satisfies various fairness notions.
Paper proposes GEG to enhance fairness in binary and multi-class classification.
problem Fairness in multi-class classification tasks is under-explored.
method Formulates multi-objective problem between effectiveness and fairness constraints, proposes GEG algorithm.
result GEG improves fairness up to 92% and decreases accuracy up to 14%.
Developing classification algorithms that are fair with respect to sensitive attributes of the data has become an important problem due to the growing deployment of classification algorithms in various social contexts. Several recent works have focused on fairness with respect to a specific metric, modeled the correspo…
FIFA improves fairness in imbalanced datasets by encouraging both classification and fairness generalization.
problem Imbalanced datasets lead to poor fairness generalization in classifiers.
method FIFA: Imbalance-Fairness-Aware approach that encourages both classification and fairness generalization.
result FIFA improves fairness generalization on real-world datasets.
This paper studies fairness and privacy in federated learning, proposing algorithms to balance both.
problem Joint impact of differential privacy and fairness in federated classification.
method Proposes FDP-Fair and CDP-Fair algorithms for demographic disparity constrained classification under federated differential privacy.
result Established theoretical guarantees on privacy, fairness, and excess risk control.
Fairness-aware classification is receiving increasing attention in the machine learning fields. Recently research proposes to formulate the fairness-aware classification as constrained optimization problems. However, several limitations exist in previous works due to the lack of a theoretical framework for guiding the …
New metric reduces arbitrariness in fair binary classification predictions.
problem Variance in predictions leads to arbitrary decisions in fair classification.
method Developed a self-consistency metric and an abstention algorithm.
result Fair binary classification is often close to fair due to variance, not interventions.
Fair classification has been a topic of intense study in machine learning, and several algorithms have been proposed towards this important task. However, in a recent study, Friedler et al. observed that fair classification algorithms may not be stable with respect to variations in the training dataset -- a crucial con…
Proposes a new fairness definition based on equity for machine learning classification.
problem Machine learning systems can perpetuate societal biases.
method Formalizes a new fairness definition based on equity, operationalizes it for classification, and evaluates its effectiveness.
result Demonstrates the effectiveness of the new fairness definition for equitable classification.
Paper studies fair classification of functional data.
problem Mitigating disparities in functional data classification.
method Unified framework for fairness-aware functional classification.
result Established theoretical guarantees on fairness and excess risk controls.
Unified framework improves fair classification by selecting representative data points.
problem Improving fair classification outcomes in the presence of unintentional biases.
method Develops a unified framework to jointly optimize accuracy and fairness, recasting as mixed-integer convex programs.
result The framework can be used to enhance classification fairness by selecting more representative data points.
Differentially private fair binary classification algorithm developed.
problem Balancing privacy and fairness in binary classification.
method Decoupling technique for fairness, refinement for differential privacy.
result Algorithm maintains fairness, privacy, and utility guarantees.
The paper tackles fair classification with multiple sensitive features.
problem Existing fair classification methods often consider a single sensitive feature, but in practice, individuals are defined by multiple sensitive features.
method Characterizes Bayes-optimal fair classifiers for multiple sensitive features under various fairness measures, proposing in-processing and post-processing algorithms.
result Bayes-optimal fair classifiers for multiple sensitive features are instance-dependent thresholding rules that rely on a weighted sum of group membership probabilities.
In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "…
FairNN learns fair representations and decisions by optimizing a multi-objective loss function.
problem Fairness in machine learning models for decision-making.
method Joint feature representation and classification with multi-objective loss function.
result Joint approach outperforms separate treatment of fairness in representation learning or supervised learning.
The paper explores fair regression and classification under demographic parity constraints.
problem Ensuring fairness in regression and classification models under demographic parity constraints.
method Characterizes the optimal fair regression function using a barycenter problem with optimal transport costs and studies the connection between fair classification and regression.
result The optimal fair regression function is derived from the solution to a barycenter problem with optimal transport costs, and the optimal fair cost-sensitive classifiers can be derived by applying thresholds to this function.
Paper characterizes fairness vs. accuracy tradeoff in classification.
problem Mitigating bias in machine learning models.
method Characterizes the tradeoff between fairness and accuracy, provides a post-processing algorithm.
result Post-processing algorithm yields optimal fair classifier when score is Bayes optimal.
Develops methods for fair classification under linear disparity constraints.
problem Disparate impacts of machine learning algorithms on protected groups.
method Bayes-optimal fair classification methods via pre-, in-, and post-processing.
result Explicit forms of Bayes-optimal fair classifiers under linear disparity measures.
Optimal LDP mechanisms reduce data unfairness in classification.
problem Reducing data unfairness in classification models.
method Developed a closed-form optimal mechanism for binary attributes and a tractable framework for multi-valued attributes.
result Optimal LDP mechanisms improve fairness in classification while maintaining accuracy close to non-private models.
Study on missing data mechanisms and simple imputation methods in fairness of machine learning algorithms.
problem Impact of missing data mechanisms and simple imputation methods on fairness of machine learning algorithms.
method Three popular datasets for classification fairness were used. Missing values were generated using three missing data mechanisms. Various missing data handling techniques (listwise deletion, mean imputation, mode imputation, multiple imputation) were applied to the datasets. Fairness was assessed using classification algorithms (random forests).
result Missing data mechanism does not significantly impact fairness; listwise deletion gives highest fairness on average.
New algorithm reduces discrimination in predictions.
problem Tackles potential discrimination in AI predictions.
method Integrates fairness adjustments into tree-building process.
result Reduces discriminatory predictions without significant loss in accuracy.
Unified framework for fair classification with group-blindness/awareness guarantees.
problem Challenges in enforcing fairness and group-blindness in binary classification.
method Unified framework based on post-processing procedure, applicable to various group fairness notions.
result Minimax rate-optimality of the proposed algorithm with controlled excess risk.
Framework for fair classification with noisy protected attributes and provable guarantees.
problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.
New algorithm improves group fairness in social classification problems by exploiting performativity.
problem Inequities in social classification problems due to performativity.
method Develops algorithmic fairness practices that leverage performativity to achieve stronger group fairness guarantees.
result Achieves stronger group fairness guarantees compared to non-performative settings.
A new method learns fair classifiers without sacrificing accuracy.
problem Designing fair classifiers that do not discriminate based on sensitive attributes.
method A model-agnostic multi-objective architecture using a differentiable relaxation of fairness notions.
result Our method achieves lower loss of accuracy compared to current debiasing algorithms.
Study fairness in ordinal regression using threshold models.
problem Fairness in ordinal regression predictions.
method Adapted fairness notions from fair ranking; use threshold model with scoring function and thresholds; apply binary classification for scoring function and local search for thresholds.
result Generalization guarantees on predictor error and fairness violation; effectiveness demonstrated in experiments.
The paper tackles fair set-valued classification under demographic parity constraints.
problem Set-valued classification can amplify discriminatory bias, especially in multiclass settings.
method Proposes two strategies: an oracle-based method and a proxy method, both aiming to satisfy demographic parity and expected size constraints.
result Established distribution-free convergence rates and excess-risk bounds for both methods.
Privacy affects fairness in classification models, but not drastically.
problem The impact of differential privacy on fairness in classification models.
method Theoretical analysis proving Lipschitz continuity of fairness measures and a non-asymptotic bound on fairness levels.
result Privacy impacts fairness, but not significantly as the number of samples increases.
As the use of black-box models becomes ubiquitous in high stake decision-making systems, demands for fair and interpretable models are increasing. While it has been shown that interpretable models can be as accurate as black-box models in several critical domains, existing fair classification techniques that are interp…
Paper explores fair classification with bounded disparity using finite datasets.
problem Ensuring fairness in binary classification with protected groups.
method Minimax optimal approach with fairness constraints and demographic disparity control.
result Proposes FairBayes-DDP+ method that achieves minimax lower bound on fairness-aware excess risk.
In classification models fairness can be ensured by solving a constrained optimization problem. We focus on fairness constraints like Disparate Impact, Demographic Parity, and Equalized Odds, which are non-decomposable and non-convex. Researchers define convex surrogates of the constraints and then apply convex optimiz…
New framework reduces strategic manipulation cost for minority groups in fair classification.
problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.
New framework for fair classification in adversarial settings with provable guarantees.
problem Fairness in classification with adversarial perturbations of protected attributes.
method Optimization framework for learning fair classifiers with provable guarantees.
result Near-tightness of accuracy and fairness guarantees for multiple protected attributes and various hypothesis classes.
Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.
problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.
A new method SLIDE ensures fairness in AI models.
problem Ensuring fairness in AI models while maintaining computational feasibility.
method Proposes a new surrogate fairness constraint SLIDE.
result SLIDE ensures fairness in AI models asymptotically and converges fast.
This work transfers fairness notions from binary classification to learning to rank.
problem Fairness concerns in automated ranking systems.
method Formalism to incorporate fairness objectives in learning to rank with provable guarantees.
result Improves ranking fairness substantially with minimal loss in model quality.
A new bias score method optimizes fairness in classification.
problem Ensuring fairness in binary classification under group constraints.
method Introducing bias scores and developing a post-hoc approach to adapt to fairness constraints.
result The method maintains high accuracy while ensuring fairness constraints.
Proposes a method to select fair performance metrics through metric elicitation.
problem Choosing fair performance metrics in multiclass classification with multiple sensitive groups.
method Metric elicitation strategy that requires only relative preference feedback and is robust to noise.
result Elicits group-fair performance metrics for multiclass classification problems.
Extracts fairness truth from classifiers using an oracle.
problem Fairness in classification algorithms without context.
method Uses fairness oracle to learn underlying fairness truth.
result Extracts metric fairness from classifiers.
Proposes a fair classification model using Wasserstein ambiguity sets.
problem Ensuring fairness in classification models.
method Distributionally robust optimization with Wasserstein ambiguity sets and equal opportunity fairness constraint.
result Improves fairness without significant loss in predictive accuracy.
New algorithms handle missing data to improve fairness in machine learning.
problem Missing values in data can lead to unfair outcomes in machine learning models.
method Developed scalable and adaptive algorithms to handle missing values while preserving predictive information.
result Our adaptive algorithms consistently achieve higher fairness and accuracy than standard impute-then-classify methods.
The study connects fairness constraints with optimal transport to derive new insights in classification.
problem Ensuring fairness in classification models without sacrificing performance.
method Using Wasserstein barycenters and optimal transport, the study characterizes optimal classification functions under fairness constraints.
result Maximizing fairness under demographic parity is equivalent to solving a regression problem.
Paper proves fair classification can be done via simple thresholding.
problem Achieving fair binary classification subject to group fairness constraints.
method Proves Bayes optimal fair learning rule is a group-wise thresholding rule over the Bayes regressor with randomization.
result Proposes an efficient unconstrained optimization algorithm for post-processing fair classification.
Proposes a fairness criterion for multi-objective optimization in classification.
problem Ensuring fairness in classification models across different groups.
method Formulates a minimax Pareto fairness criterion and provides an optimization algorithm.
result Demonstrates improved fairness compared to existing methods on various real-world datasets.
We propose an approach to fair classification that enforces independence between the classifier outputs and sensitive information by minimizing Wasserstein-1 distances. The approach has desirable theoretical properties and is robust to specific choices of the threshold used to obtain class predictions from model output…
Paper introduces fair GLMs with convex penalty for equalizing GLM outcomes.
problem Achieving fairness in GLMs for practical use.
method Two fairness criteria based on GLM outcomes/log-likelihoods, achieved via a convex penalty on linear components.
result The fair GLM estimator is efficient and can handle various response variables.
How can we build recommender systems to take into account fairness? Real-world recommender systems are often composed of multiple models, built by multiple teams. However, most research on fairness focuses on improving fairness in a single model. Further, recent research on classification fairness has shown that combin…