Efficient blind search: optimal power of detection under computational cost constraints
From MaRDI portal
Publication:1018599
DOI10.1214/08-AOAS180zbMath1161.62087arXiv0712.1663OpenAlexW3104444551MaRDI QIDQ1018599
Nicolai Meinshausen, John A. Rice, Peter J. Bickel
Publication date: 20 May 2009
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.1663
Applications of mathematical programming (90C90) Dynamic programming (90C39) Applications of statistics to physics (62P35) Galactic and stellar dynamics (85A05) Statistical astronomy (85A35)
Related Items
Further results on controlling the false discovery rate under some complex grouping structure of hypotheses, A numerical study of the bottom-up and top-down inference processes in and-or graphs, On a couple of unresolved group testing conjectures, Multiple testing along a tree, Detection of Long Edges on a Computational Budget: A Sublinear Approach, Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
Cites Work
