Cited 0 time in
LiNLNet: Gauging required nonlinearity in deep neural networks
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Jin, Seongmin | - |
| dc.contributor.author | Jeong, Doo Seok | - |
| dc.date.accessioned | 2026-01-14T07:30:14Z | - |
| dc.date.available | 2026-01-14T07:30:14Z | - |
| dc.date.issued | 2023-03 | - |
| dc.identifier.issn | 2770-9019 | - |
| dc.identifier.issn | 2770-9019 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/210321 | - |
| dc.description.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. | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | AIP Publishing | - |
| dc.title | LiNLNet: Gauging required nonlinearity in deep neural networks | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1063/5.0134713 | - |
| dc.identifier.scopusid | 2-s2.0-105024704351 | - |
| dc.identifier.wosid | 001492054500012 | - |
| dc.identifier.bibliographicCitation | APL MACHINE LEARNING, v.1, no.1, pp 016108-1 - 016108-9 | - |
| dc.citation.title | APL MACHINE LEARNING | - |
| dc.citation.volume | 1 | - |
| dc.citation.number | 1 | - |
| dc.citation.startPage | 016108-1 | - |
| dc.citation.endPage | 016108-9 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.description.journalRegisteredClass | esci | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalResearchArea | Physics | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
| dc.relation.journalWebOfScienceCategory | Physics, Applied | - |
| dc.identifier.url | https://pubs.aip.org/aip/aml/article/1/1/016108/2878709/LiNLNet-Gauging-required-nonlinearity-in-deep | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
