Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
Hao Zhu, Geert Leus, Georgios B. Giannakis

TL;DR
This paper introduces sparsity-aware total least-squares methods to improve linear regression under data and matrix perturbations, especially in compressive sampling and array processing applications.
Contribution
It formulates and develops novel S-TLS algorithms that incorporate sparsity constraints and handle perturbations in both data and regression matrices.
Findings
Enhanced robustness in compressive sampling with basis mismatch.
Improved direction-of-arrival estimation accuracy.
Effective calibration of perturbations in practical sensing scenarios.
Abstract
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data vector as well as in the regression matrix. However, existing TLS approaches do not account for sparsity possibly present in the unknown vector of regression coefficients. On the other hand, sparsity is the key attribute exploited by modern compressive sampling and variable selection approaches to linear regression, which include noise in the data, but do not account for perturbations in the regression matrix. The present paper fills this gap by formulating and solving TLS optimization problems under sparsity constraints. Near-optimum and reduced-complexity suboptimum sparse (S-) TLS algorithms are developed to address the perturbed compressive sampling (and the related dictionary learning) challenge, when…
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.
