arXiv:2606. 08696v1 Announce Type: cross Abstract: Counterfactual recourse aims to provide actionable feature changes that would alter an unfavorable decision made by a predictive model.
By Yasuo Tabei
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:2606. 16113v1 Announce Type: new Abstract: Algorithmic recourse methods provide counterfactual explanations that inform individuals of the actions required to overturn an unfavorable model decision.
By Zahra Khotanlou, Hashir Ahmed, Chenghao Tan, Ahmed Abdelaal, Amir-Hossein Karimi
arXiv:2611.07378v1 Announce Type: new
Abstract: Predictive multiplicity -- where similarly accurate models disagree on individual predictions -- can be leveraged to optimize secondary metrics (e.g.,...
By Cassandra C. Chou, Benjamin Q. Huynh, Allison Koenecke, Elizabeth T. Chin
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: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:2606. 02198v1 Announce Type: new Abstract: Prediction tasks over individual futures, which are inherently noisy, often admit multiple similarly accurate models.
By Ashwin Singh, Carlos Castillo
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: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: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
arXiv:2512. 18390v2 Announce Type: replace Abstract: Organizations often have an incumbent predictive model in production when new data sources become available.
By Vassilis Digalakis Jr, Christophe P\'erignon, S\'ebastien Saurin, Flore Sentenac
arXiv:2506. 07673v2 Announce Type: replace Abstract: Large language model (LLM) evaluation is increasingly costly, prompting interest in methods that speed up evaluation by shrinking benchmark datasets.
By Guanhua Zhang, Florian E. Dorner, Moritz Hardt