Quadratic Basis Pursuit
Henrik Ohlsson, Allen Y. Yang, Roy Dong, Michel Verhaegen, S., Shankar Sastry

TL;DR
This paper introduces quadratic basis pursuit, a method extending compressive sensing to nonlinear models via second-order Taylor expansion, enabling exact sparse signal recovery with high sampling rates.
Contribution
It develops a novel quadratic basis pursuit framework and efficient algorithms for nonlinear compressive sensing, improving accuracy over linear approximations.
Findings
Exact sparse signal recovery at high sampling rates
Effective handling of second-order nonlinearities
Development of computationally efficient algorithms
Abstract
In many compressive sensing problems today, the relationship between the measurements and the unknowns could be nonlinear. Traditional treatment of such nonlinear relationships have been to approximate the nonlinearity via a linear model and the subsequent un-modeled dynamics as noise. The ability to more accurately characterize nonlinear models has the potential to improve the results in both existing compressive sensing applications and those where a linear approximation does not suffice, e.g., phase retrieval. In this paper, we extend the classical compressive sensing framework to a second-order Taylor expansion of the nonlinearity. Using a lifting technique and a method we call quadratic basis pursuit, we show that the sparse signal can be recovered exactly when the sampling rate is sufficiently high. We further present efficient numerical algorithms to recover sparse signals in…
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.
Taxonomy
TopicsMatrix Theory and Algorithms
