Skip to content
DraconiticResearch
Search Sources API
201,642 studies31 sourcesUpdated 12 min ago
PreprintCC BY 4.0arXiv

The role of locality and weight sharing in convolutional neural networks

Abstract

The success of convolutional neural networks is often attributed to locality and weight sharing. However, how these two properties separately shape learning, and how their effects depend on the spatial correlations of natural images, remain poorly understood. We address these questions in a teacher-student model with a convolutional teacher acting on P input positions with correlation c between positions. We compare convolutional and locally connected students trained by online stochastic gradient descent, and derive ordinary differential equations that describe their dynamics exactly in the limit of large feature dimension D. For uncorrelated positions (c = 0), the two students follow the same learning trajectory, with the convolutional student learning exactly P times faster. We also find that locality affects the sample complexity: a student that matches the kernel size of the teacher recovers it from π’ͺD(D) samples, whereas π’ͺD(Dlog(D)) samples are needed with a larger kernel. For c > 0, spatial correlations can reduce the advantage of weight sharing. The asymptotic error of the convolutional student grows with c, whereas that of the locally connected student is independent of c and overall lower when evaluated at the same learning rate. When the learning rate is instead tuned to the training horizon, however, the locally connected student wins at early times and the convolutional student at late times, with a transition that we predict analytically.

Related

  1. A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay
    Yuqing Wang, Ioannis G. Kevrekidis, Mikhail Belkin
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Estimating "Realized" Skewness using Convolutional Neural Network
    Haozhe Jiang, Ostap Okhrin, Michael Rockinger
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Tight Guarantees for Static Policies in Vehicle Sharing Networks
    Adam N. Elmachtoub, Jiaqi Shi
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Stochastic dynamics generation of directed percolation using a two-channel convolutional neural network
    Feng Gao, Jianmin Shen, Wei Li
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  5. Memorization Capacity of Invariant Convolutional Neural Nets
    Sjoerd Dirksen, Patrick Finke, Paul Geuchen
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{mori2026role,
  title = {{The role of locality and weight sharing in convolutional neural networks}},
  author = {Francesco Mori and Melanie Weber},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30118},
  eprint = {2610.30118},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30118},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - The role of locality and weight sharing in convolutional neural networks
AU  - Francesco Mori
AU  - Melanie Weber
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.30118
UR  - https://arxiv.org/abs/2610.30118
AB  - The success of convolutional neural networks is often attributed to locality and weight sharing. However, how these two properties separately shape learning, and how their effects depend on the spatial correlations of natural images, remain poorly understood. We address these questions in a teacher-student model with a convolutional teacher acting on P input positions with correlation c between positions. We compare convolutional and locally connected students trained by online stochastic gradient descent, and derive ordinary differential equations that describe their dynamics exactly in the limit of large feature dimension D. For uncorrelated positions (c = 0), the two students follow the same learning trajectory, with the convolutional student learning exactly P times faster. We also find that locality affects the sample complexity: a student that matches the kernel size of the teacher recovers it from π’ͺ_D(D) samples, whereas π’ͺ_D(Dlog(D)) samples are needed with a larger kernel. For c > 0, spatial correlations can reduce the advantage of weight sharing. The asymptotic error of the convolutional student grows with c, whereas that of the locally connected student is independent of c and overall lower when evaluated at the same learning rate. When the learning rate is instead tuned to the training horizon, however, the locally connected student wins at early times and the convolutional student at late times, with a transition that we predict analytically.
ER  -