[1] Peter J Bickel, Ya'acov Ritov, Alexandre B Tsybakov, et al. Simultaneous analysis of lasso and dantzig selector. The Annals of statistics, 37(4):1705-1732, 2009.
[2] Peter Buhlmann, Philipp Rütimann, Sara Van De Geer, and Cun-Hui Zhang. Correlated variables in regression: clustering and sparse estimation. Journal of Statistical Planning and Inference, 143(11):1835-1858, 2013.
[3] Emmanuel Candes, Terence Tao, et al. The dantzig selector: Statistical estimation when  $p$  is much larger than  $n$ . Annals of statistics, 35(6):2313-2351, 2007.
[4] Emmanuel J Candes, Justin K Romberg, and Terence Tao. Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 59(8):1207-1223, 2006.
[5] Emmanuel J Candes and Terence Tao. Decoding by linear programming. IEEE transactions on information theory, 51(12):4203-4215, 2005.
[6] Jean Cardinal and Aurélien Ooms. Algorithms for approximate sparse regression and nearest induced hulls. Journal of Computational Geometry, 13(1):377-398, 2022.
[7] Shaobing Chen and David Donoho. Basis pursuit. In Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers, volume 1, pages 41-44. IEEE, 1994.
[8] Arnak S Dalalyan, Mohamed Hebiri, Johannes Lederer, et al. On the prediction performance of the lasso. Bernoulli, 23(1):552-581, 2017.
[9] Abhimanyu Das and David Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975, 2011.
[10] David L Donoho and Philip B Stark. Uncertainty principles and signal recovery. SIAM Journal on Applied Mathematics, 49(3):906-931, 1989.
[11] Vitaly Feldman. Open problem: The statistical query complexity of learning sparse halfspaces. In Conference on Learning Theory, pages 1283-1289. PMLR, 2014.
[12] Mario Figueiredo and Robert Nowak. Ordered weighted 11 regularized regression with strongly correlated covariates: Theoretical aspects. In Artificial Intelligence and Statistics, pages 930–938. PMLR, 2016.
[13] Dean P Foster and Edward I George. The risk inflation criterion for multiple regression. The Annals of Statistics, pages 1947-1975, 1994.
[14] Surbhi Goel, Aravind Gollakota, Zhihan Jin, Sushrut Karmalkar, and Adam Klivans. Superpolynomial lower bounds for learning one-layer neural networks using gradient descent. In International Conference on Machine Learning, pages 3587-3596. PMLR, 2020.
[15] Aparna Gupte and Vinod Vaikuntanathan. The fine-grained hardness of sparse linear regression. arXiv preprint arXiv:2106.03131, 2021.
[16] Aparna Ajit Gupte and Kerri Lu. Fine-grained complexity of sparse linear regression. 2020.
[17] Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023.
[18] Sariel Har-Peled, Piotr Indyk, and Sepideh Mahabadi. Approximate sparse linear regression. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
[19] Jim C Huang and Nebojsa Jojic. Variable selection through correlation sifting. In RECOMB, volume 6577, pages 106-123. Springer, 2011.