Robustness of Sparse Recovery via $F$-minimization: A Topological Viewpoint
Jingbo Liu, Jian Jin, and Yuantao Gu

TL;DR
This paper investigates the robustness of sparse recovery via F-minimization in noisy settings, using a topological approach to relate exact and robust recovery conditions and providing probabilistic and quantitative insights.
Contribution
It introduces a topological framework connecting ERC and RRC sets for F-minimization, extending previous results and providing new probabilistic and quantitative conditions for robustness.
Findings
RRC set is the interior of ERC set, with measure zero boundary.
Probabilities of ERC and RRC are equal for random measurement matrices.
Quantitative bounds relate null space position to robustness constant.
Abstract
A recent trend in compressed sensing is to consider non-convex optimization techniques for sparse recovery. The important case of -minimization has become of particular interest, for which the exact reconstruction condition (ERC) in the noiseless setting can be precisely characterized by the null space property (NSP). However, little work has been done concerning its robust reconstruction condition (RRC) in the noisy setting. We look at the null space of the measurement matrix as a point on the Grassmann manifold, and then study the relation between the ERC and RRC sets, denoted as and , respectively. It is shown that is the interior of , from which a previous result of the equivalence of ERC and RRC for -minimization follows easily as a special case. Moreover, when is non-decreasing, it is shown that…
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.
