[19] Denny Wu and Ji Xu. On the optimal weighted L2 regularization in overparameterized linear regression. Advances in Neural Information Processing Systems, 33:10112-10123, 2020.
[20] Diane Galarneau Gibbons. A simulation study of some ridge estimators. Journal of the American Statistical Association, 76(373):131-139, 1981.
[21] Lisa-Ann Kirkland, Frans Kanfer, and Sollie Millard. LASSO tuning parameter selection. In Annual Proceedings of the South African Statistical Association Conference, volume 2015, pages 49–56. South African Statistical Association (SASA), 2015.
[22] Yosiyuki Sakamoto, Makio Ishiguro, and Genshiro Kitagawa. Akaike information criterion statistics. Dordrecht, The Netherlands: D. Reidel, 81(10.5555):26853, 1986.
[23] Gideon Schwarz. Estimating the dimension of a model. The annals of statistics, pages 461-464, 1978.
[24] Michael Chichignoud, Johannes Lederer, and Martin Wainwright. A practical scheme and fast algorithm to tune the LASSO with optimality guarantees. The Journal of Machine Learning Research, 17(1):8162-8181, 2016.
[25] Denis Chetverikov, Zhipeng Liao, and Victor Chernozhukov. On cross-validated LASSO in high dimensions. The Annals of Statistics, 49(3):1300–1317, 2021.
[26] Saharon Rosset. Topics in regularization and boosting. PhD thesis, Stanford University, 2003.
[27] Ryan Tibshirani. The LASSO problem and uniqueness. Electronic Journal of Statistics, 7:1456-1490, 2013.
[28] Rishi Gupta and Tim Roughgarden. A PAC approach to application-specific algorithm selection. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pages 123-134, 2016.
[29] Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik. Refined bounds for algorithm configuration: The knife-edge of dual class approximability. In International Conference on Machine Learning, pages 580–590. PMLR, 2020.
[30] Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik. Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts. Advances in Neural Information Processing Systems, 35:33890-33903, 2022.
[31] Peter Bartlett, Piotr Indyk, and Tal Wagner. Generalization bounds for data-driven numerical linear algebra. In Conference on Learning Theory, pages 2013-2040. PMLR, 2022.
[32] Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, and Ellen Vitercik. How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 919–932, 2021.
[33] Martin Anthony and Peter Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, USA, 1st edition, 2009.
[34] Maria-Florina Balcan. Book chapter Data-Driven Algorithm Design. In Beyond Worst Case Analysis of Algorithms, T. Roughgarden (Ed). Cambridge University Press, 2020.
[35] Julien Mairal and Bin Yu. Complexity analysis of the LASSO regularization path. In Proceedings of the 29th International Coherence on International Conference on Machine Learning, pages 1835-1842, 2012.
[36] Bernhard Schölkopf, Ralf Herbrich, and Alex J Smola. A generalized representer theorem. In Computational Learning Theory: 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001 Amsterdam, The Netherlands, July 16–19, 2001 Proceedings 14, pages 416–426. Springer, 2001.