Expected Complexity and Gradients of Maxout Networks

  • Hanna Tseran (MPI MiS, Leipzig)
E1 05 (Leibniz-Saal)


Learning with neural networks relies on the complexity of the representable functions but, more importantly, the particular assignment of typical parameters to functions of different complexity. Taking the number of activation regions as a complexity measure, we show that the practical complexity of networks with maxout activation functions, which correspond to tropical rational maps, is often far from the theoretical maximum. Continuing the analysis of the expected behavior, we study the expected 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. Based on this, we formulate parameter initialization strategies that avoid vanishing and exploding gradients in wide networks.

Mirke Olschewski

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of This Seminar