Sharp multiple testing boundary for sparse sequences
稀疏序列多重检验的精确边界AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用稀疏序列的多重检验理论,没有明确经济学或金融应用,不能仅凭检验和变量筛选的关联选择领域细分。
稀疏序列多重检验的精确边界AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This work investigates multiple testing by considering minimax separation rates in the sparse sequence model, when the testing risk is measured as the sum FDR+FNR (False Discovery Rate plus False Negative Rate). First, using the popular beta-min separation condition, with all nonzero signals separated from 0 by at least some amount, we determine the sharp minimax testing risk asymptotically and thereby explicitly describe the transition from “achievable multiple testing with vanishing risk” to “impossible multiple testing.” Adaptive multiple testing procedures achieving the corresponding optimal boundary are provided: the Benjamini–Hochberg procedure with a properly tuned level, and an empirical Bayes ℓ-value (‘local FDR’) procedure. We prove that the FDR and FNR make nonsymmetric contributions to the testing risk for most optimal procedures, the FNR part being dominant at the boundary. The multiple testing hardness is then investigated for classes of arbitrary sparse signals. A number of extensions, including results for classification losses and convergence rates in the case of large signals, are also investigated.