Integrating Reward Maximization and Population Estimation: Sequential Decision-Making for Internal Revenue Service Audit Selection
Not on the map. Why?
Abstract (arXiv)
We introduce a new setting, optimize-and-estimate structured bandits. Here, a policy must select a batch of arms, each characterized by its own context, that would allow it to both maximize reward and maintain an accurate (ideally unbiased) population estimate of the reward. This setting is inherent to many public and private sector applications and often requires handling delayed feedback, small data, and distribution shifts. We demonstrate its importance on real data from the United States Internal Revenue Service (IRS). The IRS performs yearly audits of the tax base. Two of its most important objectives are to identify suspected misreporting and to estimate the "tax gap" -- the global difference between the amount paid and true amount owed. Based on a unique collaboration with the IRS, we cast these two processes as a unified optimize-and-estimate structured bandit. We analyze optimize-and-estimate approaches to the IRS problem and propose a novel mechanism for unbiased population estimation that achieves rewards comparable to baseline approaches. This approach has the potential to improve audit efficacy, while maintaining policy-relevant estimates of the tax gap. This has important social consequences given that the current tax gap is estimated at nearly half a trillion dollars. We suggest that this problem setting is fertile ground for further research and we highlight its interesting challenges. The results of this and related research are currently being incorporated into the continual improvement of the IRS audit selection methods.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 34 of its 149 references that are in the map. First posted on arXiv 25 Apr 2022.
Builds on
34 of 149 references.
References · 34
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 781
- 2017Deep Reinforcement Learning that Matterscited by 727
- 2019Quantifying the Carbon Emissions of Machine Learningcited by 516
- 2020Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learningcited by 246
- 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
- 2021Accounting for Variance in Machine Learning Benchmarkscited by 195
- 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 114
- 2015Characterizing Concept Driftcited by 93
- 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
- 2015Linear Contextual Bandits with Knapsackscited by 82
- 2020Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspectivecited by 78
22 more
- 2020The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policiescited by 75
- 2021On Statistical Bias In Active Learning: How and When To Fix Itcited by 72
- 2018A Contextual Bandit Bake-offcited by 64
- 2020Inference for Batched Banditscited by 63
- 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 44
- 2017Why Adaptively Collected Data Have Negative Bias and How to Correct for Itcited by 36
- 2021On the Theory of Reinforcement Learning with Once-per-Episode Feedbackcited by 32
- 2018DALEX: explainers for complex predictive modelscited by 28
- 2019On the bias, risk and consistency of sample means in multi-armed banditscited by 24
- 2017Estimation Considerations in Contextual Banditscited by 22
- 2020Efficient Adaptive Experimental Design for Average Treatment Effect Estimationcited by 22
- 2018Mitigating Bias in Adaptive Data Gathering via Differential Privacycited by 21
- 2018Multi-objective Contextual Bandit Problem with Similarity Informationcited by 19
- 2020Affirmative Algorithms: The Legal Grounds for Fairness as Awarenesscited by 15
- 2017Multi-objective Contextual Multi-armed Bandit with a Dominant Objectivecited by 14
- 2021Top-k eXtreme Contextual Bandits with Arm Hierarchycited by 8
- 2021Learning from an Exploring Demonstrator: Optimal Reward Estimation for Banditscited by 8
- 2021Efficient Inference Without Trading-off Regret in Bandits: An Allocation Probability Test for Thompson Samplingcited by 7
- 2021Beyond Ads: Sequential Decision-Making Algorithms in Law and Public Policycited by 7
- 2018RankDCG: Rank-Ordering Evaluation Measurecited by 4
- 2019Rarely-switching linear bandits: optimization of causal effects for the real worldcited by 3
- 2021Reconciling Risk Allocation and Prevalence Estimation in Public Health Using Batched Banditscited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 2.
5 papers.
- 2023Auditing Fairness by Bettingcited by 24
- 2023Domain constraints improve risk prediction when outcome data is missingcited by 8
- 2024Learning treatment effects while treating those in needcited by 8
- 2024From Biased Selective Labels to Pseudo-Labels: An Expectation-Maximization Framework for Learning from Biased Decisionscited by 4
- 2022Entropy Regularization for Population Estimationcited by 1
- 2024Learning treatment effects while treating those in need10 Jul 2024
- 2024From Biased Selective Labels to Pseudo-Labels: An Expectation-Maximization Framework for Learning from Biased Decisions27 Jun 2024
- 2023Domain constraints improve risk prediction when outcome data is missing6 Dec 2023
- 2023Auditing Fairness by Betting27 May 2023
- 2022Entropy Regularization for Population Estimation24 Aug 2022