Research map / Learning theory and algorithms / Sample complexity
The Power of Adaptivity in Identifying Statistical Alternatives
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 changed | Where | Measured | Effect |
|---|---|---|---|
| Adaptive SPRT-like algorithm with no knowledge of alpha, theta0, theta1 (Algorithm 3) versus estimate-then-explore | most biased coin problem · theoretical sample complexity | expected total flips | Helped |
| Adaptive strategy with unknown parameters vs known-parameter SPRT | most biased coin problem · theoretical sample complexity | expected total flips | No clear effect |
Closest papers by meaning
- Near Optimal Non-asymptotic Sample Complexity of 1-Identification (ICML 2025 · similarity 0.84)
- List and Certificate Complexities in Replicable Learning (NeurIPS 2023 · similarity 0.84)
- Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits (NeurIPS 2026 · similarity 0.84)
- The Sample Complexity of Multiple Change Point Identification under Bandit Feedback (NeurIPS 2026 · similarity 0.82)
- Fixed-Confidence Multiple Change Point Identification under Bandit Feedback (ICML 2025 · similarity 0.82)
- Peeking with PEAK: Sequential, Nonparametric Composite Hypothesis Tests for Means of Multiple Data Streams (ICML 2024 · similarity 0.82)
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.