[37] Emmanuel J Candes and Terence Tao. Decoding by linear programming. IEEE transactions on information theory, 51(12), 2005. 2
[38] Morteza Alamgir and Ulrike Luxburg. Phase transition in the family of  $p$ -resistances. Advances in neural information processing systems, 24, 2011. 2
[39] Jeff Calder. Consistency of lipschitz learning with infinite unlabeled data and finite labeled data. SIAM Journal on Mathematics of Data Science, 1(4), 2019.
[40] Maurizio Flores, Jeff Calder, and Gilad Lerman. Analysis and algorithms for  $\ell_p$ -based semi-supervised learning on graphs. Applied and Computational Harmonic Analysis, 60, 2022. 2
[41] Abderrahim Elmoataz, Matthieu Toutain, and Daniel Tenbrinck. On the  $p$ -laplacian and  $\infty$ -laplacian on graphs with applications in image and data processing. SIAM Journal on Imaging Sciences, 8(4), 2015. 2
[42] Kenneth Clarkson, Ruosong Wang, and David Woodruff. Dimensionality reduction for tukey regression. In International Conference on Machine Learning, 2019. 3, 4, 7
[43] Cynthia Dwork, Aaron Roth, et al. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science, 9(3-4):211-407, 2014. 3
[44] Deeksha Adil, Richard Peng, and Sushant Sachdeva. Fast, provably convergent irls algorithm for p-norm linear regression. Advances in Neural Information Processing Systems, 32, 2019. 4, 6, 30
[45] Arun Jambulapati, Yang P Liu, and Aaron Sidford. Improved iteration complexities for overconstrained p-norm regression. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022. 4, 6, 30
[46] Arthur Asuncion and David Newman. Uci machine learning repository, 2007. 4, 10
[47] Anant Raj, Cameron Musco, and Lester Mackey. Importance sampling via local sensitivity. In International Conference on Artificial Intelligence and Statistics, 2020. 4
[48] Alaa Maalouf, Adiel Statman, and Dan Feldman. Tight sensitivity bounds for smaller coresets. In Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pages 2051–2061, 2020. 4
[49] Ruosong Wang, Russ R Salakhutdinov, and Lin Yang. Reinforcement learning with general value function approximation: Provably efficient approach via bounded eluder dimension. Advances in Neural Information Processing Systems, 33:6123-6135, 2020. 4
[50] Dingwen Kong, Ruslan Salakhutdinov, Ruosong Wang, and Lin F Yang. Online sub-sampling for reinforcement learning with general function approximation. arXiv preprint arXiv:2106.07203, 2021.4
[51] Lucas Liebenwein, Cenk Baykal, Harry Lang, Dan Feldman, and Daniela Rus. Provable filter pruning for efficient neural networks. In International Conference on Learning Representations, 2019. 4
[52] Murad Tukan, Loay Mualem, and Alaa Maalouf. Pruning neural networks via coresets and convex geometry: Towards no assumptions. Advances in Neural Information Processing Systems, 2022.
[53] Ben Mussay, Dan Feldman, Samson Zhou, Vladimir Braverman, and Margarita Osadchy. Data-independent structured pruning of neural networks via coresets. IEEE Transactions on Neural Networks and Learning Systems, 33(12):7829-7841, 2021. 4
[54] D Lewis. Finite dimensional subspaces of  $\ell_p$ . Studia Mathematica, 1978. 4, 5
[55] Gideon Schechtman. More on embedding subspaces of  $\ell_p$  in  $\ell_r^n$ . Compositio Mathematica, 1987.