Depth Dependence of P Learning Rates in ReLU MLPs

Abstract
In this short note we consider random fully connected ReLU networks of width and depth equipped with a mean-field weight initialization. Our purpose is to study the dependence on and of the maximal update (P) learning rate, the largest learning rate for which the mean squared change in pre-activations after one step of gradient descent remains uniformly bounded at large . As in prior work on P of Yang et. al., we find that this maximal update learning rate is independent of for all but the first and last layer weights. However, we find that it has a non-trivial dependence of , scaling like
View on arXivComments on this paper