Integrating Reward Maximization and Population Estimation: Sequential Decision-Making for Internal Revenue Service Audit Selection
Peter Henderson, Ben Chugg, Brandon R. Anderson, Kristen M. Altenburger, Alex Turk, John Guyton, Jacob S. Goldin, Daniel E. Ho
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 67f46187-7099-49c9-b01a-ab21dd29cc4cCited by top-tier papers4
- Auditing Fairness by BettingBen Chugg, Santiago Cortes-Gomez, Bryan Wilder, Aaditya RamdasNeurIPS 2023 · 29 citations
- Domain constraints improve risk prediction when outcome data is missingSidhika Balachandar, Nikhil Garg, Emma PiersonICLR 2024 · 11 citations
- Entropy Regularization for Population EstimationBen Chugg, Peter Henderson, Jacob S. Goldin, Daniel E. HoAAAI 2023 · 3 citations
- From Biased Selective Labels to Pseudo-Labels: An Expectation-Maximization Framework for Learning from Biased DecisionsTrenton Chang, Jenna WiensICML 2024 · 1 citation
Builds on6
- Deep Reinforcement Learning at the Edge of the Statistical PrecipiceRishabh Agarwal, Max Schwarzer, Pablo Samuel Castro, Aaron C. Courville et al.NeurIPS 2021 · 1,067 citations
- Beyond UCB: Optimal and Efficient Contextual Bandits with Regression OraclesDylan J. Foster, Alexander RakhlinICML 2020 · 241 citations
- On Statistical Bias In Active Learning: How and When to Fix ItSebastian Farquhar, Yarin Gal, Tom RainforthICLR 2021 · 96 citations
- Contextual Bandits with Large Action Spaces: Made PracticalYinglun Zhu, Dylan J. Foster, John Langford, Paul MineiroICML 2022 · 34 citations
- Top-k eXtreme Contextual Bandits with Arm HierarchyRajat Sen, Alexander Rakhlin, Lexing Ying, Rahul Kidambi et al.ICML 2021 · 16 citations
Related papers
- Cost-Effective Incentive Allocation via Structured Counterfactual InferenceRomain Lopez, Chenchen Li, Xiang Yan, Junwu Xiong et al.AAAI 2020 · 21 citations
- Optimally Auditing Adversarial AgentsSanmay Das, Fang-Yi Yu, Yuang ZhangAAAI 2026 · 1 citation
- Inference for Batched BanditsKelly W. Zhang, Lucas Janson, Susan A. MurphyNeurIPS 2020 · 115 citations
- Statistical Inference on Multi-armed Bandits with Delayed FeedbackLei Shi, Jingshen Wang, Tianhao WuICML 2023 · 7 citations
- (Almost) Free Incentivized Exploration from Decentralized Learning AgentsChengshuai Shi, Haifeng Xu, Wei Xiong, Cong ShenNeurIPS 2021 · 10 citations
