[56] Jean Bourgain, Joram Lindenstrauss, and Vitali Milman. Approximation of zonoids by zonotopes. 1989.
[57] Michel Talagrand. Proceedings of the American Mathematical Society, 1990.
[58] Michel Ledoux and Michel Talagrand. Probability in Banach Spaces: isoperimetry and processes, volume 23. Springer Science & Business Media, 1991.
[59] Gideon Schechtman and Artem Zvavitch. Embedding subspaces of  $\ell_p$  into  $\ell_p^n$ ,  $0 < p < 1$ . Mathematische Nachrichten, 2001. 4
[60] Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford. Uniform sampling for matrix approximation. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015. 4, 5, 19
[61] Petros Drineas, Malik Magdon-Ismail, Michael W Mahoney, and David P Woodruff. Fast approximation of matrix coherence and statistical leverage. The Journal of Machine Learning Research, 13(1), 2012. 4
[62] Mu Li, Gary L Miller, and Richard Peng. Iterative row sampling. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013. 4
[63] Christian Sohler and David P Woodruff. Strong coresets for k-median and subspace approximation: Goodbye dimension. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018. 4
[64] Rachit Chhaya, Jayesh Choudhari, Anirban Dasgupta, and Supratim Shit. Streaming coresets for symmetric tensor factorization. In International Conference on Machine Learning, 2020. 4
[65] David Durfee, Kevin A Lai, and Saurabh Sawlani.  $\ell_1$  regression using lewis weights preconditioning and stochastic gradient descent. In Conference On Learning Theory, 2018. 4
[66] Yi Li, Ruosong Wang, Lin Yang, and Hanrui Zhang. Nearly linear row sampling algorithm for quantile regression. In Proceedings of the 37th International Conference on Machine Learning, 2020. 4
[67] Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P Woodruff, and Samson Zhou. Near optimal linear algebra in the online and sliding window models. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020. 4, 6
[68] Aditi Laddha, Yin Tat Lee, and Santosh Vempala. Strong self-concordance and sampling. In Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, 2020. 4
[69] Yi Li, Ruosong Wang, Lin Yang, and Hanrui Zhang. Nearly linear row sampling algorithm for quantile regression. In International Conference on Machine Learning, 2020. 4
[70] Arvind V Mahankali and David P Woodruff. Optimal  $\ell_1$  column subset selection and a fast ptas for low rank approximation. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021. 4
[71] Tung Mai, Cameron Musco, and Anup Rao. Coresets for classification-simplified and strengthened. Advances in Neural Information Processing Systems, 34, 2021. 4
[72] Xue Chen and Michal Derezinski. Query complexity of least absolute deviation regression via robust uniform convergence. In Conference on Learning Theory, 2021.
[73] Aditya Parulekar, Advait Parulekar, and Eric Price. L1 regression with lewis weights subsampling. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2021. 4
[74] Frederic G Foster. On the stochastic matrices associated with certain queuing processes. The Annals of Mathematical Statistics, 24(3), 1953. 5