Understanding Alternating Minimization for Matrix Completion
暂无分享,去创建一个
[1] Chandler Davis. The rotation of eigenvectors by a perturbation , 1963 .
[2] Nicholas J. Higham,et al. INVERSE PROBLEMS NEWSLETTER , 1991 .
[3] G. Stewart. Matrix Algorithms, Volume II: Eigensystems , 2001 .
[4] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[5] D. Spielman,et al. Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices , 2003, SIAM Journal on Matrix Analysis and Applications.
[6] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[7] Yehuda Koren,et al. Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).
[8] Jieping Ye,et al. An accelerated gradient method for trace norm minimization , 2009, ICML '09.
[9] Justin P. Haldar,et al. Rank-Constrained Solutions to Linear Matrix Equations Using PowerFactorization , 2009, IEEE Signal Processing Letters.
[10] Andrea Montanari,et al. Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..
[11] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[12] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[13] Martin Jaggi,et al. A Simple Algorithm for Nuclear Norm Regularized Problems , 2010, ICML.
[14] Robert Tibshirani,et al. Spectral Regularization Algorithms for Learning Large Incomplete Matrices , 2010, J. Mach. Learn. Res..
[15] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[16] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[17] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[18] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[19] Aaron Roth,et al. Beating randomized response on incoherent matrices , 2011, STOC '12.
[20] Elad Hazan,et al. Projection-free Online Learning , 2012, ICML.
[21] Raghunandan H. Keshavan. Efficient algorithms for collaborative filtering , 2012 .
[22] Vikas Sindhwani,et al. Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization , 2012, ICML.
[23] Joydeep Ghosh,et al. Noisy Matrix Completion Using Alternating Minimization , 2013, ECML/PKDD.
[24] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[25] Moritz Hardt. Robust subspace iteration and privacy-preserving spectral analysis , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[26] Christopher Ré,et al. Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Mathematical Programming Computation.
[27] Aaron Roth,et al. Beyond worst-case analysis in private singular vector computation , 2012, STOC '13.
[28] Andrew V. Knyazev,et al. Angles between subspaces and their tangents , 2012, J. Num. Math..
[29] Prasad Raghavendra,et al. Computational Limits for Matrix Completion , 2014, COLT.
[30] Peder A. Olsen,et al. Nuclear Norm Minimization via Active Subspace Selection , 2014, ICML.