paper-with-me

홈 › Papers

Spectral Analysis of the Neural Tangent Kernel for Deep Residual Networks

2021-04-07 · Yuval Belfer, Amnon Geifman, Meirav Galun, Ronen Basri

Deep residual network architectures have been shown to achieve superior accuracy over classical feed-forward networks, yet their success is still not fully understood. Focusing on massively over-parameterized, fully connected residual networks with ReLU activation through their respective neural tangent kernels (ResNTK), we provide here a spectral analysis of these kernels. Specifically, we show that, much like NTK for fully connected networks (FC-NTK), for input distributed uniformly on the hypersphere $\mathbb{S}^{d-1}$, the eigenfunctions of ResNTK are the spherical harmonics and the eigenvalues decay polynomially with frequency $k$ as $k^{-d}$. These in turn imply that the set of functions in their Reproducing Kernel Hilbert Space are identical to those of FC-NTK, and consequently also to those of the Laplace kernel. We further show, by drawing on the analogy to the Laplace kernel, that depending on the choice of a hyper-parameter that balances between the skip and residual connections ResNTK can either become spiky with depth, as with FC-NTK, or maintain a stable shape.

📄 PDF Abstract BibTeX arXiv:2104.03093

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

NTK 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Mathematical Foundations of Neural Tangents and Infinite-Width Networks

2025-12-09 · Rachana Mysore, Preksha Girish, Kavitha Jayaram, Shrey Kumar 외 arxiv

We investigate the mathematical foundations of neural networks in the infinite-width regime through the Neural Tangent Kernel (NTK). We propose the NTK-Eigenvalue-Controlled Residual Network (NTK-ECRN), an architecture i…

Topological Neural Tangent Kernel

2026-05-01 · Sanjukta Krishnagopal arxiv

Graph neural tangent kernels give a principled infinite-width theory for graph neural networks, but inherit a basic limitation of graph models: they see only pairwise structure. Many relational systems contain higher-ord…

Link Prediction

Spectral Analysis of Hard-Constraint PINNs: The Spatial Modulation Mechanism of Boundary Functions

2025-12-29 · Yuchen Xie, Honghang Chi, Haopeng Quan, Yahui Wang 외 arxiv

Physics-Informed Neural Networks with hard constraints (HC-PINNs) are increasingly favored for their ability to strictly enforce boundary conditions via a trial function ansatz $\tilde{u} = A + B \cdot N$, yet the theore…

Neural tangent kernel analysis of PINN for advection-diffusion equation

2022-11-21 · M. H. Saadat, B. Gjorgiev, L. Das, G. Sansavini

Physics-informed neural networks (PINNs) numerically approximate the solution of a partial differential equation (PDE) by incorporating the residual of the PDE along with its initial/boundary conditions into the loss fun…

A Kernel Perspective of Skip Connections in Convolutional Networks

2022-11-27 · Daniel Barzilai, Amnon Geifman, Meirav Galun, Ronen Basri

Over-parameterized residual networks (ResNets) are amongst the most successful convolutional neural architectures for image processing. Here we study their properties through their Gaussian Process and Neural Tangent ker…