Metraipolis › archive › dc_b4ccbb29dd61
Uniform Testability Implies Asymmetric Testability — arXiv:2608.07854
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.07854
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:06:16.112Z
- SHA-256 of the archived text
9225fbe8512ac89168a45a17fc665113f747955d41aa9ce50a42444f6dc6338a- Stable URL of this page
https://metraipolis.com/documento/dc_b4ccbb29dd61
How to cite
Uniform Testability Implies Asymmetric Testability — arXiv:2608.07854 — arXiv (en), https://arxiv.org/abs/2608.07854 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b4ccbb29dd61 (Metraipolis archive dc_b4ccbb29dd61, sha256 9225fbe8512ac89168a45a17fc665113f747955d41aa9ce50a42444f6dc6338a)
BibTeX
@misc{dcb4ccbb29dd61,
title = {Uniform Testability Implies Asymmetric Testability — arXiv:2608.07854},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.07854},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b4ccbb29dd61; sha256 9225fbe8512ac89168a45a17fc665113f747955d41aa9ce50a42444f6dc6338a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07854. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove a filtration-level conversion from uniform fixed-time testing to all-sample one-sided error control and uniform future-tail control. Given an adapted deterministic binary test whose worst-case fixed-time error tends to zero, the construction selects update times with prescribed summable error budgets and holds each selected decision until the next update. For every prescribed significance level, the construction yields a test that controls Type I error at every sample size; from each update time onward, the probability of any subsequent error is bounded uniformly over each hypothesis class by the remaining budget. Hence the test is uniformly consistent and eventually correct almost surely under both hypotheses. Applying the conversion to finite-alphabet coordinate processes proves the first implication in Ryabko's Conjecture 5.2. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.ST). Categorie arXiv: Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2608.07854 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T09:04:01.350Z dalla pagina https://arxiv.org/catchup/math.ST/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).