Learning-Augmented Robust Algorithmic Recourse

arXiv:2410.01580v3 Announce Type: replace Abstract: Algorithmic recourse provides individuals who receive undesirable outcomes from machine learning systems with minimum-cost improvements to achieve a desirable outcome. However, machine learning models often get updated, so the recourse may not lead to the desired outcome. The robust recourse framework chooses recourses that are less sensitive to adversarial model changes, but this comes at a higher cost. To address this, we initiate the study of learning-augmented algorithmic recourse and evaluate the extent to which a designer equipped with a prediction of the future model can reduce the cost of recourse when the prediction is accurate (consistency) while also limiting the cost even when the prediction is inaccurate (robustness). We propose a novel algorithm, study the robustness-consistency trade-off, and analyze how prediction accuracy affects performance.

A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
Toward Efficient Influence Function: Dropout as a Compression Tool
Interpretable Quantile Regression by Optimal Decision Trees
Active Statistical Inference
Imitation Learning for Combinatorial Optimisation under Uncertainty

Source: arXiv cs.LG | 2026-04-28

Related