Fast matrix completion without the condition number

@inproceedings{Hardt2014FastMC,
  title={Fast matrix completion without the condition number},
  author={Moritz Hardt and Mary Wootters},
  booktitle={COLT},
  year={2014}
}
We give the first algorithm for Matrix Completion that achieves running time and sample complexity that is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix. To the best of our knowledge, all previous algorithms either incurred a quadratic dependence on the condition number of the unknown matrix or a quadratic dependence on the dimension of the matrix. Our algorithm is based on a novel extension of… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 6 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.
49 Citations
25 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Efficient algorithms for collaborative filtering

  • Raghunandan H. Keshavan
  • PhD thesis, Stanford University,
  • 2012
Highly Influential
20 Excerpts

Matrix Algorithms. Volume II: Eigensystems

  • G. W. Stewart
  • Society for Industrial and Applied Mathematics,
  • 2001
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…