Near-Optimal Confidence Sequences for Bounded Random Variables
From MaRDI portal
Publication:6342423
arXiv2006.05022MaRDI QIDQ6342423
Author name not available (Why is that?)
Publication date: 8 June 2020
Abstract: Many inference problems, such as sequential decision problems like A/B testing, adaptive sampling schemes like bandit selection, are often online in nature. The fundamental problem for online inference is to provide a sequence of confidence intervals that are valid uniformly over the growing-into-infinity sample sizes. To address this question, we provide a near-optimal confidence sequence for bounded random variables by utilizing Bentkus' concentration results. We show that it improves on the existing approaches that use the Cram{'e}r-Chernoff technique such as the Hoeffding, Bernstein, and Bennett inequalities. The resulting confidence sequence is confirmed to be favorable in both synthetic coverage problems and an application to adaptive stopping algorithms.
Has companion code repository: https://github.com/enosair/bentkus_conf_seq
This page was built for publication: Near-Optimal Confidence Sequences for Bounded Random Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6342423)
