Toward Large Kernel Models
Not on the map. Why?
Abstract (arXiv)
Recent studies indicate that kernel machines can often perform similarly or better than deep neural networks (DNNs) on small datasets. The interest in kernel machines has been additionally bolstered by the discovery of their equivalence to wide neural networks in certain regimes. However, a key feature of DNNs is their ability to scale the model size and training data size independently, whereas in traditional kernel machines model size is tied to data size. Because of this coupling, scaling kernel machines to large data has been computationally challenging. In this paper, we provide a way forward for constructing large-scale general kernel models, which are a generalization of kernel machines that decouples the model and data, allowing training on large datasets. Specifically, we introduce EigenPro 3.0, an algorithm based on projected dual preconditioned SGD and show scaling to model and data sizes which have not been possible with existing kernel methods.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 23 of its 68 references that are in the map. First posted on arXiv 6 Feb 2023.
Builds on
23 of 68 references.
References · 23
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018ESPnet: End-to-End Speech Processing Toolkitcited by 554
- 2017WebVision Database: Visual Learning and Understanding from Web Datacited by 262
- 2015Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)cited by 175
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 156
- 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
- 2016GPflow: A Gaussian process library using TensorFlowcited by 139
- 2020Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Taskscited by 137
- 2020Kernel methods through the roof: handling billions of points efficientlycited by 88
11 more
- 2019Harnessing the Power of Infinitely Wide Deep Nets on Small-data Taskscited by 87
- 2017FALKON: An Optimal Large Scale Kernel Methodcited by 82
- 2019Enhanced Convolutional Neural Tangent Kernelscited by 76
- 2020On the Similarity between the Laplace and Neural Tangent Kernelscited by 76
- 2020Neural Kernels Without Tangentscited by 56
- 2018Product Kernel Interpolation for Scalable Gaussian Processescited by 31
- 2022Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluationscited by 31
- 2017Diving into the shallows: a computational perspective on large-scale shallow learningcited by 30
- 2021Simple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural Networkscited by 17
- 2015NYTRO: When Subsampling Meets Early Stoppingcited by 6
- 2022Transition to Linearity of General Neural Networks with Directed Acyclic Graph Architecturecited by 4
Built on by
Citing papers per year: 2023: 3; 2024: 3; 2025: 5; 2026: 1.
12 papers.
- 2023Estimating Koopman operators with sketching to provably learn large scale dynamical systemscited by 15
- 2025xRFM: Accurate, scalable, and interpretable feature learning models for tabular datacited by 14
- 2023Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learningcited by 7
- 2024Optimal Kernel Quantile Learning with Random Featurescited by 4
- 2023On the Nystrom Approximation for Preconditioning in Kernel Machinescited by 2
- 2024Learning Analysis of Kernel Ridgeless Regression with Asymmetric Kernel Learningcited by 2
- 2024Fast training of large kernel models with delayed projectionscited by 2
- 2025Feature maps for the Laplacian kernel and its generalizationscited by 1
- 2025Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nystr"om Methodcited by 1
- 2025Interpretable Self-Supervised Learning via Representer Landmarks and Nystr"om Approximationcited by 1
- 2025Joker: Joint Optimization Framework for Lightweight Kernel Machinescited by 0
- 2026Scalable Pairwise Kernel Learning with Stochastic Vec Trickcited by 0
- 2026Scalable Pairwise Kernel Learning with Stochastic Vec Trick15 Jun 2026
- 2025Interpretable Self-Supervised Learning via Representer Landmarks and Nystr"om Approximation29 Sep 2025
- 2025xRFM: Accurate, scalable, and interpretable feature learning models for tabular data12 Aug 2025
- 2025Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nystr"om Method21 Jun 2025
- 2025Joker: Joint Optimization Framework for Lightweight Kernel Machines23 May 2025
- 2025Feature maps for the Laplacian kernel and its generalizations21 Feb 2025
- 2024Fast training of large kernel models with delayed projections25 Nov 2024
- 2024Optimal Kernel Quantile Learning with Random Features24 Aug 2024
- 2024Learning Analysis of Kernel Ridgeless Regression with Asymmetric Kernel Learning3 Jun 2024
- 2023On the Nystrom Approximation for Preconditioning in Kernel Machines6 Dec 2023
- 2023Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning30 Oct 2023
- 2023Estimating Koopman operators with sketching to provably learn large scale dynamical systems7 Jun 2023