Accuracy guaranties for $\ell_1$ recovery of block-sparse signals
Anatoli Juditsky, Fatma K{\i}l{\i}n\c{c} Karzan, Arkadi Nemirovski,, Boris Polyak

TL;DR
This paper introduces a framework for structured signal recovery, focusing on verifiable conditions for accurate block-sparse signal reconstruction, and proposes an efficient algorithm with theoretical guarantees and numerical validation.
Contribution
It develops verifiable conditions for block-sparse signal recovery, enabling error bound optimization and introduces a computationally efficient Block Matching Pursuit algorithm.
Findings
Verifiable conditions lead to improved recovery error bounds.
The proposed algorithm performs comparably to traditional methods.
Numerical results demonstrate effectiveness of block regularizations.
Abstract
We introduce a general framework to handle structured models (sparse and block-sparse with possibly overlapping blocks). We discuss new methods for their recovery from incomplete observation, corrupted with deterministic and stochastic noise, using block- regularization. While the current theory provides promising bounds for the recovery errors under a number of different, yet mostly hard to verify conditions, our emphasis is on verifiable conditions on the problem parameters (sensing matrix and the block structure) which guarantee accurate recovery. Verifiability of our conditions not only leads to efficiently computable bounds for the recovery error but also allows us to optimize these error bounds with respect to the method parameters, and therefore construct estimators with improved statistical properties. To justify our approach, we also provide an oracle inequality, which…
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.
