暂无分享,去创建一个
Ohad Shamir | Shai Shalev-Shwartz | Alon Gonen | S. Shalev-Shwartz | O. Shamir | Alon Gonen | Ohad Shamir | Shai Shalev-Shwartz
[1] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[2] Henryk Wozniakowski,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992, SIAM J. Matrix Anal. Appl..
[3] J. Kuczy,et al. Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start , 1992 .
[4] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[5] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[6] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[7] Philippe C. Besse,et al. A L 1-norm PCA and a Heuristic Approach , 1996 .
[8] S. Mallat,et al. Adaptive greedy approximations , 1997 .
[9] Peter Filzmoser,et al. Robust Factorization of a Data Matrix , 1998, COMPSTAT.
[10] Stephen P. Boyd,et al. A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).
[11] Noga Alon,et al. Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices , 2004, NIPS.
[12] Takeo Kanade,et al. Robust L/sub 1/ norm factorization in the presence of outliers and missing data by alternative convex programming , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[13] Shimon Ullman,et al. Uncovering shared structures in multiclass classification , 2007, ICML '07.
[14] Elad Hazan,et al. Sparse Approximate Solutions to Semidefinite Programs , 2008, LATIN.
[15] Kenneth L. Clarkson,et al. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm , 2008, SODA '08.
[16] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity , 2008, ArXiv.
[17] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[18] Sewoong Oh,et al. A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion , 2009, ArXiv.
[19] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[20] Pablo A. Parrilo,et al. Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..
[21] Andrea Montanari,et al. Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.
[22] Martin Jaggi,et al. A Simple Algorithm for Nuclear Norm Regularized Problems , 2010, ICML.
[23] Yoram Bresler,et al. ADMiRA: Atomic Decomposition for Minimum Rank Approximation , 2009, IEEE Transactions on Information Theory.
[24] Tong Zhang,et al. Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints , 2010, SIAM J. Optim..
[25] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[26] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[27] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[28] Ohad Shamir,et al. Collaborative Filtering with the Trace Norm: Learning, Bounding, and Transducing , 2011, COLT.
[29] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[30] Guangdong Feng,et al. A Tensor Based Method for Missing Traffic Data Completion , 2013 .