New method certifies individual fairness in representations.
problem Ensuring fairness in data representations without sacrificing utility.
method Mapping similar individuals to close latent representations to certify individual fairness.
result Certifies individual fairness for existing and new data points.
Proposes individual fairness for clustering, making data points prefer their own cluster.
problem No fair clustering for clustering data points.
method Introduces a new fairness notion for clustering and studies its feasibility and heuristics.
result Individual fairness for clustering is NP-hard in general but feasible for one-dimensional data.
The study analyzes the conflict between group fairness and individual fairness in machine learning.
problem The conflict between group fairness (optimal statistical parity) and individual fairness in machine learning.
method Established sufficient conditions for the compatibility between optimal statistical parity and individual fairness requirements.
result Identified regions along the Pareto frontier that satisfy individual fairness requirements.
This paper introduces individual fairness in clustering using f-divergence.
problem Ensuring fair clustering by treating similar individuals similarly.
method Uses f-divergence to measure statistical similarity and assigns individuals to probability distributions over cluster centers. result Provides an algorithm with provable approximation guarantee for clustering with individual fairness constraints.
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.
Paper resolves apparent conflict between group and individual fairness.
problem Apparent conflict between group and individual fairness in machine learning.
method Theoretical discussions from fair machine learning, political, and legal philosophy.
result Individual and group fairness are not fundamentally in conflict.
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.
Proposes a method to learn fair classifiers without restrictive assumptions.
problem Fairness in machine learning decisions for individuals.
method Defines PIU and optimizes to control its upper bound.
result Guarantees fairness for each individual without restrictive assumptions.
Investigates fairness in pipeline models where individuals may drop out.
problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.
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.
We revisit the notion of individual fairness proposed by Dwork et al. A central challenge in operationalizing their approach is the difficulty in eliciting a human specification of a similarity metric. In this paper, we propose an operationalization of individual fairness that does not rely on a human specification of …
Whereas previous post-processing approaches for increasing the fairness of predictions of biased classifiers address only group fairness, we propose a method for increasing both individual and group fairness. Our novel framework includes an individual bias detector used to prioritize data samples in a bias mitigation a…
Revises individual fairness by finding a fair metric for a model.
problem Difficulties in specifying a suitable fairness metric a priori.
method Introduces minimal metrics and applies randomized smoothing from adversarial robustness.
result Adapting minimal metrics to complex models yields interpretable fairness guarantees.
Study online learning with individual fairness without known similarity measure.
problem Online learning with individual fairness constraints without a known similarity measure.
method Reduction to standard online classification, leveraging auditor feedback.
result Achieves sub-linear regret and fairness violations with stochastic data.
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.
Post-processing corrects bias in ML systems without retraining.
problem Correcting bias in ML systems that are already in use.
method Proposes general post-processing algorithms for individual fairness based on graph Laplacian regularization.
result Empirically, post-processing algorithms correct individual biases in large-scale NLP models while preserving accuracy.
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.
SenSeI ensures fair models by enforcing invariance on sensitive groups.
problem Ensuring fair machine learning models that respect sensitive groups.
method Designing a transport-based regularizer to enforce invariance on sensitive sets.
result Certifiably fair ML models trained using SenSeI achieve improved fairness metrics.
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.
There has been much discussion recently about how fairness should be measured or enforced in classification. Individual Fairness [Dwork, Hardt, Pitassi, Reingold, Zemel, 2012], which requires that similar individuals be treated similarly, is a highly appealing definition as it gives strong guarantees on treatment of in…
Introduces lookahead counterfactual fairness to account for downstream effects of ML predictions.
problem Downstream effects of ML predictions on individuals not considered by counterfactual fairness.
method Introduces lookahead counterfactual fairness (LCF), a new fairness notion that considers future status. Proposes an algorithm based on theoretical conditions.
result Proposes an algorithm to achieve lookahead counterfactual fairness and validates it on synthetic and real data.
fAux tests individual fairness without domain knowledge or out-of-domain samples.
problem Testing for individual fairness in machine learning models.
method Derivative comparison between model predictions and auxiliary model predictions.
result Effectively identifies discrimination on synthetic and real-world datasets.
Develops verifiers to check if machine learning models treat similar individuals equally.
problem Ensuring fairness in machine learning models by checking if similar individuals are treated differently.
method Constructs verifiers for proving individual fairness of machine learning models, considering relaxations of the problem.
result Developed verifiers for linear and kernelized polynomial/radial basis function classifiers.
Since many critical decisions impacting human lives are increasingly being made by algorithms, it is important to ensure that the treatment of individuals under such algorithms is demonstrably fair under reasonable notions of fairness. One compelling notion proposed in the literature is that of individual fairness (IF)…
Matrix estimation improves individual fairness without sacrificing performance.
problem Ensuring fairness in algorithmic decision-making.
method Using singular value thresholding (SVT) to preprocess data.
result SVT pre-processing improves IF guarantees and maintains performance.
The paper tackles individual fairness in ML models, developing statistical methods to detect bias.
problem Detecting and measuring violations of individual fairness in machine learning models.
method Formalizing the problem as adversarial attack, developing inference tools for the adversarial cost function.
result Statistical methods to assess and test hypotheses of model fairness with non-coverage error rate control.
Proposes adversarial learning for counterfactual fairness in machine learning.
problem Ensuring fairness at the individual level by simulating counterfactual samples.
method Adversarial neural learning approach to infer counterfactual samples.
result Significant improvements in counterfactual fairness for both discrete and continuous settings.
Develops a fair clustering algorithm for datasets with outliers.
problem Fair clustering with outliers in datasets.
method Solves a linear program to identify and exclude outliers, then applies a rounding algorithm to find fair centers.
result Guaranteed approximation of fair radius and clustering cost.
We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a distribution over (or collection of) classification tasks. We then ask that standard …
We study notions of fairness in decision-making systems when individuals have diverse preferences over the possible outcomes of the decisions. Our starting point is the seminal work of Dwork et al. which introduced a notion of individual fairness (IF): given a task-specific similarity metric, every pair of individuals …
This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.
problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.
New fairness notion helps identify fair auditors for evaluating decision-support systems.
problem Identifying fair auditors to evaluate decision-support systems for bias.
method Introducing a non-comparative fairness notion based on desired system properties.
result The proposed fairness notion provides guarantees in terms of comparative fairness.
Classifiers that achieve demographic balance by explicitly using protected attributes such as race or gender are often politically or culturally controversial due to their lack of individual fairness, i.e. individuals with similar qualifications will receive different outcomes. Individually and group fair decision crit…
Algorithm provides fair clustering guarantees for k-means and k-median.
problem Ensuring fair clustering guarantees for every point in a dataset.
method Local search algorithm for k-median and k-means, with individual fairness as a key metric. result Achieves fair clustering with a constant factor approximation of the optimal solution.
The paper addresses fairness in online learning by extending auditing schemes and presenting efficient algorithms.
problem Ensuring fairness in online learning while maximizing predictive accuracy.
method Extending auditing schemes to handle multiple auditors and presenting oracle-efficient algorithms.
result Presented algorithms achieve upper bounds on regret and fairness violations, improving on existing bounds.
Causal models help ensure fairness in systems with changing environments.
problem Ensuring fairness in systems with dynamic, long-term effects.
method Causal directed acyclic graphs (DAGs) to model fairness and manipulate causal assumptions.
result Causal assumptions enable simulation and off-policy estimation of interventions.
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.
The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.
problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.
People are rated and ranked, towards algorithmic decision making in an increasing number of applications, typically based on machine learning. Research on how to incorporate fairness into such tasks has prevalently pursued the paradigm of group fairness: giving adequate success rates to specifically protected groups. I…
Proposes a method to create fair ITRs that balance value and fairness.
problem Fairness issues in ITRs that can lead to unfair advantages or disadvantages.
method Optimal transport theory to transform optimal ITRs into fair ITRs.
result Established a theoretical upper bound on value loss for improved trade-off ITRs.
The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.
problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.
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.
The paper explores fairness in machine learning by setting subgroup sample complexity bounds and advocating for human intervention.
problem Machine learning models often show different performance metrics for different subgroups, due to various factors.
method The paper presents lower bounds of subgroup sample complexity for metric-fair learning and proposes an approach using individual fairness definitions for cases where subgroup samples are insufficient.
result For a classifier to be fair, adequate subgroup population samples are necessary, and model dimensionality must align with subgroup population distributions.
The paper introduces a method to achieve fairness in machine learning models using graph models.
problem Theoretical properties and intuition behind fairness in machine learning models are poorly understood.
method Sheaf Diffusion framework to model fairness in a bias-free space.
result The proposed method achieves fair solutions and handles different fairness metrics.
Deep learning is increasingly being used in high-stake decision making applications that affect individual lives. However, deep learning models might exhibit algorithmic discrimination behaviors with respect to protected groups, potentially posing negative impacts on individuals and society. Therefore, fairness in deep…
We consider training machine learning models that are fair in the sense that their performance is invariant under certain sensitive perturbations to the inputs. For example, the performance of a resume screening system should be invariant under changes to the gender and/or ethnicity of the applicant. We formalize this …
A novel multi-objective optimization framework improves insurance pricing fairness.
problem Exacerbated trade-offs between competing fairness criteria in insurance pricing using machine learning.
method Proposes a novel multi-objective optimization framework using NSGA-II to jointly optimize accuracy and fairness criteria.
result Consistently achieves a balanced compromise between accuracy and fairness, outperforming single-model approaches.
The paper explores fairness in multi-component recommender systems.
problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.