New concept of within-group fairness improves AI fairness without sacrificing accuracy.
problem Fairness issues in AI models treating individuals in the same sensitive group unfairly.
method Introducing within-group fairness, proposing mathematical definitions, and developing learning algorithms.
result Improves within-group fairness without sacrificing accuracy and between-group fairness.
New welfare-based fairness notions align with existing error rate balance and predictive parity.
problem Aligning fairness notions with welfare-based criteria.
method Discussing and establishing conditions for envy freeness and prejudice freeness.
result Envy freeness and prejudice freeness are equivalent to error rate balance and predictive parity.
A new fairness metric for decision-making algorithms, conditioning on known fair variables.
problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.
The study redefines algorithmic fairness as a sociotechnical concept.
problem Systemic discrimination in automated decision-making.
method Literature review and sociotechnical analysis.
result Algorithmic fairness should be viewed through a sociotechnical lens.
Paper proposes a unified sparsity-based framework for evaluating algorithmic fairness.
problem Ensuring fairness in machine learning across diverse domains.
method Unified sparsity-based framework for evaluating fairness.
result Demonstrates broad applicability and effectiveness of the framework.
Paper proposes a modified fairness constraint to address shortcomings of counterfactual fairness.
problem Counterfactual fairness is not a necessary condition for algorithmic fairness.
method Analyzed hypothetical scenario and explicated discrimination to develop causal relevance fairness.
result Causal relevance fairness is a modified constraint that circumvents shortcomings of counterfactual fairness.
Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.
problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.
FCA improves fair clustering by optimizing utility and fairness.
problem Balancing fairness and utility in clustering.
method FCA alternates between aligning data and optimizing cluster centers in an aligned space.
result FCA achieves a superior trade-off between fairness and utility.
We introduce the study of fairness in multi-armed bandit problems. Our fairness definition can be interpreted as demanding that given a pool of applicants (say, for college admission or mortgages), a worse applicant is never favored over a better one, despite a learning algorithm's uncertainty over the true payoffs. We…
New approach to algorithmic fairness for human-AI collaboration considers compliance with human decisions.
problem Current fairness approaches assume perfect human compliance, but real-world compliance is often poor.
method Defines compliance-robustly fair algorithms and proposes an optimization strategy to improve fairness.
result Algorithmic recommendations can improve fairness even if humans do not fully comply with fair algorithms.
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.
New fair PCA method using streaming algorithms with statistical guarantees.
problem Perform PCA while ensuring fair projected distributions.
method Formulated new notion PAFO learnability, proposed fair noisy power method (FNPM) for memory efficiency.
result First statistical guarantee for fair PCA in streaming setting.
Study examines how decoding algorithms affect fairness in language generation models.
problem Impact of decoding algorithms on fairness in open-ended language generation.
method Systematic analysis of top-p, top-k, and temperature decoding algorithms. result Decoding algorithms significantly impact fairness across demographic groups.
Maximal correlation framework improves fairness in machine learning algorithms.
problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.
Fair HAC algorithms ensure clustering fairness across protected groups.
problem Ensuring clustering fairness in HAC algorithms when datasets contain biases.
method Proposes fair algorithms for HAC that enforce fairness constraints regardless of distance linkage criteria.
result Our fair HAC algorithms find fairer clusterings compared to vanilla HAC and other fair clustering approaches.
New algorithm solves fair PCA, robust PCA, and sparse PCA problems efficiently.
problem Fair Principal Component Analysis (FPCA) to ensure fairness in PCA solutions.
method Iterative MM algorithm with SDP reformulation to quadratic program.
result Algorithm monotonically improves fairness objectives at each iteration.
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.
New algorithm tackles subgroup fairness in AI with multiple sensitive attributes.
problem Heavy computational burdens and data sparsity in subgroup fairness for multiple sensitive attributes.
method Doubly Regressing Adversarial learning (DRAF) for subgroup fairness, focusing on subgroups with sufficient sample sizes and marginal fairness.
result DRAF algorithm reduces a surrogate fairness gap for supIPM with less computation than directly reducing supIPM.
The paper tackles fairness in data and algorithms, expanding on prior work.
problem Discrimination and disparate treatment in data and algorithms.
method Targeted learning for nonparametric inference of fairness in the data generating process.
result Derivation and validation of estimators for fairness metrics like demographic parity and equal opportunity.
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…
The paper explores fairness in credit scoring using machine learning.
problem The lack of research on fair machine learning in credit scoring.
method Revisits statistical fairness criteria, catalogs algorithmic options, and empirically compares fairness processors.
result Multiple fairness criteria can be approximately satisfied at once, and fair processors deliver a good balance between profit and fairness.
New fairness criteria for algorithmic recourse actions that consider causal relationships.
problem Fairness of recourse actions in algorithmic classification.
method Proposes two new fairness criteria at group and individual levels, explicitly accounting for causal relationships.
result Fairness of recourse is complementary to fairness of prediction, and can be enforced by altering the classifier.
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.
Algorithm learns similarity metrics for individual fairness.
problem Difficulty in learning similarity metrics for individual fairness.
method Gradient descent and Bradley-Terry model for pairwise comparisons.
result Algorithm converges to ground truth metric for individual fairness.
Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.
problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.
New tools for assessing and correcting bias in AI algorithms.
problem Fairness and bias in AI algorithms, especially when ground truth data is unavailable.
method Three tools: controlled fairness, retraining algorithms, and parameter adjustment algorithms.
result Effective in reducing bias and improving fairness in AI models.
New algorithm ensures fair matching in resource allocation.
problem Ensuring fairness in matching algorithms for scarce resources.
method Introduces a modified Sinkhorn algorithm and two relaxation strategies for group fairness in Optimal Transport.
result Demonstrates improved matching quality and fairness trade-off.
Gradient boosting method enforced with individual fairness.
problem Enforcing fairness in machine learning models.
method Functional gradient descent on robust loss function.
result Algorithm converges globally and generalizes.
Two simple methods learn fair metrics from data to improve fairness in ML tasks.
problem Lack of widely accepted fair metrics for many ML tasks hinders individual fairness adoption.
method Presented two simple ways to learn fair metrics from various data types.
result Fair training with learned metrics improves fairness on three ML tasks.
Meta-theorems validate fair regression algorithms under demographic parity constraints.
problem Regression under demographic parity constraints.
method Meta-theorems and post-processing methods.
result Fair minimax optimal regression can be achieved through post-processing.
Algorithm ensures fair ranking by minority groups alongside majority groups.
problem Ensuring fair ranking of items from minority groups alongside majority groups.
method Optimal transport-based regularizer for individual fairness and efficient optimization algorithm.
result Certifiably individually fair LTR models are achieved.
The paper tackles the trade-off between fairness and accuracy in machine learning models.
problem Ensuring fairness in machine learning often reduces model accuracy.
method The paper introduces formal tools for reconciling the fairness-accuracy tension using Pareto optimality from multi-objective optimization.
result The Chebyshev scalarization scheme is superior for finding Pareto optimal solutions compared to the linear scalarization scheme.
Proposes a method to achieve quantile fairness in predictions.
problem Lack of research on quantile fairness in socially sensitive domains.
method Introduces a framework to learn a real-valued quantile function under Demographic Parity fairness.
result Demonstrates superior empirical performance and uncovering fairness-accuracy trade-offs.
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.
Algorithmic fairness, and in particular the fairness of scoring and classification algorithms, has become a topic of increasing social concern and has recently witnessed an explosion of research in theoretical computer science, machine learning, statistics, the social sciences, and law. Much of the literature considers…
The paper extends fairness to hierarchical clustering, finding efficient algorithms with minimal loss.
problem Ensuring fairness in hierarchical clustering where data is recursively partitioned.
method Extending fairness to hierarchical clustering, developing simple, efficient algorithms for various objectives.
result Simple, efficient algorithms for fair hierarchical clustering with only a negligible loss in objective.
Machine learning algorithms have been increasingly deployed in critical automated decision-making systems that directly affect human lives. When these algorithms are only trained to minimize the training/test error, they could suffer from systematic discrimination against individuals based on their sensitive attributes…
We map the recently proposed notions of algorithmic fairness to economic models of Equality of opportunity (EOP)---an extensively studied ideal of fairness in political philosophy. We formally show that through our conceptual mapping, many existing definition of algorithmic fairness, such as predictive value parity and…
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.
A new algorithm COVA-FC improves subgroup-fair clustering efficiency.
problem Challenges in making cluster assignments independent of sensitive attributes in subgroups.
method Defining a subgroup-fairness gap, deriving a covariance-based surrogate, and introducing a continuous relaxation for efficient optimization.
result COVA-FC achieves competitive cost-fairness trade-offs and improves computational efficiency.
Paper tackles underranking in group-fair ranking systems, proving a trade-off and presenting an algorithm.
problem Underranking in group-fair ranking systems can worsen social and economic inequalities.
method Formulated underranking as a new problem, proved a lower bound, and presented a fair ranking algorithm.
result Algorithm achieves best of underranking and group fairness, confirming theoretical trade-off.
Paper shows fairness and domain adaptation can work together.
problem Algorithmic bias and distributional shifts in ML models.
method Leveraging fairness and distribution shifts, the paper shows how domain adaptation methods can mitigate bias.
result Enforcing individual fairness can improve out-of-distribution accuracy under covariate shift.
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.
In this paper, we study correlation clustering under fairness constraints. Fair variants of k-median and k-center clustering have been studied recently, and approximation algorithms using a notion called fairlet decomposition have been proposed. We obtain approximation algorithms for fair correlation clustering und…
Introduces principal fairness for fair decision-making.
problem Discrimination among similarly affected individuals.
method Uses principal stratification from causal inference.
result Explicitly accounts for decision impacts, not just protected attributes.
Motivated by concerns surrounding the fairness effects of sharing and transferring fair machine learning tools, we propose two algorithms: Fairness Warnings and Fair-MAML. The first is a model-agnostic algorithm that provides interpretable boundary conditions for when a fairly trained model may not behave fairly on sim…
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.
Kearns et al. [2018] recently proposed a notion of rich subgroup fairness intended to bridge the gap between statistical and individual notions of fairness. Rich subgroup fairness picks a statistical fairness constraint (say, equalizing false positive rates across protected groups), but then asks that this constraint h…