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%.
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.
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.
A method for fair binary classification using both labeled and unlabeled data.
problem Achieving fair binary classification with equal true positive rates across sensitive groups.
method Constructive expression for a group-dependent threshold, plug-in classification procedure using labeled and unlabeled data.
result Plug-in classification procedure is statistically consistent and often superior or competitive with state-of-the-art methods.
The paper proves statistical consistency and fairness guarantees for a plug-in algorithm.
problem Establishing statistical guarantees for fairness-aware binary classification.
method Proves statistical consistency and derives finite sample guarantees for the plug-in algorithm.
result The plug-in algorithm is statistically consistent and guarantees fairness and differential privacy.
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.
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.
Paper optimizes score transformation for fair binary classification.
problem Ensuring fairness in binary classification with predicted scores.
method Formulates and solves a convex optimization problem for transforming scores to meet fairness constraints.
result Derives a closed-form expression for optimal transformed scores and provides guarantees for finite sample settings.
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.
LDA-XGB1 balances fairness and accuracy in lending models.
problem Fair lending practices and model interpretability in binary classification.
method Biobjective optimization using binning and information value, leveraging XGBoost.
result Achieves effective balance between accuracy, fairness, and interpretability.
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.
Proposes a framework for balancing fairness and accuracy in data-restricted binary classification.
problem Balancing fairness and accuracy in applications with data restrictions.
method Directly analyzes the optimal Bayesian classifier's behavior under different data-restricting scenarios, formulating convex optimization problems.
result Demonstrates how accuracy of a Bayesian classifier is affected by fairness constraints in various data-restricting scenarios.
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.
We present a new approach for mitigating unfairness in learned classifiers. In particular, we focus on binary classification tasks over individuals from two populations, where, as our criterion for fairness, we wish to achieve similar false positive rates in both populations, and similar false negative rates in both po…
New framework for fairness in machine learning models using SHAP values and adversarial learning.
problem Fairness of model predictions, especially for unprivileged groups.
method Develops a new fairness definition and a framework using SHAP values and adversarial learning to mitigate bias.
result Models produced are fairer and performant, demonstrating the approach on various datasets.
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.
The paper tackles fairness in scoring functions for binary classification.
problem Fairness in scoring functions for binary classification tasks.
method Introduces ROC-based fairness constraints and learning algorithms.
result Generalization bounds and practical learning algorithms for fair scoring functions.
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.
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.
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.
New research shows fairness in machine learning can sometimes make disadvantaged groups worse off.
problem The impact of fairness constraints in machine learning on different groups.
method Unified, population-level (Bayes) framework for binary classification under prevalent group fairness notions.
result Fairness in machine learning can lead to leveling down, making one or both groups worse off.
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 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.
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.
New fair regression method improves fairness in chronic kidney disease classification.
problem Mitigating societal bias in health care for multiple groups.
method Penalized fair regression framework for multiple groups, with penalties for true positive rate disparity.
result Achieves fairness-accuracy frontier beyond existing methods in simulations and real-world data.
New classifiers ensure fairness by adjusting a base classifier's operating characteristics.
problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.
The paper examines bias in ML models using the Adult dataset.
problem Understanding and mitigating bias in machine learning models.
method Mathematical framework for fair learning, Disparate Impact index, and evaluation of bias reduction methods.
result Some common bias reduction methods are ineffective.
Personalized federated learning improves model accuracy and fairness by leveraging shared representations and local memorization.
problem Sub-optimal performance of federated learning when client data distributions are heterogeneous.
method Proposes a personalization mechanism based on local memorization of shared representations from a collectively trained global model.
result Significantly higher accuracy and fairness compared to state-of-the-art methods.
Develops a method for fairness in multi-task learning using Wasserstein barycenters.
problem Extending fairness to multi-task learning with shared representations.
method Definition of Strong Demographic Parity extended to multi-task learning using multi-marginal Wasserstein barycenters. Closed form solution for optimal fair predictor.
result Empirical results show practical value of post-processing methodology in promoting fair decision-making.
Where machine-learned predictive risk scores inform high-stakes decisions, such as bail and sentencing in criminal justice, fairness has been a serious concern. Recent work has characterized the disparate impact that such risk scores can have when used for a binary classification task. This may not account, however, fo…
Unified framework for fair regression under demographic parity.
problem Ensuring fairness in regression tasks subject to demographic parity constraints.
method Proposes a unified framework applicable to various regression tasks with a broad spectrum of loss functions, derived a novel characterization of the fair risk minimizer, and established theoretical consistency and convergence rates.
result Effective minimization of risk while satisfying fairness constraints across various regression settings.
BIND removes background noise from binary matrices, improving detection accuracy and fairness.
problem Real data often violates the i.i.d assumption for binary matrix entries, leading to inaccurate detection.
method BIND optimizes detection by estimating row- and column-wise mixture distributions and eliminating background noise.
result BIND effectively removes background noise and increases detection accuracy and fairness.
Proposes a new method for fairness in machine learning with multiple protected attributes.
problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.
This survey outlines methods to ensure fairness in machine learning.
problem Mitigating bias and promoting fairness in machine learning applications.
method Organizes approaches into pre-processing, in-processing, and post-processing methods.
result Summarizes open challenges and dilemmas for fairness research.
New models reduce discrimination in machine learning without sacrificing explanatory bias.
problem Discrimination and explanatory bias in fairness measures.
method Causal effect estimators using propensity score analysis.
result Theoretical and practical superiority of FairCEEs over existing models.
Study binary choice with asymmetric loss, offering simple solutions.
problem Binary choice with asymmetric loss in data-rich environments.
method Loss-based reweighting of logistic regression or machine learning techniques.
result Valid decisions on binary outcomes with general loss functions.
Benchmark assesses fairness in algorithmic uncertainty, revealing consistent and calibrated estimates improve fairness.
problem Challenges in managing uncertainty in fairness evaluations for predictive algorithms.
method Introduces FairlyUncertain, an axiomatic benchmark for evaluating uncertainty in fairness.
result Consistent and calibrated uncertainty estimates improve fairness without explicit fairness interventions.
Introduces FairCOCCO for fair learning with multitype, multivariate sensitive attributes.
problem Fairness in machine learning with multiple, complex sensitive attributes.
method FairCOCCO measure based on cross-covariance operators, incorporating a regularisation term.
result Consistent improvements in balancing fairness and predictive power on real-world datasets.
The paper reconciles two conflicting fairness criteria in algorithmic risk scores.
problem How to reconcile calibration and equal error rates in algorithmic risk scores.
method Derive necessary and sufficient conditions for existence of calibrated scores achieving equal error rates, then present an algorithm to find the most accurate score subject to both criteria.
result The method can eliminate error disparities while maintaining calibration and improve profit in credit lending.
The paper provides CI for test unfairness of group-fairness-aware classifiers trained with online SGD.
problem Ensuring fairness in machine learning models trained with stochastic gradient descent.
method Developed an online multiplier bootstrap method to estimate CI for test unfairness of DI and DM-aware linear classifiers.
result Asymptotic Central Limit Theorem holds for CI estimation of DI and DM-aware models.
COMMOD debiases models with minimal and interpretable changes.
problem Inconsistent and costly model updates in fair machine learning.
method Introduced COMMOD, a novel algorithm for algorithmic fairness that minimizes changes and makes them interpretable.
result COMMOD achieves comparable performance to state-of-the-art debiasing methods while making minimal and interpretable changes.
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.
Consider a binary decision making process where a single machine learning classifier replaces a multitude of humans. We raise questions about the resulting loss of diversity in the decision making process. We study the potential benefits of using random classifier ensembles instead of a single classifier in the context…
Online TERM improves robustness and fairness in streaming data.
problem Streaming data's lack of worst-case fairness and robustness in ERM.
method Proposes an online TERM formulation to balance average-case accuracy with worst-case fairness and robustness.
result Negative tilting effectively suppresses outlier influence, positive tilting improves recall with minimal precision loss.
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.
This thesis formalizes metric selection for machine learning applications.
problem Selecting the right performance metric for machine learning models.
method Metric Elicitation framework using pairwise preference feedback.
result Novel strategies for eliciting various classification metrics robust to noise.
Proposes fair classification method using Wasserstein-1 distances.
problem Ensuring fairness in classification models by protecting sensitive information.
method Minimizes Wasserstein-1 distances to enforce independence between classifier outputs and sensitive information.
result Empirical performance superior to fairness baselines on benchmark datasets.
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…