LiNLNet: Gauging required nonlinearity in deep neural networks
- Authors
- Jin, Seongmin; Jeong, Doo Seok
- Issue Date
- Mar-2023
- Publisher
- AIP Publishing
- Citation
- APL MACHINE LEARNING, v.1, no.1, pp 016108-1 - 016108-9
- Indexed
- SCOPUS
ESCI
- Journal Title
- APL MACHINE LEARNING
- Volume
- 1
- Number
- 1
- Start Page
- 016108-1
- End Page
- 016108-9
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/210321
- DOI
- 10.1063/5.0134713
- ISSN
- 2770-9019
2770-9019
- Abstract
- Feedforward deep neural networks (DNNs) commonly involve layer-wise linear operations and subsequent nonlinear operations, which are repeated through all layers. The nonlinear operations by nonlinear activations in each layer remarkably enhance the expressiveness of DNNs, resulting in the great success in a variety of application domains. Although the necessity of layer-wise nonlinear operations is agreed, the optimal nonlinearity for each layer in a given DNN is not clear. In this regard, we propose an easy-to-use method to layer-wise measure the optimal nonlinearity for a given DNN using its replica termed a linear-nonlinear network (LiNLNet). The key to the LiNLNet is the use of linear-nonlinear units (LiNLUs) whose degree of nonlinearity is parameterized by a trainable parameter p. The parameter p is shared among all LiNLUs in a given layer, thus indicating the layer-wise optimal nonlinearity. This method allows layer-level pruning such that the layers that do not require nonlinearity are merged into the subsequent layers, reducing computational complexity. For proofs of concept, we applied the proposed method to a MLP, AlexNet, VGG16, and ResNet18 on CIFAR-10 and ImageNet. The results commonly indicate the last hidden layer as a linear layer that may be merged into the output layer, reducing memory usage by 27% while maintaining the accuracy for LiNL-AlexNet on ImageNet.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 신소재공학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.