Multiplicative Rank-1 Approximation using Length-Squared Sampling

September 16, 2019 Β· Declared Dead Β· πŸ› SIAM Symposium on Simplicity in Algorithms

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ragesh Jaiswal, Amit Kumar arXiv ID 1909.07515 Category cs.DS: Data Structures & Algorithms Citations 0 Venue SIAM Symposium on Simplicity in Algorithms Last Checked 5 months ago
Abstract
We show that the span of $Ξ©(\frac{1}{\varepsilon^4})$ 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}||_F^2 \leq (1 + \varepsilon) \cdot ||A - Ο€_1(A)||_F^2$, 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted