Divide-and-Conquer Matrix Factorization
暂无分享,去创建一个
Ameet Talwalkar | Michael I. Jordan | Lester W. Mackey | Ameet S. Talwalkar | Lester W. Mackey | Ameet Talwalkar
[1] E. Nyström. Über Die Praktische Auflösung von Integralgleichungen mit Anwendungen auf Randwertaufgaben , 1930 .
[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[3] C. Stein. A bound for the error in the normal approximation to the distribution of a sum of dependent random variables , 1972 .
[4] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[5] N. Fisher,et al. Probability Inequalities for Sums of Bounded Random Variables , 1994 .
[6] S. Goreinov,et al. A Theory of Pseudoskeleton Approximations , 1997 .
[7] Santosh S. Vempala,et al. Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.
[8] Christopher K. I. Williams,et al. Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.
[9] 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).
[10] Rudolf Ahlswede,et al. Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.
[11] Alan M. Frieze,et al. Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.
[12] Qi Tian,et al. Statistical modeling of complex backgrounds for foreground object detection , 2004, IEEE Transactions on Image Processing.
[13] Peter D. Hoff,et al. Bilinear Mixed-Effects Models for Dyadic Data , 2005 .
[14] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix , 2006, SIAM J. Comput..
[15] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication , 2006, SIAM J. Comput..
[16] Abhinandan Das,et al. Google news personalization: scalable online collaborative filtering , 2007, WWW '07.
[17] Arkadi Nemirovski,et al. Sums of random symmetric matrices and quadratic optimization under orthogonality constraints , 2007, Math. Program..
[18] Richard H. Liang. Stein ’ s method for concentration inequalities , 2007 .
[19] Dennis M. Wilkinson,et al. Large-Scale Parallel Collaborative Filtering for the Netflix Prize , 2008, AAIM.
[20] S. Muthukrishnan,et al. Relative-Error CUR Matrix Decompositions , 2007, SIAM J. Matrix Anal. Appl..
[21] Klas Markström,et al. Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales , 2008, Random Struct. Algorithms.
[22] Mark Tygert,et al. A Randomized Algorithm for Principal Component Analysis , 2008, SIAM J. Matrix Anal. Appl..
[23] S. Zucker,et al. Accelerated dense random projections , 2009 .
[24] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..
[25] A. Willsky,et al. Sparse and low-rank matrix decompositions , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[26] S. Yun,et al. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems , 2009 .
[27] S. Yun,et al. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems , 2009 .
[28] Andrea Montanari,et al. Matrix Completion from Noisy Entries , 2009, J. Mach. Learn. Res..
[29] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[30] Ameet Talwalkar,et al. Ensemble Nystrom Method , 2009, NIPS.
[31] Zhouchen Lin,et al. Kernel Nyström method for light transport , 2009, ACM Trans. Graph..
[32] Ameet Talwalkar,et al. On sampling-based approximate spectral decomposition , 2009, ICML '09.
[33] Arvind Ganesh,et al. Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix , 2009 .
[34] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[35] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[36] Yong Yu,et al. Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.
[37] Ameet Talwalkar,et al. Matrix Coherence and the Nystrom Method , 2010, UAI.
[38] John Wright,et al. RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[39] R. Oliveira. Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges , 2009, 0911.0600.
[40] Pablo A. Parrilo,et al. Latent variable graphical model selection via convex optimization , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[41] Yi Ma,et al. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.
[42] John Wright,et al. Decomposing background topics from keywords by principal component pursuit , 2010, CIKM.
[43] Xiaodong Li,et al. Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.
[44] Vincent Nesme,et al. Note on sampling without replacing from a finite collection of matrices , 2010, ArXiv.
[45] Emmanuel J. Candès,et al. Matrix Completion With Noise , 2009, Proceedings of the IEEE.
[46] A. Willsky,et al. Latent variable graphical model selection via convex optimization , 2010 .
[47] Ruslan Salakhutdinov,et al. Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm , 2010, NIPS.
[48] Sham M. Kakade,et al. Dimension-free tail inequalities for sums of random matrices , 2011, ArXiv.
[49] Constantine Caramanis,et al. Robust Matrix Completion and Corrupted Columns , 2011, ICML.
[50] Ameet Talwalkar,et al. Can matrix coherence be efficiently and accurately estimated? , 2011, AISTATS.
[51] Shuen Cheung,et al. Chance – Constrained Linear Matrix Inequalities with Dependent Perturbations : A Safe Tractable Approximation Approach ∗ Sin – , 2011 .
[52] Martin J. Wainwright,et al. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions , 2011, ICML.
[53] Jian Dong,et al. Accelerated low-rank visual recovery by random projection , 2011, CVPR 2011.
[54] Stephen J. Wright,et al. Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent , 2011, NIPS.
[55] Shiqian Ma,et al. Fixed point and Bregman iterative methods for matrix rank minimization , 2009, Math. Program..
[56] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[57] Anthony Man-Cho So,et al. Moment inequalities for sums of random matrices and their applications in optimization , 2011, Math. Program..
[58] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[59] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[60] Peter J. Haas,et al. Large-scale matrix factorization with distributed stochastic gradient descent , 2011, KDD.
[61] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[62] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[63] Daniel J. Hsu,et al. Tail inequalities for sums of random matrices that depend on the intrinsic dimension , 2012 .
[64] Liva Ralaivola,et al. Confusion Matrix Stability Bounds for Multiclass Classification , 2012, ArXiv.
[65] Martin J. Wainwright,et al. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise , 2010, J. Mach. Learn. Res..
[66] Inderjit S. Dhillon,et al. Scalable Coordinate Descent Approaches to Parallel Matrix Factorization for Recommender Systems , 2012, 2012 IEEE 12th International Conference on Data Mining.
[67] Ameet Talwalkar,et al. Distributed Low-Rank Subspace Segmentation , 2013, 2013 IEEE International Conference on Computer Vision.
[68] G. Sapiro,et al. A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.
[69] Christopher Ré,et al. Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Math. Program. Comput..
[70] Anirban Dasgupta,et al. Aggregating crowdsourced binary ratings , 2013, WWW.