Width and Depth Limits Commute in Residual Networks

Soufiane Hayou, Greg Yang
2/1/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

We show that taking the width and depth to infinity in a deep neural network with skip connections, when branches are scaled by $1/\sqrt{depth}$ (the only nontrivial scaling), result in the same covariance structure no matter how that limit is taken. This explains why the standard infinite-width-then-depth approach provides practical insights even for networks with depth of the same order as width. We also demonstrate that the pre-activations, in this case, have Gaussian distributions which has direct applications in Bayesian deep learning. We conduct extensive simulations that show an excellent match with our theoretical findings.

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{hayou2023width,
  title  = {Width and Depth Limits Commute in Residual Networks},
  author = {Soufiane Hayou and Greg Yang},
  year   = {2023},
  eprint = {2302.00453},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.00453v2},
  journal = {ICML 2023 2023}
}

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

Discussion