Efficient blind search: optimal power of detection under computational cost constraints

DOI10.1214/08-AOAS180MaRDI QIDQ1018599zbMATHOpenAlexFDO

Authors Nicolai Meinshausen, P. J. Bickel, John Rice

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

zbMATH Keywords

dynamic programmingmultiple testinggroup testingpulsar detection

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Applications of statistics to physics (62P35) Dynamic programming (90C39) Galactic and stellar dynamics (85A05) Statistical astronomy (85A35)

Abstract: Some astronomy projects require a blind search through a vast number of hypotheses to detect objects of interest. The number of hypotheses to test can be in the billions. A naive blind search over every single hypothesis would be far too costly computationally. We propose a hierarchical scheme for blind search, using various "resolution" levels. At lower resolution levels, "regions" of interest in the search space are singled out with a low computational cost. These regions are refined at intermediate resolution levels and only the most promising candidates are finally tested at the original fine resolution. The optimal search strategy is found by dynamic programming. We demonstrate the procedure for pulsar search from satellite gamma-ray observations and show that the power of the naive blind search can almost be matched with the hierarchical scheme while reducing the computational burden by more than three orders of magnitude.

Recommendations

• On blind searches for noise dominated signals: a loosely coherent approach
• Sub-optimal all-sky detection of periodic gravitational waves
• Optimal discrete search with technological choice
• Some viewpoints about the optimization of the management of detection rescources for the search of a moving target
• Optimal search with time-dependent detection rate functions

Cites work

• scientific article; zbMATH DE number 1375577 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• scientific article; zbMATH DE number 3340845 (Why is no real title available?)
• Asymptotically Optimum Sequential Inference and Design
• Hierarchical testing designs for pattern recognition

Cited in

(6)

• A numerical study of the bottom-up and top-down inference processes in and-or graphs
• Multiple testing along a tree
• On a couple of unresolved group testing conjectures
• Further results on controlling the false discovery rate under some complex grouping structure of hypotheses
• Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
• Detection of long edges on a computational budget: A sublinear approach

This page was built for publication: Efficient blind search: optimal power of detection under computational cost constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018599)