Pith. sign in

REVIEW 3 cited by

On the Disconnect Between Theory and Practice of Neural Networks: Limits of the NTK Perspective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.00137 v2 pith:EWGC6NNW submitted 2023-09-29 cs.LG stat.ML

classification cs.LGstat.ML
keywords architecturesneuralkernelpracticetheoryalgorithmicbehaviorbenefits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The neural tangent kernel (NTK) has garnered significant attention as a theoretical framework for describing the behavior of large-scale neural networks. Kernel methods are theoretically well-understood and as a result enjoy algorithmic benefits, which can be demonstrated to hold in wide synthetic neural network architectures. These advantages include faster optimization, reliable uncertainty quantification and improved continual learning. However, current results quantifying the rate of convergence to the kernel regime suggest that exploiting these benefits requires architectures that are orders of magnitude wider than they are deep. This assumption raises concerns that architectures used in practice do not exhibit behaviors as predicted by the NTK. Here, we supplement previous work on the NTK by empirically investigating whether the limiting regime predicts practically relevant behavior of large-width architectures. Our results demonstrate that this is not the case across multiple domains. This observed disconnect between theory and practice further calls into question to what degree NTK theory should inform architectural and algorithmic choices.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. To Retain or to Adapt? Generalizing Continual Learning

    stat.ML 2026-07 accept novelty 7.5 of 10

    When retention induces positive stationary bias, historical knowledge becomes an optimization liability beyond a closed-form Critical Task Duration; Predictive CL with finite windows can beat both full Joint-Task and ...

  2. Alignment-Sensitive Minimax Rates for Spectral Algorithms with Learned Kernels

    cs.LG 2025-09 unverdicted novelty 7.0 of 10

    Introduces alignment-sensitive effective span dimension (ESD) for learned-kernel spectral algorithms and proves minimax excess risk bounds of order sigma^2 * ESD, with gradient flow shown to reduce ESD.

  3. Man, Machine, and Mathematics

    math.OC 2026-04 unverdicted novelty 5.0 of 10

    A high-level outline is given for a unified theory that reduces learning to a small set of ideas from dynamical systems, geometry, and physics via definitions of solvable problems and parametrized methods.

Pith tools