Susan Athey, Undral Byambadalai, Vitor Hadad, Sanath Kumar Krishnamurthy, Weiwen Leung, Joseph Jay Williams
arXiv 22 Nov 2022 · Econometrics · 7 citations (OpenAlex)
arXiv:2211.12004 · PDF · DOI · OpenAlex · Extracted main text
We design and implement an adaptive experiment (a “contextual bandit”) to learn a targeted treatment assignment policy, where the goal is to use a participant's survey responses to determine which charity to expose them to in a donation solicitation. The design balances two competing objectives: optimizing the outcomes for the subjects in the experiment (“cumulative regret minimization”) and gathering data that will be most useful for policy learning, that is, for learning an assignment rule that will maximize welfare if used after the experiment (“simple regret minimization”). We evaluate alternative experimental designs by collecting pilot data and then conducting a simulation study. Next, we implement our selected algorithm. Finally, we perform a second simulation study anchored to the collected data that evaluates the benefits of the algorithm we chose. Our first result is that the value of a learned policy in this setting is higher when data is collected via a uniform randomization rather than collected adaptively using standard cumulative regret minimization or policy learning algorithms. We propose a simple heuristic for adaptive experimentation that improves upon uniform randomization from the perspective of policy learning at the expense of increasing cumulative regret relative to alternative bandit algorithms. The heuristic modifies an existing contextual bandit algorithm by (i) imposing a lower bound on assignment probabilities that decay slowly so that no arm is discarded too quickly, and (ii) after adaptively collecting data, restricting policy learning to select from arms where sufficient data has been gathered.
appendix boundary found by appendix_command · 79% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Kasy, M. and Sautmann, A (2021) Adaptive treatment assignment in experiments for policy choice | 0.811 | 4 | 2 | 100% |
| 2 | Agarwal, A., Hsu, D., Kale, S., Langford, J., Li, L., and Schapire, R (2014) Taming the monster: A fast and simple algorithm for contextual bandits | 0.737 | 3 | 3 | 67% |
| 3 | Athey, S. and Wager, S (2021) Policy learning with observational data self | 0.737 | 3 | 2 | 100% |
| 4 | Bastani, H., Drakopoulos, K., Gupta, V., Vlachogiannis, I., Hadjicri… (2021) Efficient and targeted covid-19 border testing via reinforcement learning | 0.644 | 2 | 2 | 100% |
| 5 | Carranza, A. G., Krishnamurthy, S. K., and Athey, S (2022) Flexible and efficient contextual bandits with heterogeneous treatment effect oracle self | 0.644 | 2 | 2 | 100% |
| 6 | Even-Dar, E., Mannor, S., Mansour, Y., and Mahadevan, S (2006) Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems | 0.644 | 2 | 2 | 100% |
| 7 | Krishnamurthy, S. K., Hadad, V., and Athey, S (2021) Adapting to misspecification in contextual bandits with offline regression oracles self | 0.644 | 2 | 2 | 100% |
| 8 | Krishnamurthy, S. K. and Athey, S (2021) Optimal model selection in contextual bandits with many classes via offline oracles self | 0.644 | 2 | 2 | 100% |
| 9 | Li, L., Chu, W., Langford, J., and Schapire, R. E (2010) A contextual-bandit approach to personalized news article recommendation | 0.644 | 2 | 2 | 100% |
| 10 | Russo, D (2016) Simple bayesian algorithms for best arm identification | 0.644 | 2 | 2 | 100% |
Showing the top 10 of 44 scored citations.
arXiv econ.EM papers that cite this one, ranked by how heavily they lean on it.
| Citing paper | Intensity | Mentions | Sections | |
|---|---|---|---|---|
| 1 | Demistifying Inference after Adaptive Experiments | 0.405 | 1 | 1 |
| 2 | Bandit Algorithms for Policy Learning: Methods, Implementation, and Welfare-performance | 0.405 | 1 | 1 |