Fetching the paper…
Reading the bibliography…
Matrix factorization is a popular approach for large-scale matrix completion.
“Non-linear programming via penalty functions,”
Willard I Zangwill, · 1967
Earlier work this paper cites.
“Perturbation bounds in connection with singular value decomposition,”
Per-Åke Wedin, · 1972
Earlier work this paper cites.
“Analysis of an approximate gradient projection method with applications to the backpropagation algorithm,”
Zhi-Quan Luo and Paul Tseng, · 1994
Earlier work this paper cites.
“Perturbation theory for the singular value decomposition,”
Gilbert W Stewart, · 1998
Earlier work this paper cites.
“Nonlinear programming,”
Dimitri P Bertsekas, · 1999
Earlier work this paper cites.
“On the convergence of the block nonlinear gauss–seidel method under convex constraints,”
Luigi Grippo and Marco Sciandrone, · 2000
Earlier work this paper cites.
“Gradient convergence in gradient methods with errors,”
Dimitri P Bertsekas and John N Tsitsiklis, · 2000
Earlier work this paper cites.
“Convergence of a block coordinate descent method for nondifferentiable minimization,”
Paul Tseng, · 2001
Earlier work this paper cites.
“Recovering the missing components in a large noisy low-rank matrix: Application to SFM,”
Pei Chen and David Suter, · 2004
Earlier work this paper cites.
“Spectral techniques applied to sparse random graphs,”
Uriel Feige and Eran Ofek, · 2005
Earlier work this paper cites.
“Major components of the gravity recommendation system,”
Gábor Takács, István Pilászy, Bottyán Németh, and Domonkos Tikk, · 2007
Earlier work this paper cites.
“Improving regularized singular value decomposition for collaborative filtering,”
Arkadiusz Paterek, · 2007
Earlier work this paper cites.
“A unified view of matrix factorization models,”
Ajit P Singh and Geoffrey J Gordon, · 2008
Earlier work this paper cites.
“Large-scale parallel collaborative filtering for the netflix prize,”
Yunhong Zhou, Dennis Wilkinson, Robert Schreiber, and Rong Pan, · 2008
Earlier work this paper cites.
“Matrix factorization techniques for recommender systems,”
Yehuda Koren, Robert Bell, and Chris Volinsky, · 2009
Earlier work this paper cites.
“Interior-point method for nuclear norm approximation with application to system identification,”
Zhang Liu and Lieven Vandenberghe, · 2009
Earlier work this paper cites.
“Exact matrix completion via convex optimization,”
Emmanuel J Candès and Benjamin Recht, · 2009
Earlier work this paper cites.
“Quantum state tomography via compressed sensing,”
David Gross, Yi-Kai Liu, Steven T Flammia, Stephen Becker, and Jens Eisert, · 2009
Earlier work this paper cites.
“The power of convex relaxation: Near-optimal matrix completion,”
Emmanuel J Candès and Terence Tao, · 2010
Earlier work this paper cites.
“Matrix completion with noise,”
Emmanuel J Candès and Yaniv Plan, · 2010
Earlier work this paper cites.
“A singular value thresholding algorithm for matrix completion,”
Jian-Feng Cai, Emmanuel J Candès, and Zuowei Shen, · 2010
Earlier work this paper cites.
“An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems,”
Kim-Chuan Toh and Sangwoon Yun, · 2010
Cited alongside, same era.
“Fast als-based matrix factorization for explicit and implicit feedback datasets,”
István Pilászy, Dávid Zibriczky, and Domonkos Tikk, · 2010
Cited alongside, same era.
“Matrix completion from a few entries,”
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh, · 2010
Cited alongside, same era.
“Recovering low-rank matrices from few coefficients in any basis,”
David Gross, · 2011
Cited alongside, same era.
“A simpler approach to matrix completion,”
Benjamin Recht, · 2011
Cited alongside, same era.
“Fixed point and bregman iterative methods for matrix rank minimization,”
Shiqian Ma, Donald Goldfarb, and Lifeng Chen, · 2011
“A unified convergence analysis of block successive minimization methods for nonsmooth optimization,”
Meisam Razaviyayn, Mingyi Hong, and Zhi-Quan Luo, · 2013
Later among the works it cites.
“Joint base station clustering and beamformer design for partial coordinated transmission in heterogeneous networks,”
Mingyi Hong, Ruoyu Sun, H. Baligh, and Zhi-Quan Luo, · 2013
Later among the works it cites.
“Understanding alternating minimization for matrix completion,”
Moritz Hardt, · 2014
Closest in time.
“Fast matrix completion without the condition number,”
Moritz Hardt and Mary Wootters, · 2014
Closest in time.
“Phase retrieval via wirtinger flow: Theory and algorithms,”
Emmanuel Candès, Xiaodong Li, and Mahdi Soltanolkotabi, · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Large-scale matrix factorization with distributed stochastic gradient descent,”
Rainer Gemulla, Erik Nijkamp, Peter J Haas, and Yannis Sismanis, · 2011
Cited alongside, same era.
“Restricted strong convexity and weighted matrix completion: Optimal bounds with noise,”
Sahand Negahban and Martin J Wainwright, · 2012
Cited alongside, same era.
“Fast global convergence of gradient methods for high-dimensional statistical recovery,”
Alekh Agarwal, Sahand Negahban, and Martin Jordan Wainwright, · 2012
Cited alongside, same era.
Efficient algorithms for collaborative filtering
Hulikal Keshavan, · 2012
Cited alongside, same era.
“Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm,”
Zaiwen Wen, Wotao Yin, and Yin Zhang, · 2012
Cited alongside, same era.
“Scalable coordinate descent approaches to parallel matrix factorization for recommender systems.,”
Hsiang-Fu Yu, Cho-Jui Hsieh, Si Si, and Inderjit S Dhillon, · 2012
Cited alongside, same era.
Prateek Jain and Praneeth Netrapalli, · 2014
Closest in time.
“Global convergence of stochastic gradient descent for some nonconvex matrix problems,”
Christopher De Sa, Kunle Olukotun, and Christopher Ré, · 2014
Closest in time.
“Strong oracle optimality of folded concave penalized estimation,”
Jianqing Fan, Lingzhou Xue, and Hui Zou, · 2014
Closest in time.
“Nonconvex statistical optimization: Minimax-optimal sparse pca in polynomial time,”
Zhaoran Wang, Huanran Lu, and Han Liu, · 2014
Closest in time.
“Non-convex robust pca,”
Praneeth Netrapalli, UN Niranjan, Sujay Sanghavi, Animashree Anandkumar, and Prateek Jain, · 2014
Closest in time.
“Statistical guarantees for the EM algorithm: From population to sample-based analysis,”
Sivaraman Balakrishnan, Martin Wainwright, and Bin Yu, · 2014
Closest in time.
Zhaoran Wang, Quanquan Gu, Yang Ning, and Han Liu, · 2014
Closest in time.
“Coherent matrix completion,”
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, and Rachel Ward, · 2014
Closest in time.
“Universal matrix completion,”
Srinadh Bhojanapalli and Prateek Jain, · 2014
Closest in time.
“Cross-layer provision of future cellular networks: A WMMSE-based approach,”
Hadi Baligh, Mingyi Hong, Wei-Cheng Liao, Zhi-Quan Luo, Meisam Razaviyayn, Maziar Sanjabi, and Ruoyu Sun, · 2014
Closest in time.
“Matrix completion and low-rank svd via fast alternating least squares,”
Trevor Hastie, Rahul Mazumder, Jason Lee, and Reza Zadeh, · 2014
Closest in time.
Matrix Completion via Nonconvex Factorization: Algorithms and Theory
Ruoyu Sun, · 2015
Closest in time.
“Improved iteration complexity bounds of cyclic block coordinate descent for convex problems,”
Ruoyu Sun and Mingyi Hong, · 2015
Closest in time.
“On the expected convergence of randomly permuted ADMM,”
Ruoyu Sun, Zhi-Quan Luo, and Yinyu Ye, · 2015
Closest in time.
“Worst-case complexity of cyclic coordinate descent: O
Ruoyu Sun and Yinyu Ye, · 2016
Closest in time.