mlsanityData to 7 Oct 2026

On the bias, risk and consistency of sample means in multi-armed bandits

arXiv 1902.00746 ↗First posted 2 Feb 2019math.ST cs.LG stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

The sample mean is among the most well studied estimators in statistics, having many desirable properties such as unbiasedness and consistency. However, when analyzing data collected using a multi-armed bandit (MAB) experiment, the sample mean is biased and much remains to be understood about its properties. For example, when is it consistent, how large is its bias, and can we bound its mean squared error? This paper delivers a thorough and systematic treatment of the bias, risk and consistency of MAB sample means. Specifically, we identify four distinct sources of selection bias (sampling, stopping, choosing and rewinding) and analyze them both separately and together. We further demonstrate that a new notion of effective sample size can be used to bound the risk of the sample mean under suitable loss functions. We present several carefully designed examples to provide intuition on the different sources of selection bias we study. Our treatment is nonparametric and algorithm-agnostic, meaning that it is not tied to a specific algorithm or goal. In a nutshell, our proofs combine variational representations of information-theoretic divergences with new martingale concentration inequalities.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 8; 2022: 3; 2023: 2; 2024: 6; 2025: 4; 2026: 1.

24 papers.

Sort:

  1. 2021Post-Contextual-Bandit Inferencecited by 32
  2. 2021A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithmscited by 29
  3. 2021Online Multi-Armed Bandits with Adaptive Inferencecited by 21
  4. 2021Near-optimal inference in adaptive linear regressioncited by 20
  5. 2021Martingale Methods for Sequential Estimation of Convex Functionals and Divergencescited by 17
  6. 2024UCB algorithms for multi-armed bandits: Precise regret and adaptive inferencecited by 16
  7. 2024Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streamscited by 9
  8. 2024Inference with the Upper Confidence Bound Algorithmcited by 9
  9. 2021A unified framework for bandit multiple testingcited by 8
  10. 2023Adaptive Linear Estimating Equationscited by 6
  11. 2025Stable Thompson Sampling: Valid Inference via Variance Inflationcited by 6
  12. 2022Integrating Reward Maximization and Population Estimation: Sequential Decision-Making for Internal Revenue Service Audit Selectioncited by 5
12 more
  1. 2022Adaptive Experimental Design and Counterfactual Inferencecited by 5
  2. 2024Optimal Adaptive Experimental Design for Estimating Treatment Effectcited by 5
  3. 2024Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Banditscited by 5
  4. 2021Doubly Robust Interval Estimation for Optimal Policy Evaluation in Online Learningcited by 4
  5. 2024Best of Three Worlds: Adaptive Experimentation for Digital Marketing in Practicecited by 4
  6. 2021Debiasing Samples from Online Learning Using Bootstrapcited by 3
  7. 2023Statistical Limits of Adaptive Linear Models: Low-Dimensional Estimation and Inferencecited by 3
  8. 2025Simulation-Based Inference for Adaptive Experimentscited by 3
  9. 2025Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stabilitycited by 2
  10. 2022Entropy Regularization for Population Estimationcited by 1
  11. 2025Cost-Aware Optimal Pairwise Pure Explorationcited by 0
  12. 2026Modeling Covariate Transition for Efficient Estimation of Longitudinal Treatment Effects in Randomized Experimentscited by 0