[AC11] J.-Y. Audibert and O. Catoni. "Robust Linear Least Squares Regression". In: The Annals of Statistics (Oct. 2011). DOI: 10.1214/11-A0S918.
[AKPS19] D. Adil, R. Kyng, R. Peng, and S. Sachdeva. "Iterative Refinement for  $\ell_p$ -norm Regression". In: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Jan. 2019. DOI: 10.1137/1.9781611975482.86.
[AKPS22] D. Adil, R. Kyng, R. Peng, and S. Sachdeva. Fast Algorithms for  $\ell_p$ -Regression. Nov. 7, 2022. DOI: 10.48550/arXiv.2211.03963.
[APS19] D. Adil, R. Peng, and S. Sachdeva. "Fast, Provably Convergent IRLS Algorithm for p-norm Linear Regression". In: Advances in Neural Information Processing Systems. 2019. URL: https://proceedings.neurips.cc/paper_files/paper/2019/ hash/46c7cb50b373877fb2f8d5c4517bb969-Abstract.html.
[Arc96] M. A. Arcones. “The Bahadur-Kiefer Representation of  $L_{p}$  Regression Estimators”. In: Econometric Theory (1996). URL: https://www.jstor.org/stable/3532831.
[AS19] D. Adil and S. Sachdeva. "Faster  $p$ -Norm Minimizing Flows, via Smoothed q-Norm Problems". In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA). Dec. 23, 2019. DOI: 10.1137/1.9781611975994.54.
[BCLL18] S. Bubeck, M. B. Cohen, Y. T. Lee, and Y. Li. "An Homotopy Method for  $\ell_p$  Regression Provably beyond Self-Concordance and in Input-Sparsity Time". In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. June 20, 2018. DOI: 10.1145/3188745.3188776.
[BRW92] Z. D. Bai, C. R. Rao, and Y. Wu. “M-Estimation of Multivariate Linear Regression Parameters Under a Convex Discrepancy Function”. In: Statistica Sinica (1992). URL: https://www.jstor.org/stable/24304129.
[CG17] O. Catoni and I. Giulini. Dimension-Free PAC-Bayesian Bounds for Matrices, Vectors, and Linear Least Squares Regression. Dec. 31, 2017. DOI: 10.48550/arXiv.1712.02747.
[HKZ12] D. Hsu, S. M. Kakade, and T. Zhang. "Random Design Analysis of Ridge Regression". In: Proceedings of the 25th Annual Conference on Learning Theory. June 16, 2012. URL: https://proceedings.mlr.press/v23/hsu12.html.
[X. He and Q.-M. Shao. “A General Bahadur Representation of M-estimators and Its Application to Linear Regression with Nonstochastic Designs”. In: The Annals of Statistics (Dec. 1996). DOI: 10.1214/aos/1032181172.
[JLS22] A. Jambulapati, Y. P. Liu, and A. Sidford. "Improved Iteration Complexities for Overconstrained  $p$ -Norm Regression". In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. June 10, 2022. DOI: 10.1145/3519935.3519971.
[KM15] V. Koltchinskii and S. Mendelson. "Bounding the Smallest Singular Value of a Random Matrix Without Concentration". In: International Mathematics Research Notices (2015). DOI: 10.1093/imrn/rnv096.
[Kni98] K. Knight. "Limiting Distributions for  $L_{1}$  Regression Estimators under General Conditions". In: The Annals of Statistics (Apr. 1998). DOI: 10.1214/aos/1028144858.
[LC83] E. L. Lehmann and G. Casella. Theory of Point Estimation. 1983.
[LL05] P. Y. Lai and S. M. S. Lee. "An Overview of Asymptotic Properties of  $L_{p}$  Regression under General Classes of Error Distributions". In: Journal of the American Statistical Association (2005). URL: https://www.jstor.org/stable/27590567.
[LM16] G. Lecué and S. Mendelson. "Performance of Empirical Risk Minimization in Linear Aggregation". In: Bernoulli (Aug. 2016). DOI: 10.3150/15-BEJ701.
[LM17a] G. Lecué and S. Mendelson. "Regularization and the Small-Ball Method II: Complexity Dependent Error Rates". In: Journal of Machine Learning Research (2017). URL: http://jmlr.org/papers/v18/16-422.html.