AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Beyond First-order Asymptotics in Sequential Mean Testing

VIKAS DEEP, Shubhada Agrawal

ICML 2026 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use practical constant threshold beta=log(1/alpha) instead of theoretical beta=1+log(2(1+n)/alpha) (ablation)KLinf sequential test · Bernoulli(0.6), m0=0.2, stopping-time CLTGaussianity of normalized stopping timeImproved
decrease alpha from 1e-4 to 1e-8 (ablation)KLinf sequential test · Bernoulli(0.6), m0=0.2Gaussian fit of normalized stopping timeImproved
increase sample size n from 1000 to 2000 (ablation)empirical KLinf statistic · Beta(3,2) and Bernoulli(0.6), m0=0.7closeness to Gaussian limitImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy