|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM359376983 |
| 003 |
DE-627 |
| 005 |
20231226080736.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2023.3288986
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1197.xml
|
| 035 |
|
|
|a (DE-627)NLM359376983
|
| 035 |
|
|
|a (NLM)37436852
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Zhang, Xin
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a REAF
|b Remembering Enhancement and Entropy-Based Asymptotic Forgetting for Filter Pruning
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 18.07.2023
|
| 500 |
|
|
|a Date Revised 18.07.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Neurologically, filter pruning is a procedure of forgetting and remembering recovering. Prevailing methods directly forget less important information from an unrobust baseline at first and expect to minimize the performance sacrifice. However, unsaturated base remembering imposes a ceiling on the slimmed model leading to suboptimal performance. And significantly forgetting at first would cause unrecoverable information loss. Here, we design a novel filter pruning paradigm termed Remembering Enhancement and Entropy-based Asymptotic Forgetting (REAF). Inspired by robustness theory, we first enhance remembering by over-parameterizing baseline with fusible compensatory convolutions which liberates pruned model from the bondage of baseline at no inference cost. Then the collateral implication between original and compensatory filters necessitates a bilateral-collaborated pruning criterion. Specifically, only when the filter has the largest intra-branch distance and its compensatory counterpart has the strongest remembering enhancement power, they are preserved. Further, Ebbinghaus curve-based asymptotic forgetting is proposed to protect the pruned model from unstable learning. The number of pruned filters is increasing asymptotically in the training procedure, which enables the remembering of pretrained weights gradually to be concentrated in the remaining filters. Extensive experiments demonstrate the superiority of REAF over many state-of-the-art (SOTA) methods. For example, REAF removes 47.55% FLOPs and 42.98% parameters of ResNet-50 only with 0.98% TOP-1 accuracy loss on ImageNet. The code is available at https://github.com/zhangxin-xd/REAF
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Xie, Weiying
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Li, Yunsong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Jiang, Kai
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Fang, Leyuan
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 32(2023) vom: 20., Seite 3912-3923
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:32
|g year:2023
|g day:20
|g pages:3912-3923
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2023.3288986
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 32
|j 2023
|b 20
|h 3912-3923
|