Understanding Alternating Minimization for Matrix Completion

Moritz Hardt. Understanding Alternating Minimization for Matrix Completion. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 651-660, IEEE Computer Society, 2014. [doi]

@inproceedings{Hardt14,
  title = {Understanding Alternating Minimization for Matrix Completion},
  author = {Moritz Hardt},
  year = {2014},
  doi = {10.1109/FOCS.2014.75},
  url = {http://dx.doi.org/10.1109/FOCS.2014.75},
  researchr = {https://researchr.org/publication/Hardt14},
  cites = {0},
  citedby = {0},
  pages = {651-660},
  booktitle = {55th IEEE  Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-6517-5},
}