Understanding Endogenous Data Drift in Adaptive Models with Recourse-Seeking Users
Not on the map. Why?
Abstract (arXiv)
Deep learning models are widely used in decision-making and recommendation systems, where they typically rely on the assumption of a static data distribution between training and deployment. However, real-world deployment environments often violate this assumption. Users who receive negative outcomes may adapt their features to meet model criteria, i.e., recourse action. These adaptive behaviors create shifts in the data distribution and when models are retrained on this shifted data, a feedback loop emerges: user behavior influences the model, and the updated model in turn reshapes future user behavior. Despite its importance, this bidirectional interaction between users and models has received limited attention. In this work, we develop a general framework to model user strategic behaviors and their interactions with decision-making systems under resource constraints and competitive dynamics. Both the theoretical and empirical analyses show that user recourse behavior tends to push logistic and MLP models toward increasingly higher decision standards, resulting in higher recourse costs and less reliable recourse actions over time. To mitigate these challenges, we propose two methods--Fair-top-k and Dynamic Continual Learning (DCL)--which significantly reduce recourse cost and improve model robustness. Our findings draw connections to economic theories, highlighting how algorithmic decision-making can unintentionally reinforce a higher standard and generate endogenous barriers to entry.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 30 of its 60 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
30 of 60 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,552
- 2016Progressive Neural Networkscited by 1,361
- 2018Experience Replay for Continual Learningcited by 1,095
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 973
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2015Strategic Classificationcited by 257
18 more
- 2019FACE: Feasible and Actionable Counterfactual Explanationscited by 233
- 2020Fairness in Machine Learningcited by 194
- 2020Binary Neural Networks: A Surveycited by 190
- 2020Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Reviewcited by 174
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
- 2021Towards Robust and Reliable Algorithmic Recoursecited by 102
- 2021Strategic Classification Made Practicalcited by 59
- 2019Equalizing Recourse across Groupscited by 55
- 2017Interpretability via Model Extractioncited by 40
- 2020Algorithmic Recourse in the Wild: Understanding the Impact of Data and Model Shiftscited by 36
- 2017Deep Learning based Large Scale Visual Recommendation and Search for E-Commercecited by 16
- 2023Setting the Right Expectations: Algorithmic Recourse Over Timecited by 13
- 2022RoCourseNet: Distributionally Robust Training of a Prediction Aware Recourse Modelcited by 11
- 2020An ASP-Based Approach to Counterfactual Explanations for Classificationcited by 10
- 2021Low-Cost Algorithmic Recourse for Users With Uncertain Cost Functionscited by 10
- 2024Fairness in Algorithmic Recourse Through the Lens of Substantive Equality of Opportunitycited by 9
- 2023The Risks of Recourse in Binary Classificationcited by 8
- 2022Gradient-based Counterfactual Explanations using Tractable Probabilistic Modelscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Algorithmic Recourse Under Competitioncited by 0
- 2026Algorithmic Recourse Under Competition30 Sep 2026