Nonconvex Low Rank Matrix Factorization via Inexact First Order Oracle
暂无分享,去创建一个
[1] Xiaotong Shen,et al. Personalized Prediction and Sparsity Pursuit in Latent Factor Models , 2016 .
[2] Anastasios Kyrillidis,et al. Dropping Convexity for Faster Semi-definite Optimization , 2015, COLT.
[3] Max Simchowitz,et al. Low-rank Solutions of Linear Matrix Equations via Procrustes Flow , 2015, ICML.
[4] Martin J. Wainwright,et al. Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees , 2015, ArXiv.
[5] John D. Lafferty,et al. A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements , 2015, NIPS.
[6] Sanjeev Arora,et al. Simple, Efficient, and Neural Algorithms for Sparse Coding , 2015, COLT.
[7] Zhi-Quan Luo,et al. Guaranteed Matrix Completion via Non-Convex Factorization , 2014, IEEE Transactions on Information Theory.
[8] Prateek Jain,et al. Fast Exact Matrix Completion with Finite Samples , 2014, COLT.
[9] Trevor J. Hastie,et al. Matrix completion and low-rank SVD via fast alternating least squares , 2014, J. Mach. Learn. Res..
[10] Xiaodong Li,et al. Phase Retrieval via Wirtinger Flow: Theory and Algorithms , 2014, IEEE Transactions on Information Theory.
[11] Jieping Ye,et al. Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion , 2014, SIAM J. Sci. Comput..
[12] Yudong Chen,et al. Incoherence-Optimal Matrix Completion , 2013, IEEE Transactions on Information Theory.
[13] Jieping Ye,et al. Simultaneous pursuit of sparseness and rank structures for matrix decomposition , 2015, J. Mach. Learn. Res..
[14] Martin J. Wainwright,et al. Statistical guarantees for the EM algorithm: From population to sample-based analysis , 2014, ArXiv.
[15] Yurii Nesterov,et al. First-order methods of smooth convex optimization with inexact oracle , 2013, Mathematical Programming.
[16] Peder A. Olsen,et al. Nuclear Norm Minimization via Active Subspace Selection , 2014, ICML.
[17] Mary Wootters,et al. Fast matrix completion without the condition number , 2014, COLT.
[18] Prasad Raghavendra,et al. Computational Limits for Matrix Completion , 2014, COLT.
[19] Moritz Hardt,et al. Understanding Alternating Minimization for Matrix Completion , 2013, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[20] Yudong Chen,et al. Coherent Matrix Completion , 2013, ICML.
[21] Anru Zhang,et al. ROP: Matrix Recovery via Rank-One Projections , 2013, ArXiv.
[22] Chih-Jen Lin,et al. A fast parallel SGD for matrix factorization in shared memory systems , 2013, RecSys.
[23] Christopher Ré,et al. Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Mathematical Programming Computation.
[24] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[25] Ali Jalali,et al. Low-Rank Matrix Recovery From Errors and Erasures , 2013, IEEE Transactions on Information Theory.
[26] Jieping Ye,et al. Optimal exact least squares rank minimization , 2012, KDD.
[27] Mark W. Schmidt,et al. Hybrid Deterministic-Stochastic Methods for Data Fitting , 2011, SIAM J. Sci. Comput..
[28] Martin J. Wainwright,et al. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise , 2010, J. Mach. Learn. Res..
[29] Sham M. Kakade,et al. Robust Matrix Decomposition With Sparse Corruptions , 2011, IEEE Transactions on Information Theory.
[30] Jiayu Zhou,et al. Integrating low-rank and group-sparse structures for robust multi-task learning , 2011, KDD.
[31] Peter J. Haas,et al. Large-scale matrix factorization with distributed stochastic gradient descent , 2011, KDD.
[32] Martin J. Wainwright,et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.
[33] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[34] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[35] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..
[36] V. Koltchinskii,et al. Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.
[37] A. Tsybakov,et al. Estimation of high-dimensional low-rank matrices , 2009, 0912.5338.
[38] Martin J. Wainwright,et al. Estimation of (near) low-rank matrices with noise and high-dimensional scaling , 2009, ICML.
[39] Inderjit S. Dhillon,et al. Guaranteed Rank Minimization via Singular Value Projection , 2009, NIPS.
[40] Andrea Montanari,et al. Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..
[41] Yoram Bresler,et al. ADMiRA: Atomic Decomposition for Minimum Rank Approximation , 2009, IEEE Transactions on Information Theory.
[42] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[43] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[44] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[45] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[46] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[47] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[48] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[49] M. Baes. Estimate sequence methods: extensions and approximations , 2009 .
[50] Yehuda Koren,et al. The BellKor Solution to the Netflix Grand Prize , 2009 .
[51] A. d’Aspremont. Smooth Optimization with Approximate Gradient , 2005, SIAM J. Optim..
[52] Domonkos Tikk,et al. Major components of the gravity recommendation system , 2007, SKDD.
[53] Arkadiusz Paterek,et al. Improving regularized singular value decomposition for collaborative filtering , 2007 .
[54] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[55] D. Bertsekas,et al. Convergen e Rate of In remental Subgradient Algorithms , 2000 .
[56] Z.-Q. Luo,et al. Error bounds and convergence analysis of feasible descent methods: a general approach , 1993, Ann. Oper. Res..
[57] Osman Güler,et al. New Proximal Point Algorithms for Convex Minimization , 1992, SIAM J. Optim..