Design Experiments to Compare Multi-armed Bandit Algorithms
Huiling Meng, Ningyuan Chen, Xuefeng Gao

TL;DR
The paper introduces Artificial Replay, a new experimental design for comparing multi-armed bandit algorithms that reduces data requirements and variance, enabling more efficient and reliable policy evaluation.
Contribution
It proposes a novel Artificial Replay method that reuses recorded trajectories to compare bandit algorithms, reducing experimental cost and variance while maintaining unbiasedness.
Findings
Artificial Replay halves the data needed for reliable comparison.
The estimator's variance grows sub-linearly with the number of users.
Numerical experiments confirm theoretical advantages with popular bandit algorithms.
Abstract
Online platforms routinely compare multi-armed bandit algorithms, such as UCB and Thompson Sampling, to select the best-performing policy. Unlike standard A/B tests for static treatments, each run of a bandit algorithm over users produces only one trajectory, because the algorithm's decisions depend on all past interactions. Reliable inference therefore demands many independent restarts of the algorithm, making experimentation costly and delaying deployment decisions. We propose Artificial Replay (AR) as a new experimental design for this problem. AR first runs one policy and records its trajectory. When the second policy is executed, it reuses a recorded reward whenever it selects an action the first policy already took, and queries the real environment only otherwise. We develop a new analytical framework for this design and prove three key properties of the resulting estimator:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
