arXiv Machine Learning

Optimizing Recourse Under Predictive Multiplicity

arXiv AI
Oct 1

Algorithmic Recourse Under Competition

arXiv:2609.39877v1 Announce Type: cross Abstract: Algorithmic recourse provides individuals who have received undesirable outcomes from machine learning models with suggestions for minimum-cost impro...

By Shahin Jabbari
arXiv Machine Learning
2d ago

Partially Interpretable Decision Trees

arXiv:2611.06428v1 Announce Type: new Abstract: Partially interpretable models extend simple interpretable models with the option to defer complicated inputs to an accurate but uninterpretable black-...

By Ludovic Schwartz, Federico Berton, Tim van Erven
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 Machine Learning
Aug 4

T-TAMER: Provably Taming Trade-offs in ML Serving

arXiv:2509. 22992v2 Announce Type: replace Abstract: As machine learning models continue to grow in size and complexity, efficient serving faces increasingly broad trade-offs spanning accuracy, latency, resource usage, and other objectives.

By Yuanyuan Yang, Ruimin Zhang, Jamie Morgenstern, Haifeng Xu
arXiv AI
Jun 4

Learning to Evaluate: Cost-Effective Model Evaluation on Unlabeled Data with Meta-Learning

arXiv:2605. 23595v2 Announce Type: replace-cross Abstract: The rapid advancement of machine learning has led to an unprecedented expansion of model ecosystems, making it increasingly difficult to assess the reliability of newly released models on unseen and unlabeled data.

By Trinh Pham, Viet Huynh, Hongzhi Yin, Quoc Viet Hung Nguyen, Thanh Tam Nguyen