English

Huber-Robust Confidence Sequences

Statistics Theory 2023-02-09 v2 Machine Learning Methodology Machine Learning Statistics Theory

Abstract

Confidence sequences are confidence intervals that can be sequentially tracked, and are valid at arbitrary data-dependent stopping times. This paper presents confidence sequences for a univariate mean of an unknown distribution with a known upper bound on the pp-th central moment (pp > 1), but allowing for (at most) ϵ\epsilon fraction of arbitrary distribution corruption, as in Huber's contamination model. We do this by designing new robust exponential supermartingales, and show that the resulting confidence sequences attain the optimal width achieved in the nonsequential setting. Perhaps surprisingly, the constant margin between our sequential result and the lower bound is smaller than even fixed-time robust confidence intervals based on the trimmed mean, for example. Since confidence sequences are a common tool used within A/B/n testing and bandits, these results open the door to sequential experimentation that is robust to outliers and adversarial corruptions.

Keywords

Cite

@article{arxiv.2301.09573,
  title  = {Huber-Robust Confidence Sequences},
  author = {Hongjian Wang and Aaditya Ramdas},
  journal= {arXiv preprint arXiv:2301.09573},
  year   = {2023}
}

Comments

Accepted for publication at the 26th International Conference on Artificial Intelligence and Statistics (AISTATS 2023)

R2 v1 2026-06-28T08:17:59.983Z