mlsanityData to 7 Oct 2026

What Can ResNet Learn Efficiently, Going Beyond Kernels?

arXiv 1905.10337 ↗First posted 24 May 2019cs.LG cs.DS cs.NEcited by 91

Not on the map. Why?

Abstract (arXiv)

How can neural networks such as ResNet efficiently learn CIFAR-10 with test accuracy more than 96%, while other methods, especially kernel methods, fall relatively behind? Can we more provide theoretical justifications for this gap? Recently, there is an influential line of work relating neural networks to kernels in the over-parameterized regime, proving they can learn certain concept class that is also learnable by kernels with similar test error. Yet, can neural networks provably learn some concept class BETTER than kernels? We answer this positively in the distribution-free setting. We prove neural networks can efficiently learn a notable class of functions, including those defined by three-layer residual networks with smooth activations, without any distributional assumption. At the same time, we prove there are simple functions in this class such that with the same number of training examples, the test error obtained by neural networks can be MUCH SMALLER than ANY kernel method, including neural tangent kernels (NTK). The main intuition is that multi-layer neural networks can implicitly perform hierarchical learning using different layers, which reduces the sample complexity comparing to "one-shot" learning algorithms such as kernel methods. In a follow-up work [2], this theory of hierarchical learning is further strengthened to incorporate the "backward feature correction" process when training deep networks. In the end, we also prove a computation complexity advantage of ResNet with respect to other learning methods including linear regression over arbitrary feature mappings.

Key facts. Cited by 91 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 31; 2022: 19; 2023: 19; 2024: 7; 2025: 6; 2026: 9.

91 papers.

Sort:

By area:

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
  3. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
  4. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  5. 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
  6. 2023SGD learning on neural networks: leap complexity and saddle-to-saddle dynamicscited by 142
  7. 2021Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learningcited by 119
  8. 2024Challenges in Training PINNs: A Loss Landscape Perspectivecited by 109
  9. 2023A Theoretical Understanding of Shallow Vision Transformers: Learning, Generalization, and Sample Complexitycited by 77
  10. 2021The staircase property: How hierarchical structure can guide deep learningcited by 62
  11. 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
  12. 2022Towards Understanding Mixture of Experts in Deep Learningcited by 52
38 more
  1. 2021What can linearized neural networks actually say about generalization?cited by 49
  2. 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
  3. 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 48
  4. 2024Neural network learns low-dimensional polynomials with SGD near the information-theoretic limitcited by 45
  5. 2021Quantifying the Benefit of Using Differentiable Learning over Tangent Kernelscited by 41
  6. 2023What can a Single Attention Layer Learn? A Study Through the Random Features Lenscited by 39
  7. 2022The Mechanism of Prediction Head in Non-contrastive Self-supervised Learningcited by 38
  8. 2023Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networkscited by 35
  9. 2022Random Feature Amplification: Feature Learning and Generalization in Neural Networkscited by 33
  10. 2021Properties of the After Kernelcited by 27
  11. 2021On the Power of Differentiable Learning versus PAC and SQ Learningcited by 27
  12. 2023Masked Contrastive Graph Representation Learning for Age Estimationcited by 27
  13. 2022Sample-Then-Optimize Batch Neural Thompson Samplingcited by 25
  14. 2021Overparameterization of deep ResNet: zero loss and mean-field analysiscited by 24
  15. 2021The Limitations of Large Width in Neural Networks: A Deep Gaussian Process Perspectivecited by 21
  16. 2021Understanding Deflation Process in Over-parametrized Tensor Decompositioncited by 20
  17. 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Timecited by 20
  18. 2024A Survey on Statistical Theory of Deep Learning: Approximation, Training Dynamics, and Generative Modelscited by 20
  19. 2021Towards Understanding Learning in Neural Networks with Linear Teacherscited by 19
  20. 2021The Connection Between Approximation, Depth Separation and Learnability in Neural Networkscited by 19
  21. 2021Noether: The More Things Change, the More Stay the Samecited by 19
  22. 2023Six Lectures on Linearized Neural Networkscited by 19
  23. 2023Provable Guarantees for Nonlinear Feature Learning in Three-Layer Neural Networkscited by 18
  24. 2021Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noisecited by 17
  25. 2021Functional Regularization for Reinforcement Learning via Learned Fourier Featurescited by 17
  26. 2022On the non-universality of deep learning: quantifying the cost of symmetrycited by 17
  27. 2021Optimal Gradient-based Algorithms for Non-concave Bandit Optimizationcited by 15
  28. 2021Efficient Online Bayesian Inference for Neural Banditscited by 15
  29. 2022Equivariance and Invariance Inductive Bias for Learning from Insufficient Datacited by 14
  30. 2022Identifying good directions to escape the NTK regime and efficiently learn low-degree plus sparse polynomialscited by 13
  31. 2023Provable Guarantees for Neural Networks via Gradient Feature Learningcited by 13
  32. 2022The Curious Case of Benign Memorizationcited by 11
  33. 2021On the Global Convergence of Gradient Descent for multi-layer ResNets in the mean-field regimecited by 10
  34. 2022Deep Learning meets Nonparametric Regression: Are Weight-Decayed DNNs Locally Adaptive?cited by 10
  35. 2022Excess Risk of Two-Layer ReLU Neural Networks in Teacher-Student Settings and its Superiority to Kernel Methodscited by 10
  36. 2021Going Beyond Linear RL: Sample Efficient Neural Function Approximationcited by 9
  37. 2021On the One-sided Convergence of Adam-type Algorithms in Non-convex Non-concave Min-max Optimizationcited by 9
  38. 2024Feature learning as alignment: a structural property of gradient descent in non-linear neural networkscited by 9

50 most cited of 91 All 91 (JSON)