Detecting a vector based on linear measurements
From MaRDI portal
Abstract: We consider a situation where the state of a system is represented by a real-valued vector. Under normal circumstances, the vector is zero, while an event manifests as non-zero entries in this vector, possibly few. Our interest is in the design of algorithms that can reliably detect events (i.e., test whether the vector is zero or not) with the least amount of information. We place ourselves in a situation, now common in the signal processing literature, where information about the vector comes in the form of noisy linear measurements. 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.
Recommendations
Cites work
- Compressed sensing
- Detection boundary in sparse regression
- Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism
- Higher criticism for detecting sparse heterogeneous mixtures.
- Introduction to nonparametric estimation
- Minimax detection of a signal for \(l^ n\)-balls.
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonparametric goodness-of-fit testing under Gaussian models
- On the Fundamental Limits of Adaptive Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
This page was built for publication: Detecting a vector based on linear measurements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950828)
