Corpus ID: 58028755

Nonconvex Rectangular Matrix Completion via Gradient Descent without $\ell_{2,\infty}$ Regularization

@article{Chen2019NonconvexRM,
  title={Nonconvex Rectangular Matrix Completion via Gradient Descent without \$\ell_\{2,\infty\}\$ Regularization},
  author={Ji ming Chen and Dekai Liu and Xiaoguang Li},
  journal={arXiv: Machine Learning},
  year={2019}
}
  • Ji ming Chen, Dekai Liu, Xiaoguang Li
  • Published 2019
  • Mathematics, Computer Science
  • arXiv: Machine Learning
  • The analysis of nonconvex matrix completion has recently attracted much attention in the community of machine learning thanks to its computational convenience. Existing analysis on this problem, however, usually relies on $\ell_{2,\infty}$ projection or regularization that involves unknown model parameters, although they are observed to be unnecessary in numerical simulations, see, e.g., Zheng and Lafferty [2016]. In this paper, we extend the analysis of the vanilla gradient descent for… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-9 OF 9 CITATIONS

    Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

    Inference and uncertainty quantification for noisy matrix completion

    Statistical Inferences of Linear Forms for Noisy Matrix Completion

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 55 REFERENCES

    Guaranteed Matrix Completion via Nonconvex Factorization

    • Ruoyu Sun, Zhendong Luo
    • Computer Science
    • 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
    • 2015