Addressing the Long-term Impact of ML Decisions via Policy Regret
Not on the map. Why?
Abstract (arXiv)
Machine Learning (ML) increasingly informs the allocation of opportunities to individuals and communities in areas such as lending, education, employment, and beyond. Such decisions often impact their subjects' future characteristics and capabilities in an a priori unknown fashion. The decision-maker, therefore, faces exploration-exploitation dilemmas akin to those in multi-armed bandits. Following prior work, we model communities as arms. To capture the long-term effects of ML-based allocation decisions, we study a setting in which the reward from each arm evolves every time the decision-maker pulls that arm. We focus on reward functions that are initially increasing in the number of pulls but may become (and remain) decreasing after a certain point. We argue that an acceptable sequential allocation of opportunities must take an arm's potential for growth into account. We capture these considerations through the notion of policy regret, a much stronger notion than the often-studied external regret, and present an algorithm with provably sub-linear policy regret for sufficiently long time horizons. We empirically compare our algorithm with several baselines and find that it consistently outperforms them, in particular for long time horizons.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 22 of its 56 references that are in the map. First posted on arXiv 2 Jun 2021.
Builds on
22 of 56 references.
References · 22
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 586
- 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 369
- 2018Delayed Impact of Fair Machine Learningcited by 184
- 2016Fairness in Learning: Classic and Contextual Banditscited by 168
- 2017Strategic Classification from Revealed Preferencescited by 128
- 2017How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utilitycited by 120
- 2018The Social Cost of Strategic Classificationcited by 105
- 2017Runaway Feedback Loops in Predictive Policingcited by 97
- 2016Fairness in Reinforcement Learningcited by 95
- 2013Discrimination in Online Ad Deliverycited by 93
- 2018The Disparate Effects of Strategic Manipulationcited by 75
10 more
- 2019Degenerate Feedback Loops in Recommender Systemscited by 67
- 2017Rotting Banditscited by 57
- 2019On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learningcited by 49
- 2017A Short-term Intervention for Long-term Fairness in the Labor Marketcited by 44
- 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 42
- 2019What does it mean to solve the problem of discrimination in hiring? Social, technical and legal perspectives from the UK on automated hiring systemscited by 38
- 2014Unimodal Bandits: Regret Lower Bounds and Optimal Algorithmscited by 37
- 2018From Fair Decision Making to Social Equalitycited by 36
- 2018Downstream Effects of Affirmative Actioncited by 34
- 2020Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approachcited by 32
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 2.
5 papers.
- 2024Preemptive Detection and Correction of Misaligned Actions in LLM Agentscited by 10
- 2022Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Banditscited by 8
- 2022Complete Policy Regret Bounds for Tallying Banditscited by 3
- 2024Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithmscited by 3
- 2023Weighted Tallying Bandits: Overcoming Intractability via Repeated Exposure Optimalitycited by 2
- 2024Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms1 Nov 2024
- 2024Preemptive Detection and Correction of Misaligned Actions in LLM Agents16 Jul 2024
- 2023Weighted Tallying Bandits: Overcoming Intractability via Repeated Exposure Optimality4 May 2023
- 2022Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits19 Aug 2022
- 2022Complete Policy Regret Bounds for Tallying Bandits24 Apr 2022