Training NTK to Generalize with KARE

Johannes Schwab, Bryan Kelly, Semyon Malamud, Teng Andrea Xu
5/16/2025
cs.LG

No official code found. Best implementation: DjoFE2021/ntk-kare (2 stars, MIT, last commit 2025-05-21). 1 more below.

Abstract

The performance of the data-dependent neural tangent kernel (NTK; Jacot et al. (2018)) associated with a trained deep neural network (DNN) often matches or exceeds that of the full network. This implies that DNN training via gradient descent implicitly performs kernel learning by optimizing the NTK. In this paper, we propose instead to optimize the NTK explicitly. Rather than minimizing empirical risk, we train the NTK to minimize its generalization error using the recently developed Kernel Alignment Risk Estimator (KARE; Jacot et al. (2020)). Our simulations and real data experiments show that NTKs trained with KARE consistently match or significantly outperform the original DNN and the DNN- induced NTK (the after-kernel). These results suggest that explicitly trained kernels can outperform traditional end-to-end DNN optimization in certain settings, challenging the conventional dominance of DNNs. We argue that explicit training of NTK is a form of over-parametrized feature learning.

View on arXivView PDF

Code Implementations(2)

DjoFE2021/ntk-kareCommunity100%
MIT
22Shell, PythonMay 21, 20251 years agoMIT
2025NoName/ntk-kareCommunity100%
MIT
00Shell, PythonMay 15, 20251 years agoMIT

Similar Papers

Cite this paper

@article{schwab2025training,
  title  = {Training NTK to Generalize with KARE},
  author = {Johannes Schwab and Bryan Kelly and Semyon Malamud and Teng Andrea Xu},
  year   = {2025},
  eprint = {2505.11347},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.11347v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.11347.svg)](https://codeofpaper.com/paper/2505.11347)

Discussion