Fetching the paper…
Reading the bibliography…
Kernel methods provide an elegant and principled approach to nonparametric learning, but so far could hardly be used in large scale problems, since na\"ive implementations scale poorly with data size.
Sous-espaces hilbertiens d’espaces vectoriels topologiques et noyaux associés (noyaux reproduisants)
Laurent Schwartz · 1964
Earlier work this paper cites.
A correspondence between bayesian estimation on stochastic processes and smoothing by splines
George S. Kimeldorf and Grace Wahba · 1970
Earlier work this paper cites.
Sparse greedy matrix approximation for machine learning
Alex J. Smola and Bernhard Schökopf · 2000
Earlier work this paper cites.
On the mathematical foundations of learning
Felipe Cucker and Steve Smale · 2001
Earlier work this paper cites.
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Bernhard Schölkopf and Alexander J. Smola · 2001
Earlier work this paper cites.
A generalized representer theorem
Bernhard Schölkopf, Ralf Herbrich, and Alexander J. Smola · 2001
Earlier work this paper cites.
Using the nyström method to speed up kernel machines
Christopher K. I. Williams and Matthias Seeger · 2001
Earlier work this paper cites.
Iterative methods for sparse linear systems , volume 82
Yousef Saad · 2003
Earlier work this paper cites.
Kernel methods for pattern analysis
John Shawe-Taylor, Nello Cristianini, et al · 2004
Earlier work this paper cites.
On the nyström method for approximating a Gram matrix for improved kernel-based learning
Petros Drineas and Michael W. Mahoney · 2005
Earlier work this paper cites.
Gaussian Processes for Machine Learning
Carl Edwards Rasmussen and Christopher K. I. Williams · 2006
Earlier work this paper cites.
Optimal rates for the regularized least-squares algorithm
A. Caponnetto and Ernesto De Vito · 2007
Earlier work this paper cites.
Fast support vector machine training and classification on graphics processors
Bryan Catanzaro, Narayanan Sundaram, and Kurt Keutzer · 2008
Earlier work this paper cites.
Random features for large-scale kernel machines
Ali Rahimi and Benjamin Recht · 2008
Earlier work this paper cites.
Support vector machines
Ingo Steinwart and Andreas Christmann · 2008
Earlier work this paper cites.
Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning
Ali Rahimi and Benjamin Recht · 2009
Earlier work this paper cites.
Optimal rates for regularized least squares regression
Ingo Steinwart, Don Hush, and Clint Scovel · 2009
Earlier work this paper cites.
A scalable high performant Cholesky factorization for multicore with GPU accelerators
Hatem Ltaief, Stanimire Tomov, Rajib Nath, Peng Du, and Jack Dongarra · 2011
Earlier work this paper cites.
Sampling methods for the nyström method
Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar · 2012
Earlier work this paper cites.
Nyström method vs random fourier features: A theoretical and empirical comparison
Tianbao Yang, Yu-Feng Li, Mehrdad Mahdavi, Rong Jin, and Zhi-Hua Zhou · 2012
Earlier work this paper cites.
Sharp analysis of low-rank kernel matrix approximations
Francis Bach · 2013
Cited alongside, same era.
Deep Gaussian processes
Andreas Damianou and Neil Lawrence · 2013
Cited alongside, same era.
Gaussian processes for big data
James Hensman, Nicolò Fusi, and Neil D. Lawrence · 2013
Cited alongside, same era.
Fastfood: Approximating kernel expansions in loglinear time
Quoc Le, Tamás Sarlós, and Alex Smola · 2013
Cited alongside, same era.
The CUDA handbook: A comprehensive guide to GPU programming
Nicholas Wilt · 2013
Cited alongside, same era.
Scalable kernel methods via doubly stochastic gradients
Bo Dai, Bo Xie, Niao He, Yingyu Liang, Anant Raj, Maria-Florina F. Balcan, and Le Song · 2014
Cited alongside, same era.
Diving into the shallows: a computational perspective on large-scale shallow learning
Siyuan Ma and Mikhail Belkin · 2017
Later among the works it cites.
Asynchronous distributed variational gaussian process for regression
Hao Peng, Shandian Zhe, Xiao Zhang, and Yuan Qi · 2017
Later among the works it cites.
Generalization properties of learning with random features
Alessandro Rudi and Lorenzo Rosasco · 2017
Later among the works it cites.
FALKON: An optimal large scale kernel method
Alessandro Rudi, Luigi Carratino, and Lorenzo Rosasco · 2017
Later among the works it cites.
liquidSVM: A fast and versatile SVM package, 2017
Ingo Steinward and P. Thomann · 2017
Later among the works it cites.
Statistical and computational trade-offs in kernel k-means
Daniele Calandriello and Lorenzo Rosasco · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
TensorFlow: Large-scale machine learning on heterogeneous systems, 2015
Martín Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dandelion Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, Mike Schuster, Jonathon Shlens, Benoit Steiner, Ilya Sutskever, Kunal Talwar, Paul Tucker, Vincent Vanhoucke, Vijay Vasudevan, Fernanda Viégas, Oriol Vinyals, Pete Warden, Martin Wattenberg, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng · 2015
Cited alongside, same era.
Acceleration of GPU-based Krylov solvers via data transfer reduction
Hartwig Anzt, Stanimire Tomov, Piotr Luszczek, William Sawyer, and Jack Dongarra · 2015
Cited alongside, same era.
Scalable variational Gaussian process classification
James Hensman, Alexander G. Matthews, and Zoubin Ghahramani · 2015
Cited alongside, same era.
Less is more: Nyström computational regularization
Alessandro Rudi, Raffaello Camoriano, and Lorenzo Rosasco · 2015
Cited alongside, same era.
Kernel interpolation for scalable structured Gaussian processes (KISS-GP)
Andrew G. Wilson and Hannes Nickisch · 2015
Cited alongside, same era.
Scalable gaussian processes with billions of inducing inputs via tensor train decomposition
Pavel Izmailov, Alexander Novikov, and Dmitry Kropotov · 2018
Later among the works it cites.
Neural tangent kernel: Convergence and generalization in neural networks
Arthur Jacot, Franck Gabriel, and Clément Hongler · 2018
Later among the works it cites.
But how does it work in theory? linear SVM with random features
Yitong Sun, Anna Gilbert, and Ambuj Tewari · 2018
Later among the works it cites.
Efficient and principled score estimation with nyström kernel exponential families
Dougal Sutherland, Heiko Strathmann, Michael Arbel, and Arthur Gretton · 2018
Later among the works it cites.
ThunderSVM: A fast SVM library on GPUs and CPUs
Zeyi Wen, Jiashuai Shi, Qinbin Li, Bingsheng He, and Jian Chen · 2018
Later among the works it cites.
A heterogeneous parallel cholesky block factorization algorithm
R. Wu · 2018
Later among the works it cites.
Towards a unified analysis of random Fourier features
Zhu Li, Jean-Francois Ton, Dino Oglic, and Dino Sejdinovic · 2019
Later among the works it cites.
Kernel machines that adapt to GPUs for effective large batch training
Siyuan Ma and Mikhail Belkin · 2019
Later among the works it cites.
PyTorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Later among the works it cites.
Exact Gaussian processes on a million data points
Ke Wang, Geoff Pleiss, Jacob Gardner, Stephen Tyree, Kilian Q Weinberger, and Andrew Gordon Wilson · 2019
Later among the works it cites.
KeOps, 2020
Benjamin Charlier, Jean Feydy, Joan Alexis Glaunès, and Ghislain Durif · 2020
Closest in time.
Gain with no pain: Efficient kernel-PCA by nyström sampling
Nicholas Sterge, Bharath Sriperumbudur, Lorenzo Rosasco, and Alessandro Rudi · 2020
Closest in time.
A framework for interdomain and multioutput Gaussian processes, 2020
Mark van der Wilk, Vincent Dutordoir, S. T. John, Artem Artemev, Vincent Adam, and James Hensman · 2020
Closest in time.