On global convergence of ResNets: From finite to infinite width using linear parameterizationDownload PDF

Published: 31 Oct 2022, 18:00, Last Modified: 11 Jan 2023, 10:33NeurIPS 2022 AcceptReaders: Everyone
Keywords: Residual Neural Networks, Neural ODEs, Deep Learning
TL;DR: We show convergence of Gradient Descent for the training of infinitely deep Residual Neural Networks. Our linear parameterization of the residuals allows to bridge the gap between finite- and infinite-width models.
Abstract: Overparameterization is a key factor in the absence of convexity to explain global convergence of gradient descent (GD) for neural networks. Beside the well studied lazy regime, infinite width (mean field) analysis has been developed for shallow networks, using on convex optimization technics. To bridge the gap between the lazy and mean field regimes, we study Residual Networks (ResNets) in which the residual block has linear parameterization while still being nonlinear. Such ResNets admit both infinite depth and width limits, encoding residual blocks in a Reproducing Kernel Hilbert Space (RKHS). In this limit, we prove a local Polyak-Lojasiewicz inequality. Thus, every critical point is a global minimizer and a local convergence result of GD holds, retrieving the lazy regime. In contrast with other mean-field studies, it applies to both parametric and non-parametric cases under an expressivity condition on the residuals. Our analysis leads to a practical and quantified recipe: starting from a universal RKHS, Random Fourier Features are applied to obtain a finite dimensional parameterization satisfying with high-probability our expressivity condition.
Supplementary Material: pdf
17 Replies