arXiv AI

Algorithmic Recourse Under Competition

arXiv AI
Sep 11

Incentives to Offer Algorithmic Recourse

The paper investigates why decision-makers such as banks and employers might provide algorithmic recourse to applicants rejected by automated systems. In a screening model where recourse improves an applicant’s value but costs vary across individuals, the optimal policy is a threshold rule: reject low‑scoring applicants, offer recourse to those with intermediate scores, and accept high‑scoring applicants outright. This strategy creates a new acceptance path for some marginal applicants while imposing a costly hurdle on others who would otherwise be accepted.

By Matthew Olckers, Toby Walsh
arXiv Machine Learning
Jul 31

The Role of Causality in Algorithmic Recourse

arXiv:2607. 28497v1 Announce Type: new Abstract: Algorithmic recourse aims to provide individuals with actionable changes to improve their predicted outcomes in high-stakes classification settings, such as loan and mortgage applications.

By Srikanth Avasarala, Varun Gupta, Shahin Jabbari, Saber Salehkaleybar, Juba Ziani
arXiv Machine Learning
Sep 14

Explanations-Driven Active Feature Acquisition for Algorithmic Recourse

The paper introduces Explanation-Driven Feature Acquisition (EDFA), a method that jointly optimizes algorithmic recourse and feature acquisition by selecting features based on explanatory value per unit cost. Using Markov Blanket theory, EDFA unifies various explanation types and provides distribution‑free validity guarantees for recourse derived from partial information. Experiments on seven datasets show that EDFA requires fewer features than existing active feature acquisition baselines while maintaining accuracy and producing more actionable recourse.

By Vinura Galwaduge, Jagath Samarabandu
arXiv AI
Jul 13

Tuning Derivatives for Causal Fairness in Machine Learning

arXiv:2605. 05882v2 Announce Type: replace-cross Abstract: Artificial-intelligence systems are becoming ubiquitous in society, yet their predictions typically inherit biases with respect to protected attributes such as race, gender, or age.

By Filip Edstr\"om, Guilherme W. F. Barros, Tetiana Gorbach, Xavier de Luna
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
3d ago

Revisiting scaling laws for reward optimization

The paper presents a new scaling law for reward optimization in AI alignment, showing that performance scales as Θ(√min{log(M), K}), where M is the number of preference comparisons used to train a proxy reward model and K is the KL‑divergence budget relative to a reference policy. The authors derive this law using an information‑theoretic model, prove its tightness, and validate it with extensive experiments involving a 70B gold reward model and smaller proxy models (0.6B–4B). The empirical results demonstrate a strong fit (R² 97–99 %) across different model sizes, noise levels, and optimization methods, suggesting that reward optimization behaves like a simple selection task over IID Gaussian variables with noisy feedback.

By Ali Aouad, Aymane El Gadarri, Vivek F. Farias