[20] Rong Ge, Jason D. Lee, and Tengyu Ma. Learning one-hidden-layer neural networks with landscape design, 2017.
[21] Yifei Wang, Jonathan Lacotte, and Mert Pilanci. The hidden convex optimization landscape of regularized two-layer reLU networks: an exact characterization of optimal solutions. In International Conference on Learning Representations, 2022.
[22] Ming Yuan and Yi Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68(1):49-67, 2006.
[23] Lei Tan, Shutong Wu, and Xiaolin Huang. Weighted neural tangent kernel: A generalized and improved network-induced kernel. arXiv preprint arXiv:2103.11558, 2021.
[24] Ziwei Ji and Matus Telgarsky. Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow relu networks. arXiv preprint arXiv:1909.12292, 2019.
[25] Lenaic Chizat. Sparse optimization on measures with over-parameterized gradient descent. Mathematical Programming, 194(1-2):487-532, 2022.
[26] Song Mei, Andrea Montanari, and Phan-Minh Nguyen. A mean field view of the landscape of two-layer neural networks. Proceedings of the National Academy of Sciences, 115(33):E7665–E7671, 2018.
[27] Rajat Vadiraj Dwaraknath. Understanding the neural tangent kernel. https://rajatvd.github.io/NTK/, 2019. Accessed: 2022-05-17.
[28] Simon Du and Wei Hu. Ultra-wide deep nets and the neural tangent kernel (ntk). https://blog.ml.cmu.edu/2019/10/03/ultra-wide-deep-nets-and-the-neural-tangent-kernel-ntk/, 2019. Accessed: 2022-05-17.
[29] Francis R Bach, Gert RG Lanckriet, and Michael I Jordan. Multiple kernel learning, conic duality, and the smo algorithm. In Proceedings of the twenty-first international conference on Machine learning, page 6, 2004.
[30] Francis R Bach. The “eta-trick” reloaded: multiple kernel learning, 2019. Accessed: 2022-05-17.
[31] Francis R Bach. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9(6), 2008.
[32] Ingrid Daubechies, Ronald DeVore, Massimo Fornasier, and C Sinan G üntürk. Iteratively reweighted least squares minimization for sparse recovery. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 63(1):1-38, 2010.
[33] Francis Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, et al. Optimization with sparsity-inducing penalties. Foundations and Trends® in Machine Learning, 4(1):1-106, 2012.
[34] Julien Mairal, Francis Bach, and Jean Ponce. Sparse modeling for image and vision processing. arXiv preprint arXiv:1411.3230, 2014.
[35] Francis R Bach. The “eta-trick” or the effectiveness of reweighted least-squares. https://francisbach.com/the-%CE%B7-trick-or-the-effectiveness-of-reweighted-least-squares/, 2019. Accessed: 2022-05-17.
[36] Han Liu and Jian Zhang. Estimation consistency of the group lasso and its applications. In Artificial Intelligence and Statistics, pages 376-383. PMLR, 2009.
[37] Peter Buhlmann, Sara van de Geer, Peter Buhlmann, and Sara van de Geer. Theory for the lasso. Statistics for High-Dimensional Data: Methods, Theory and Applications, pages 99-182, 2011.
[38] Kurt Hornik, Maxwell Stinchcombe, and Halbert White. Multilayer feedforward networks are universal approximators. Neural networks, 2(5):359-366, 1989.
[39] Dario Azzimonti and David Ginsbourger. Estimating orthant probabilities of high-dimensional gaussian vectors with an application to set estimation. Journal of Computational and Graphical Statistics, 27(2):255-267, 2018.
[40] Peter Craig. A new reconstruction of multivariate normal orthant probabilities. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 70(1):227-243, 2008.