Fast computation of low rank matrix

@inproceedings{Achlioptas2001FastCO,
  title={Fast computation of low rank matrix},
  author={Dimitris Achlioptas and Frank McSherry},
  booktitle={STOC},
  year={2001}
}
Given a matrix <italic>A</italic> it is often desirable to find an approximation to <italic>A</italic> that has low rank. We introduce a simple technique for accelerating the computation of such approximations when <italic>A</italic> has strong spectral structure, i.e., when the singular values of interest are significantly greater than those of a random matrix with size and entries similar to <italic>A</italic>. Our technique amounts to independently sampling and/or quantizing the entries of… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…