摘要：We consider a situation where the state of a system is represented by a real-valued vector x∈ℝn. Under normal circumstances, the vector x is zero, while an event manifests as non-zero entries in x, possibly few. Our interest is in designing algorithms that can reliably detect events — i.e., test whether x=0 or x≠0 — with the least amount of information. We place ourselves in a situation, now common in the signal processing literature, where information on x comes in the form of noisy linear measurements y=〈a,x〉+z, where a∈ℝn has norm bounded by 1 and . We derive information bounds in an active learning setup and exhibit some simple near-optimal algorithms. In particular, our results show that the task of detection within this setting is at once much easier, simpler and different than the tasks of estimation and support recovery.
