Properties of the After Kernel
Not on the map. Why?
Abstract (arXiv)
The Neural Tangent Kernel (NTK) is the wide-network limit of a kernel defined using neural networks at initialization, whose embedding is the gradient of the output of the network with respect to its parameters. We study the "after kernel", which is defined using the same embedding, except after training, for neural networks with standard architectures, on binary classification problems extracted from MNIST and CIFAR-10, trained using SGD in a standard way. For some dataset-architecture pairs, after a few epochs of neural network training, a hard-margin SVM using the network's after kernel is much more accurate than when the network's initial kernel is used. For networks with an architecture similar to VGG, the after kernel is more "global", in the sense that it is less invariant to transformations of input images that disrupt the global structure of the image while leaving the local statistics largely intact. For fully connected networks, the after kernel is less global in this sense. The after kernel tends to be more invariant to small shifts, rotations and zooms; data augmentation does not improve these invariances. The (finite approximation to the) conjugate kernel, obtained using the last layer of hidden nodes, sometimes, but not always, provides a good approximation to the NTK and the after kernel. Training a network with a larger learning rate (while holding the training error constant) produces a better kernel, as measured by the test error of a hard-margin SVM. The after kernels of networks trained with larger learning rates tend to be more global, and more invariant to small shifts, rotations and zooms.
Key facts. Cited by 27 papers in the map (data through 14 Oct 2026). Builds on 46 of its 63 references that are in the map. First posted on arXiv 21 May 2021.
Builds on
46 of 63 references.
References · 46
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2018Image Transformercited by 772
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 659
34 more
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2020What is being transferred in transfer learning?cited by 368
- 2019Attention Augmented Convolutional Networkscited by 363
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 320
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 222
- 2020The large learning rate phase of deep learning: the catapult mechanismcited by 216
- 2020Feature Learning in Infinite-Width Neural Networkscited by 190
- 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
- 2020When Do Neural Networks Outperform Kernel Methods?cited by 150
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 149
- 2019Neural Tangents: Fast and Easy Infinite Neural Networks in Pythoncited by 149
- 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
- 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
- 2019An Improved Analysis of Training Over-parameterized Deep Neural Networkscited by 121
- 2019Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networkscited by 121
- 2019On the Power and Limitations of Random Features for Understanding Neural Networkscited by 103
- 2019Are All Layers Created Equal?cited by 94
- 2019What Can ResNet Learn Efficiently, Going Beyond Kernels?cited by 91
- 2019How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?cited by 84
- 2020Learning Parities with Neural Networkscited by 78
- 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
- 2019Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Modelscited by 53
- 2019Identity Crisis: Memorization and Generalization under Extreme Overparameterizationcited by 33
- 2021When does gradient descent with logistic loss interpolate using deep networks with smoothed ReLU activations?cited by 9
Built on by
Citing papers per year: 2021: 2; 2022: 13; 2023: 6; 2024: 4; 2025: 1; 2026: 1.
27 papers.
Sort:
By area:
- 2023TRAK: Attributing Model Behavior at Scalecited by 283
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2022A Framework and Benchmark for Deep Batch Active Learning for Regressioncited by 49
- 2023The Journey, Not the Destination: How Data Guides Diffusion Modelscited by 43
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scalescited by 41
- 2023On the Stepwise Nature of Self-Supervised Learningcited by 36
- 2022Random Feature Amplification: Feature Learning and Generalization in Neural Networkscited by 35
- 2022Limitations of the NTK for Understanding Generalization in Deep Learningcited by 35
- 2021Fast Margin Maximization via Dual Accelerationcited by 33
- 2022Spectral Evolution and Invariance in Linear-width Neural Networkscited by 30
- 2022TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernelscited by 26
- 2022The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimescited by 25
15 more
- 2022Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn featurescited by 25
- 2022What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?cited by 21
- 2022Quadratic models for understanding catapult dynamics of neural networkscited by 17
- 2022Few-shot Backdoor Attacks via Neural Tangent Kernelscited by 15
- 2022Evolution of Neural Tangent Kernels under Benign and Adversarial Trainingcited by 14
- 2026A Defense of the Quadratic Modelcited by 14
- 2023Sample based Explanations via Generalized Representerscited by 10
- 2023Faithful and Efficient Explanations for Neural Networks via Neural Tangent Kernel Surrogate Modelscited by 8
- 2024DAVED: Data Acquisition via Experimental Design for Data Marketscited by 6
- 2022Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decompositioncited by 4
- 2024Three Mechanisms of Feature Learning in a Linear Networkcited by 4
- 2022On Kernel Regression with Data-Dependent Kernelscited by 2
- 2025The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representationscited by 2
- 2021Classification and Adversarial examples in an Overparameterized Linear Model: A Signal Processing Perspectivecited by 1
- 2024Generalization error of spectral algorithmscited by 1
- 2026A Defense of the Quadratic Model23 Jul 2026
- 2025The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representations8 Jul 2025
- 2024DAVED: Data Acquisition via Experimental Design for Data Markets20 Mar 2024
- 2024Generalization error of spectral algorithms18 Mar 2024
- 2024A Dynamical Model of Neural Scaling Laws2 Feb 2024
- 2024Three Mechanisms of Feature Learning in a Linear Network13 Jan 2024
- 2023The Journey, Not the Destination: How Data Guides Diffusion Models11 Dec 2023
- 2023Sample based Explanations via Generalized Representers27 Oct 2023
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scales28 May 2023
- 2023Faithful and Efficient Explanations for Neural Networks via Neural Tangent Kernel Surrogate Models23 May 2023
- 2023On the Stepwise Nature of Self-Supervised Learning27 Mar 2023
- 2023TRAK: Attributing Model Behavior at Scale24 Mar 2023
15 more
- 2022Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features28 Dec 2022
- 2022The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimes23 Dec 2022
- 2022Spectral Evolution and Invariance in Linear-width Neural Networks11 Nov 2022
- 2022Evolution of Neural Tangent Kernels under Benign and Adversarial Training21 Oct 2022
- 2022Few-shot Backdoor Attacks via Neural Tangent Kernels12 Oct 2022
- 2022What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?11 Oct 2022
- 2022Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition1 Oct 2022
- 2022On Kernel Regression with Data-Dependent Kernels4 Sep 2022
- 2022TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernels13 Jul 2022
- 2022Limitations of the NTK for Understanding Generalization in Deep Learning20 Jun 2022
- 2022Quadratic models for understanding catapult dynamics of neural networks24 May 2022
- 2022A Framework and Benchmark for Deep Batch Active Learning for Regression17 Mar 2022
- 2022Random Feature Amplification: Feature Learning and Generalization in Neural Networks15 Feb 2022
- 2021Classification and Adversarial examples in an Overparameterized Linear Model: A Signal Processing Perspective27 Sep 2021
- 2021Fast Margin Maximization via Dual Acceleration1 Jul 2021
- 2023TRAK: Attributing Model Behavior at Scalecited by 283
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2022A Framework and Benchmark for Deep Batch Active Learning for Regressioncited by 49
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scalescited by 41
- 2023On the Stepwise Nature of Self-Supervised Learningcited by 36
- 2022Random Feature Amplification: Feature Learning and Generalization in Neural Networkscited by 35
- 2022Limitations of the NTK for Understanding Generalization in Deep Learningcited by 35
- 2021Fast Margin Maximization via Dual Accelerationcited by 33
- 2022Spectral Evolution and Invariance in Linear-width Neural Networkscited by 30
- 2022TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernelscited by 26
- 2022The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimescited by 25
- 2022Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn featurescited by 25
12 most cited of 26 All 26 (JSON)
- 2026A Defense of the Quadratic Model23 Jul 2026
- 2025The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representations8 Jul 2025
- 2024DAVED: Data Acquisition via Experimental Design for Data Markets20 Mar 2024
- 2024Generalization error of spectral algorithms18 Mar 2024
- 2024A Dynamical Model of Neural Scaling Laws2 Feb 2024
- 2024Three Mechanisms of Feature Learning in a Linear Network13 Jan 2024
- 2023Sample based Explanations via Generalized Representers27 Oct 2023
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scales28 May 2023
- 2023Faithful and Efficient Explanations for Neural Networks via Neural Tangent Kernel Surrogate Models23 May 2023
- 2023On the Stepwise Nature of Self-Supervised Learning27 Mar 2023
- 2023TRAK: Attributing Model Behavior at Scale24 Mar 2023
- 2022Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features28 Dec 2022
12 newest of 26 All 26 (JSON)