pith. sign in

arxiv: 1905.01369 · v1 · pith:4DFJYSDWnew · submitted 2019-05-03 · 💻 cs.LG · stat.ML

Static Activation Function Normalization

classification 💻 cs.LG stat.ML
keywords activationnormalizationfunctionnetworksstaticconvergencerandomrobustness
0
0 comments X
read the original abstract

Recent seminal work at the intersection of deep neural networks practice and random matrix theory has linked the convergence speed and robustness of these networks with the combination of random weight initialization and nonlinear activation function in use. Building on those principles, we introduce a process to transform an existing activation function into another one with better properties. We term such transform \emph{static activation normalization}. More specifically we focus on this normalization applied to the ReLU unit, and show empirically that it significantly promotes convergence robustness, maximum training depth, and anytime performance. We verify these claims by examining empirical eigenvalue distributions of networks trained with those activations. Our static activation normalization provides a first step towards giving benefits similar in spirit to schemes like batch normalization, but without computational cost.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.