On computing approximate Lewis weights (2404.02881v1)
Abstract: In this note we provide and analyze a simple method that given an $n \times d$ matrix, outputs approximate $\ell_p$-Lewis weights, a natural measure of the importance of the rows with respect to the $\ell_p$ norm, for $p \geq 2$. More precisely, we provide a simple post-processing procedure that turns natural one-sided approximate $\ell_p$-Lewis weights into two-sided approximations. When combined with a simple one-sided approximation algorithm presented by Lee (PhD thesis, 16) this yields an algorithm for computing two-sided approximations of the $\ell_p$-Lewis weights of an $n \times d$-matrix using $\mathrm{poly}(d,p)$ approximate leverage score computations. While efficient high-accuracy algorithms for approximating $\ell_p$-Lewis had been established previously by Fazel, Lee, Padmanabhan and Sidford (SODA22), the simple structure and approximation tolerance of our algorithm may make it of use for different applications.
- Quantum speedups for linear programming via interior point methods, 2023. arXiv:2311.03215.
- Approximation of zonoids by zonotopes. Acta Mathematica, 162:73 – 141, 1989.
- ℓpsubscriptℓ𝑝\ell_{p}roman_ℓ start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT row sampling by Lewis weights. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pages 183–192, 2015.
- Fast approximation of matrix coherence and statistical leverage. The Journal of Machine Learning Research, 13(1):3475–3506, 2012.
- Computing Lewis weights to high precision. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2723–2742, 2022.
- Improved iteration complexities for overconstrained p-norm regression. In Proceedings of the fifty-fourth annual ACM symposium on Theory of computing. ACM, 2022.
- Yin Tat Lee. Faster Algorithms for Convex and Combinatorial Optimization. PhD thesis, Massachusetts Institute of Technology, 2016.
- D. Lewis. Finite dimensional subspaces of Lpsubscript𝐿𝑝L_{p}italic_L start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT. Studia Mathematica, 63(2):207–212, 1978.
- Solving linear programs with rankrank\sqrt{\text{rank}}square-root start_ARG rank end_ARG linear system solves. arXiv preprint arXiv:1910.08033, 2019.
- Sampling from large matrices: An approach through geometric functional analysis. Journal of the ACM (JACM), 54(4):21–es, 2007.
- Graph sparsification by effective resistances. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 563–568, 2008.
- Michel Talagrand. Embedding subspaces of L1subscript𝐿1L_{1}italic_L start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT into ℓ1Nsuperscriptsubscriptℓ1𝑁\ell_{1}^{N}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT start_POSTSUPERSCRIPT italic_N end_POSTSUPERSCRIPT. Proceedings of the American Mathematical Society, 108(2):363–369, 1990.
- Michael J Todd. Minimum-volume ellipsoids: Theory and algorithms. SIAM, 2016.
- Minimum cost flows, mdps, and ℓ1subscriptℓ1\ell_{1}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT-regression in nearly linear time for dense instances. In Proceedings of the fifty-third annual ACM symposium on Theory of computing. ACM, 2021.
- Online lewis weight sampling. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4622–4666, 2023.