Adaptive Sampling and Fast Low-Rank Matrix Approximation

@inproceedings{Deshpande2006AdaptiveSA,
  title={Adaptive Sampling and Fast Low-Rank Matrix Approximation},
  author={Amit Deshpande and Santosh Vempala},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2006}
}
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span “contains” a matrix of rank at most k with error only (1 + ) times the error of the best rank-k approximation of A. We complement it with an almost matching lower bound by constructing matrices where the span of any k/2 rows does not “contain” a relative (1 + )-approximation of rank k. Our existence result leads to an algorithm that finds such rank-k approximation in time O M k + k log k + (m + n) k… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 197 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 120 extracted citations

197 Citations

02040'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 197 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…