arXiv Statistics ML

A Rank Graduation metric for Algorithmic fairness

arXiv Machine Learning
Jul 9

A Distributionally Robust Optimisation Approach to Fair Credit Scoring

arXiv:2402. 01811v2 Announce Type: replace Abstract: Credit scoring has been catalogued by the European Commission and the Executive Office of the US President as a high-risk classification task, in light of the potential harms of making loan approval decisions based on models that would be biased against certain groups.

By Pablo Casas, Huan Yu, Christophe Mues
arXiv AI
Aug 28

Fairness Invariants: A Relational Approach to Explaining and Mitigating Fairness Bugs

The paper introduces REMI, a framework that treats counterfactual fairness as a relational invariant discovery problem. By learning over paired examples, REMI identifies input regions where fairness is violated and generates interpretable rule-based models—fairness invariants—that can block or relabel unfair predictions without retraining the underlying model. Experiments on symbolic and neural network programs show REMI localizes fairness bugs in over 83% of cases and reduces discriminatory decisions in black-box models by up to 70%.

By Ranit Debnath Akash, Ashish Kumar, Gang Tan, Saeid Tizpaz-Niari
arXiv Machine Learning
Aug 10

Let's Unlearn Stereotypes Before Decision-Making: Assessing the Impact of Intrinsic Bias Mitigation on Downstream Fairness in LLMs

arXiv:2509. 16462v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) are increasingly used in high-stakes decision-making systems, where biased predictions can reinforce social and economic disparities.

By Mina Arzaghi, Alireza Dehghanpour Farashah, Florian Carichon, Jean-Fran\c{c}ois Plante, Golnoosh Farnadi
arXiv AI
Nov 5

Practical Estimation of the Bayes Optimal Fairness-Accuracy Tradeoff with Soft Labels

The paper presents a method to estimate the Bayes optimal fairness‑accuracy tradeoff using only soft labels and group information. It derives an explicit expression for the fair Bayes error rate and constructs consistent, instance‑free estimators with provable bias bounds and sample complexity guarantees. Empirical results show that the estimators provide a robust, low‑variance estimate of the optimal fairness‑accuracy Pareto frontier even when soft labels are noisy.

By Mohit Sharma, Okan Ko\c{c}, Amit Deshpande, Takashi Ishida, Gang Niu, Rajiv Ratn Shah, Masashi Sugiyama
arXiv Machine Learning
Sep 18

When fairness metrics fail: A utility-based perspective on $\varepsilon$-fairness

The paper argues that traditional probabilistic fairness metrics can miss significant disparities in the actual consequences of decisions. By introducing a utility-based framework, the authors show that a process can satisfy ε-fairness yet still be maximally unfair when utilities are considered. They apply this framework to college admissions and credit‑risk assessment, demonstrating that equalizing probabilities alone may mask unequal utility outcomes across groups.

By Tolulope Fadina, Thorsten Schmidt