Fast generalization error bound of deep learning without scale invariance of activation functions
Yoshikazu Terada, Ryoma Hirose

TL;DR
This paper demonstrates that fast generalization error bounds for deep learning can be achieved without requiring activation functions to be scale invariant, broadening the theoretical understanding of neural network performance.
Contribution
It extends Suzuki's (2018) framework to derive tight generalization bounds for deep neural networks with non-scale-invariant activation functions.
Findings
Fast convergence rates are possible without scale invariance.
Theoretical framework applies to various activation functions.
Non-scale-invariant activations can achieve similar error bounds.
Abstract
In theoretical analysis of deep learning, discovering which features of deep learning lead to good performance is an important task. In this paper, using the framework for analyzing the generalization error developed in Suzuki (2018), we derive a fast learning rate for deep neural networks with more general activation functions. In Suzuki (2018), assuming the scale invariance of activation functions, the tight generalization error bound of deep learning was derived. They mention that the scale invariance of the activation function is essential to derive tight error bounds. Whereas the rectified linear unit (ReLU; Nair and Hinton, 2010) satisfies the scale invariance, the other famous activation functions including the sigmoid and the hyperbolic tangent functions, and the exponential linear unit (ELU; Clevert et al., 2016) does not satisfy this condition. The existing analysis indicates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and ELM · Machine Learning and Algorithms · Neural Networks and Applications
