On the Fundamental Limits of Recovering Tree Sparse Vectors from Noisy Linear Measurements
Akshay Soni, Jarvis Haupt

TL;DR
This paper establishes fundamental limits for support recovery of tree-sparse signals from noisy linear measurements, demonstrating that adaptive sensing strategies are nearly optimal compared to any other approach.
Contribution
It provides the first theoretical performance bounds for support recovery of tree-sparse signals, showing the near-optimality of adaptive sensing strategies.
Findings
Adaptive tree sensing is nearly optimal for support recovery.
Fundamental limits are established for non-adaptive and adaptive measurements.
Support recovery performance depends on measurement strategy and signal structure.
Abstract
Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting additional structure in the locations of the nonzero signal coefficients during inference, or by utilizing some form of data-dependent adaptive measurement focusing during the sensing process. To our knowledge, our own previous work was the first to establish the potential benefits that can be achieved when fusing the notions of adaptive sensing and structured sparsity -- that work examined the task of support recovery from noisy linear measurements, and established that an adaptive sensing strategy specifically tailored to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
