Multiplicative Rank-1 Approximation using Length-Squared Sampling
Data Structures and Algorithms
2019-10-30 v2
Abstract
We show that the span of rows of any matrix sampled according to the length-squared distribution contains a rank- matrix such that , where denotes the best rank- approximation of under the Frobenius norm. Length-squared sampling has previously been used in the context of rank- approximation. However, the approximation obtained was additive in nature. We obtain a multiplicative approximation albeit only for rank- approximation.
Cite
@article{arxiv.1909.07515,
title = {Multiplicative Rank-1 Approximation using Length-Squared Sampling},
author = {Ragesh Jaiswal and Amit Kumar},
journal= {arXiv preprint arXiv:1909.07515},
year = {2019}
}
Comments
A section on open problems added in the new version