Adaptive sensing performance lower bounds for sparse signal detection and support estimation
From MaRDI portal
Publication:470072
DOI10.3150/13-BEJ555zbMath1357.94030arXiv1206.0648MaRDI QIDQ470072
Publication date: 11 November 2014
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0648
Non-Markovian processes: estimation (62M09) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Sequential statistical design (62L05) Non-Markovian processes: hypothesis testing (62M07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the proportion of false null hypotheses among a large number of independently tested hypotheses
- On combinatorial testing problems
- Searching for a trail of evidence in a maze
- Asymptotically efficient adaptive allocation rules
- Some problems of hypothesis testing leading to infinitely divisible distributions
- Selective sampling using the query by committee algorithm
- Sequential methods for design-adaptive estimation of discontinuities in regression curves and surfaces
- Nonparametric goodness-of-fit testing under Gaussian models
- Higher criticism for detecting sparse heterogeneous mixtures.
- Rates of convergence for the sup-norm risk in image models under sequential designs
- Rates of convergence in active learning
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Estimation and confidence sets for sparse normal mixtures
- On the power of adaption
- Hierarchical testing designs for pattern recognition
- On the Fundamental Limits of Adaptive Sensing
- Sequential Design of Experiments
- Minimax Bounds for Active Learning
- Distilled Sensing: Adaptive Sampling for Sparse Detection and Estimation
- Übersichtsarbeiten
- All of Nonparametric Statistics
- Introduction to nonparametric estimation
- Compressed sensing
