Generalization Ability of Wide Residual Networks

Jianfa Lai, Zixiong Yu, Songtao Tian, Qian Lin
5/29/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

In this paper, we study the generalization ability of the wide residual network on $\mathbb{S}^{d-1}$ with the ReLU activation function. We first show that as the width $m\rightarrow\infty$, the residual network kernel (RNK) uniformly converges to the residual neural tangent kernel (RNTK). This uniform convergence further guarantees that the generalization error of the residual network converges to that of the kernel regression with respect to the RNTK. As direct corollaries, we then show $i)$ the wide residual network with the early stopping strategy can achieve the minimax rate provided that the target regression function falls in the reproducing kernel Hilbert space (RKHS) associated with the RNTK; $ii)$ the wide residual network can not generalize well if it is trained till overfitting the data. We finally illustrate some experiments to reconcile the contradiction between our theoretical result and the widely observed ``benign overfitting phenomenon''

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lai2023generalization,
  title  = {Generalization Ability of Wide Residual Networks},
  author = {Jianfa Lai and Zixiong Yu and Songtao Tian and Qian Lin},
  year   = {2023},
  eprint = {2305.18506},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.18506v1}
}

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/2305.18506.svg)](https://codeofpaper.com/paper/2305.18506)

Discussion