Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models

• URL: http://arxiv.org/abs/2605.23145v1
• Date: Fri, 22 May 2026 01:50:38 GMT
• Title: Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models
• Abstract summary: Individual fairness provides a strong flexible fairness guarantee for algorithmic decision makers.<n>A barrier to individual fairness in practice is the difficulty of learning the similarity metric over individuals.
• Score: 25.691232950420723
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Individual fairness, the notion that "similar individuals should be treated similarly," provides a strong and flexible fairness guarantee for algorithmic decision makers. However, a barrier to implementing individual fairness in practice is the difficulty of learning the similarity metric over individuals. In this work, we present an algorithm for learning a Mahalanobis similarity metric from triplet queries of the form "is individual $i$ more similar to individual $j$ or $k$?" We work in the standard Bradley-Terry model for pairwise comparisons. Our algorithm consists of a spectral initialization step followed by gradient descent. We provide extensive theoretical guarantees on our algorithm, showing that it converges quickly to the ground truth metric despite the non-convexity of the loss in our model. Because our focus is on fairness, we also show that individual fairness with respect to an estimated metric is sufficient to achieve similar fairness with respect to the true metric. We also discuss potential applications of our work to AI model tuning. Finally, we present experimental results that demonstrate the convergence of our algorithm and the fairness performance of downstream fair predictors trained on our estimated metric.

Related papers

• Cost Efficient Fairness Audit Under Partial Feedback [14.57835291220813]
  We study the problem of auditing the fairness of a given classifier under partial feedback.<n>We introduce a novel cost model for acquiring additional labeled data.<n>We show that our algorithms consistently outperform natural baselines by around 50% in terms of audit cost.
  arXiv  Detail & Related papers  (2025-10-04T08:38:03Z)
• Targeted Learning for Data Fairness [52.59573714151884]
  We expand fairness inference by evaluating fairness in the data generating process itself.<n>We derive estimators demographic parity, equal opportunity, and conditional mutual information.<n>To validate our approach, we perform several simulations and apply our estimators to real data.
  arXiv  Detail & Related papers  (2025-02-06T18:51:28Z)
• Implementing Fairness in AI Classification: The Role of Explainability [0.0]
  We argue that implementing fairness in AI classification involves more work than just operationalizing a fairness metric.<n>We make the training processes transparent, determining what outcomes the fairness criteria actually produce, and assessing their trade-offs.<n>We draw conclusions regarding the way in which these explanatory steps can make an AI model trustworthy.
  arXiv  Detail & Related papers  (2024-07-20T06:06:24Z)
• DualFair: Fair Representation Learning at Both Group and Individual Levels via Contrastive Self-supervision [73.80009454050858]
  This work presents a self-supervised model, called DualFair, that can debias sensitive attributes like gender and race from learned representations. Our model jointly optimize for two fairness criteria - group fairness and counterfactual fairness.
  arXiv  Detail & Related papers  (2023-03-15T07:13:54Z)
• Linear Speedup in Personalized Collaborative Learning [69.45124829480106]
  Personalization in federated learning can improve the accuracy of a model for a user by trading off the model's bias. We formalize the personalized collaborative learning problem as optimization of a user's objective. We explore conditions under which we can optimally trade-off their bias for a reduction in variance.
  arXiv  Detail & Related papers  (2021-11-10T22:12:52Z)
• GIFAIR-FL: An Approach for Group and Individual Fairness in Federated Learning [8.121462458089143]
  In this paper we propose textttGIFAIR-FL: an approach that retains group and individual settings. We show convergence in non-$i.i.d.$ and strongly convex settings. Compared to existing algorithms, our method shows improved results while superior or similar prediction accuracy.
  arXiv  Detail & Related papers  (2021-08-05T17:13:43Z)
• Can Active Learning Preemptively Mitigate Fairness Issues? [66.84854430781097]
  dataset bias is one of the prevailing causes of unfairness in machine learning. We study whether models trained with uncertainty-based ALs are fairer in their decisions with respect to a protected class. We also explore the interaction of algorithmic fairness methods such as gradient reversal (GRAD) and BALD.
  arXiv  Detail & Related papers  (2021-04-14T14:20:22Z)
• Metric-Free Individual Fairness with Cooperative Contextual Bandits [17.985752744098267]
  Group fairness requires that different groups should be treated similarly which might be unfair to some individuals within a group. Individual fairness remains understudied due to its reliance on problem-specific similarity metrics. We propose a metric-free individual fairness and a cooperative contextual bandits algorithm.
  arXiv  Detail & Related papers  (2020-11-13T03:10:35Z)
• Metrics and methods for a systematic comparison of fairness-aware machine learning algorithms [0.0]
  This study is the most comprehensive of its kind. It considers fairness, predictive-performance, calibration quality, and speed of 28 different modelling pipelines. We also found that fairness-aware algorithms can induce fairness without material drops in predictive power.
  arXiv  Detail & Related papers  (2020-10-08T13:58:09Z)
• Beyond Individual and Group Fairness [90.4666341812857]
  We present a new data-driven model of fairness that is guided by the unfairness complaints received by the system. Our model supports multiple fairness criteria and takes into account their potential incompatibilities.
  arXiv  Detail & Related papers  (2020-08-21T14:14:44Z)
• SenSeI: Sensitive Set Invariance for Enforcing Individual Fairness [50.916483212900275]
  We first formulate a version of individual fairness that enforces invariance on certain sensitive sets. We then design a transport-based regularizer that enforces this version of individual fairness and develop an algorithm to minimize the regularizer efficiently.
  arXiv  Detail & Related papers  (2020-06-25T04:31:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.