arXiv Statistics ML
A Rank Graduation metric for Algorithmic fairness
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
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.
arXiv AI
Sep 16
FairLint-DL: An IDE-Native Tool for Fairness Debugging of Deep Learning Software
arXiv:2609.16321v1 Announce Type: cross Abstract: Existing fairness analysis tools predominantly operate as post-training evaluation frameworks, requiring practitioners to complete the full model dev...
arXiv Machine Learning
Jul 7
Counterfactual Methods for Detecting Unfairness in Anti-Money Laundering Algorithms
arXiv:2607. 05101v1 Announce Type: new Abstract: The application of machine learning-based predictive algorithms to Anti-Money Laundering (AML) has grown rapidly, driven by the vast volume of financial transaction data available to banks.
arXiv Machine Learning
Aug 11
Fairness in Link Prediction Beyond Demographic Parity: A Reproducibility Study
arXiv:2608. 09899v1 Announce Type: new Abstract: In fair ranked link prediction, demographic parity ($\Delta_\mathrm{DP}$) is a common fairness metric.
arXiv AI
Aug 26
$\texttt{findr}$: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressions
arXiv:2608.24582v1 Announce Type: cross Abstract: Credit risk models increasingly need to combine predictive accuracy with transparent explanations and auditable fairness constraints. Logistic regres...
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%.