English(EN) On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds

新研究论文详细介绍了序贯检验停时的紧确界限

作者 PulseAugur 编辑部 · [1 个来源] · 2026-08-18 04:00

一篇新发表在arXiv上的研究论文介绍了序贯检验停时的新的下界。该论文由Shubhada Agrawal撰写，提供了适用于非参数和复合设置的通用界限，显著扩展了先前的参数化结果。它还提供了匹配上界的条件，证明了它们在各种非参数场景中的适用性。 AI

排序理由该聚类包含一篇发表在arXiv上的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该聚类包含一篇发表在arXiv上的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: 57 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv stat.ML TIER_1 English(EN) · Shubhada Agrawal, Ashwin Ram, Aaditya Ramdas · 2026-08-18 04:00

关于幂一序贯检验的停时：紧致的下界和上界

arXiv:2504.19952v2 Announce Type: replace-cross Abstract: We present two general lower bounds for stopping times of sequential tests between arbitrary composite nulls $\mathcal P$ and alternatives $\mathcal Q$. The first lower bound is for the ``Wald setting'' where the type-1 er…