Multiplicative Rank-1 Approximation using Length-Squared Sampling

09/16/2019
∙
by   Ragesh Jaiswal, et al.
∙
0
∙

We show that the span of Ω(1/ε^4) rows of any matrix A ⊂R^n × d sampled according to the length-squared distribution contains a rank-1 matrix à such that ||A - Ã||_F^2 ≤ (1 + ε) · ||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.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment