Multiplicative Rank-1 Approximation using Length-Squared Sampling
Abstract: We show that the span of $\Omega(\frac{1}{\varepsilon4})$ rows of any matrix $A \subset \mathbb{R}{n \times d}$ sampled according to the length-squared distribution contains a rank-$1$ matrix $\tilde{A}$ such that $||A - \tilde{A}||_F2 \leq (1 + \varepsilon) \cdot ||A - \pi_1(A)||_F2$, where $\pi_1(A)$ denotes the best rank-$1$ approximation of $A$ under the Frobenius norm. Length-squared sampling has previously been used in the context of rank-$k$ approximation. However, the approximation obtained was additive in nature. We obtain a multiplicative approximation albeit only for rank-$1$ approximation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.