Huber-Robust Confidence Sequences

Hongjian Wang, Aaditya Ramdas
1/23/2023
math.STcs.LGstat.ME

No confident code implementation found for this paper.

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 $p$-th central moment ($p$ > 1), but allowing for (at most) $ε$ 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2023huberrobust,
  title  = {Huber-Robust Confidence Sequences},
  author = {Hongjian Wang and Aaditya Ramdas},
  year   = {2023},
  eprint = {2301.09573},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.09573v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.09573.svg)](https://codeofpaper.com/paper/2301.09573)

Discussion