arXiv cs.LG
· Papers
Algorithms with Polynomially-Improved Approximation Factors for the $2 rightarrow q$ Norm, and Applications
arXiv:2605.25303v3 Announce Type: replace-cross Abstract: The $2 rightarrow q$ norm of a matrix $X in mathbb{R}^{n times d}$ is defined as $lVert X rVert_{2 rightarrow q} = sup_{lVert v rVert_2 = 1} lVert Xv rVert_q$. We give polynomial-time multiplicative approximation algorithms for this norm when $q > 2$