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

page 1

page 2

page 3

page 4

research
04/12/2019

Low-rank binary matrix approximation in column-sum norm

We consider ℓ_1-Rank-r Approximation over GF(2), where for a binary m× n...
research
02/22/2017

On the Power of Truncated SVD for General High-rank Matrix Estimation Problems

We show that given an estimate A that is close to a general high-rank po...
research
04/11/2023

Robust Dequantization of the Quantum Singular value Transformation and Quantum Machine Learning Algorithms

Several quantum algorithms for linear algebra problems, and in particula...
research
08/01/2022

On Matrix Multiplication and Polynomial Identity Testing

We show that lower bounds on the border rank of matrix multiplication ca...
research
07/18/2018

Approximation Schemes for Low-Rank Binary Matrix Approximation Problems

We provide a randomized linear time approximation scheme for a generic p...
research
10/13/2018

Approximating Pairwise Correlations in the Ising Model

In the Ising model, we consider the problem of estimating the covariance...

Please sign up or login with your details

Forgot password? Click here to reset