A note on sparse least-squares regression
From MaRDI portal
Publication:2446076
DOI10.1016/j.ipl.2013.11.011zbMath1452.62490arXiv1312.7499OpenAlexW1983483837MaRDI QIDQ2446076
Malik Magdon-Ismail, Christos Boutsidis
Publication date: 15 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.7499
Related Items
Optimal column subset selection for image classification by genetic algorithms, Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- The truncated SVD as a method for regularization
- Greed is Good: Algorithmic Results for Sparse Approximation
- Some Applications of the Rank Revealing QR Factorization
- Tikhonov Regularization and Total Least Squares
- Sparse Approximate Solutions to Linear Systems
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Near Optimal Column-Based Matrix Reconstruction