Fetching the paper…
Reading the bibliography…
If learning methods are to scale to the massive sizes of modern datasets, it is essential for the field of machine learning to embrace parallel and distributed computing.
Über die praktische auflösung von integralgleichungen mit anwendungen auf randwertaufgaben
E. J. Nyström · 1930
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
W. B. Johnson and J. Lindenstrauss · 1984
Earlier work this paper cites.
A theory of pseudoskeleton approximations
S. A. Goreinov, E. E. Tyrtyshnikov, and N. L. Zamarashkin · 1997
Earlier work this paper cites.
Fast Monte-Carlo algorithms for finding low-rank approximations
A. Frieze, R. Kannan, and S. Vempala · 1998
Earlier work this paper cites.
Latent Semantic Indexing: a probabilistic analysis
C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala · 1998
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
C.K. Williams and M. Seeger · 2000
Earlier work this paper cites.
Bilinear mixed-effects models for dyadic data
P. D. Hoff · 2005
Earlier work this paper cites.
Google news personalization: scalable online collaborative filtering
A. Das, M. Datar, A. Garg, and S. Rajaram · 2007
Earlier work this paper cites.
Relative-error CUR matrix decompositions
P. Drineas, M. W. Mahoney, and S. Muthukrishnan · 2008
Earlier work this paper cites.
Large-scale parallel collaborative filtering for the netflix prize
Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan · 2008
Earlier work this paper cites.
Sparse and low-rank matrix decompositions
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2009
Earlier work this paper cites.
Matrix factorization techniques for recommender systems
Y. Koren, R. M. Bell, and C. Volinsky · 2009
Earlier work this paper cites.
Accelerated dense random projections
E. Liberty · 2009
Earlier work this paper cites.
Cur matrix decompositions for improved data analysis
M. W. Mahoney and P. Drineas · 2009
Cited alongside, same era.
A randomized algorithm for Principal Component Analysis
V. Rokhlin, A. Szlam, and M. Tygert · 2009
Cited alongside, same era.
http://www.mathworks.com/matlabcentral/fileexchange/21524-principal-component-analysis, 2009
M. Tygert · 2009
Cited alongside, same era.
Kernel Nyström method for light transport
J. Wang, Y. Dong, X. Tong, Z. Lin, and B. Guo · 2009
Cited alongside, same era.
Matrix completion with noise
E.J. Candès and Y. Plan · 2010
Cited alongside, same era.
Note on sampling without replacing from a finite collection of matrices
D. Gross and V. Nesme · 2010
Cited alongside, same era.
Robust matrix completion and corrupted columns
Y. Chen, H. Xu, C. Caramanis, and S. Sanghavi · 2011
Closest in time.
Hogwild!: A lock-free approach to parallelizing stochastic gradient descent
B. Recht F. Niu, C. Ré, and S. J. Wright · 2011
Closest in time.
Large-scale matrix factorization with distributed stochastic gradient descent
R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis · 2011
Closest in time.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Closest in time.
Fixed point and bregman iterative methods for matrix rank minimization
S. Ma, D. Goldfarb, and L. Chen · 2011
Closest in time.
Divide-and-conquer matrix factorization
L. Mackey, A. Talwalkar, and M. I. Jordan · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Decomposing background topics from keywords by principal component pursuit
K. Min, Z. Zhang, J. Wright, and Y. Ma · 2010
Cited alongside, same era.
Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images
Y. Peng, A. Ganesh, J. Wright, W. Xu, and Y. Ma · 2010
Cited alongside, same era.
Matrix coherence and the Nyström method
A. Talwalkar and A. Rostamizadeh · 2010
Cited alongside, same era.
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
K. Toh and S. Yun · 2010
Cited alongside, same era.
Stable principal component pursuit
Z. Zhou, X. Li, J. Wright, E. J. Candès, and Y. Ma · 2010
Cited alongside, same era.
Closest in time.
Can matrix coherence be efficiently and accurately estimated?
M. Mohri and A. Talwalkar · 2011
Closest in time.
Accelerated low-rank visual recovery by random projection
Y. Mu, J. Dong, X. Yuan, and S. Yan · 2011
Closest in time.
Simpler approach to matrix completion
B. Recht · 2011
Closest in time.
Parallel stochastic gradient algorithms for large-scale matrix completion
B. Recht and C. Ré · 2011
Closest in time.
http://www.cs.columbia.edu/~djhsu/papers/randmatrix-errata.txt , 2012
D. Hsu · 2012
Closest in time.
Tail inequalities for sums of random matrices that depend on the intrinsic dimension
D. Hsu, S. Kakade, and T. Zhang · 2012
Closest in time.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban and M. J. Wainwright · 2012
Closest in time.
Scalable coordinate descent approaches to parallel matrix factorization for recommender systems
H.-F. Yu, C.-J. Hsieh, S. Si, and I. Dhillon · 2012
Closest in time.