Normalization effects on shallow neural networks and related asymptotic expansions
We consider shallow (single hidden layer) neural networks and characterize their performance when trained with stochastic gradient descent as the number of hidden units $N$ and gradient descent steps grow to infinity. In particular, we investigate the effect of different scaling schemes, which lead to different normalizations of the neural network, on the network's statistical output, closing the gap between the $1/\sqrt{N}$ and the mean-field $1/N$ normalization. We develop an asymptotic expansion for the neural network's statistical output pointwise with respect to the scaling parameter as the number of hidden units grows to infinity. Based on this expansion, we demonstrate mathematically that to leading order in $N$, there is no bias-variance trade off, in that both bias and variance (both explicitly characterized) decrease as the number of hidden units increases and time grows. In addition, we show that to leading order in $N$, the variance of the neural network's statistical output decays as the implied normalization by the scaling parameter approaches the mean field normalization. Numerical studies on the MNIST and CIFAR10 datasets show that test and train accuracy monotonically improve as the neural network's normalization gets closer to the mean field normalization.
Code (1)
Similar Papers 제목 키워드 기반
Local signature-based expansions
We study the local (in time) expansion of a continuous-time process and its conditional moments, including the process' characteristic function. The expansions are conducted by using the properties of the (time-extended)…
EconometricsHigher-order Expansions and Inference for Panel Data Models
In this paper, we propose a simple inferential method for a wide class of panel data models with a focus on such cases that have both serial correlation and cross-sectional dependence. In order to establish an asymptotic…
Optimal investment in illiquid market with search frictions and transaction costs
We consider an optimal investment problem to maximize expected utility of the terminal wealth, in an illiquid market with search frictions and transaction costs. In the market model, an investor's attempt of transaction …
Kernel Normalized Convolutional Networks for Privacy-Preserving Machine Learning
Normalization is an important but understudied challenge in privacy-related application domains such as federated learning (FL), differential privacy (DP), and differentially private federated learning (DP-FL). While the…
Federated LearningPrivacy PreservingAsymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
Laplacian matrices are commonly employed in many real applications, encoding the underlying latent structural information such as graphs and manifolds. The use of the normalization terms naturally gives rise to random ma…
Uncertainty Quantification