Multiplicative Rank-1 Approximation using Length-Squared Sampling
Abstract
We show that the span of (14) rows of any matrix A ⊂ Rn × d sampled according to the length-squared distribution contains a rank-1 matrix A such that ||A - A||F2 ≤ (1 + ) · ||A - π1(A)||F2, where π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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.