Expected Gradients of Maxout Networks and Consequences to Parameter Initialization
Hanna Tseran, Guido Montúfar
Abstract
We study the gradients of a maxout network with respect to inputs and parameters and obtain bounds for the moments depending on the architecture and the parameter distribution. We observe that the distribution of the input-output Jacobian depends on the input, which complicates a stable parameter initialization. Based on the moments of the gradients, we formulate parameter initialization strategies that avoid vanishing and exploding gradients in wide networks. Experiments with deep fully-connected and convolutional networks show that this strategy improves SGD and Adam training of deep maxout networks. In addition, we obtain refined bounds on the expected number of linear regions, results on the expected curve length distortion, and results on the NTK. 3
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on2
Related papers
- On the Expected Complexity of Maxout NetworksHanna Tseran, Guido MontúfarNeurIPS 2021 · 19 citations
- Better Training using Weight-Constrained Stochastic DynamicsBenedict J. Leimkuhler, Tiffany J. Vlaar, Timothée Pouchon, Amos J. StorkeyICML 2021 · 11 citations
- Neural Tangent Kernel Beyond the Infinite-Width Limit: Effects of Depth and InitializationMariia Seleznova, Gitta KutyniokICML 2022 · 34 citations
- Information Geometry of Orthogonal Initializations and TrainingPiotr Aleksander Sokól, Il Memming ParkICLR 2020 · 17 citations
- Weak Correlations as the Underlying Principle for Linearization of Gradient-Based Learning SystemsOri Shem-Ur, Khen Cohen, Yaron OzICLR 2026
