Multi-task Pruning via Filter Index Sharing: A Many-Objective Optimization Approach

被引:11
作者
Cheng, Hanjing [1 ]
Wang, Zidong [2 ]
Ma, Lifeng [3 ]
Liu, Xiaohui [2 ]
Wei, Zhihui [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Peoples R China
[2] Brunel Univ London, Dept Comp Sci, Uxbridge UB8 3PH, Middx, England
[3] Nanjing Univ Sci & Technol, Sch Automat, Nanjing 210094, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-task learning; Evolutionary algorithm; Network pruning; Many-objective optimization; CLASSIFICATION;
D O I
10.1007/s12559-021-09894-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
State-of-the-art deep neural network plays an increasingly important role in artificial intelligence, while the huge number of parameters in networks brings high memory cost and computational complexity. To solve this problem, filter pruning is widely used for neural network compression and acceleration. However, existing algorithms focus mainly on pruning single model, and few results are available to multi-task pruning that is capable of pruning multi-model and promoting the learning performance. By utilizing the filter sharing technique, this paper aimed to establish a multi-task pruning framework for simultaneously pruning and merging filters in multi-task networks. An optimization problem of selecting the important filters is solved by developing a many-objective optimization algorithm where three criteria are adopted as objectives for the many-objective optimization problem. With the purpose of keeping the network structure, an index matrix is introduced to regulate the information sharing during multi-task training. The proposed multi-task pruning algorithm is quite flexible that can be performed with either adaptive or pre-specified pruning rates. Extensive experiments are performed to verify the applicability and superiority of the proposed method on both single-task and multi-task pruning.
引用
收藏
页码:1070 / 1084
页数:15
相关论文
共 62 条
[1]   Detecting Prosumer-Community Groups in Smart Grids From the Multiagent Perspective [J].
Cao, Jie ;
Bu, Zhan ;
Wang, Yuyao ;
Yang, Huan ;
Jiang, Jiuchuan ;
Li, Hui-Jia .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2019, 49 (08) :1652-1664
[2]   Similarity based leaf image retrieval using multiscale R-angle description [J].
Cao, Jie ;
Wang, Bin ;
Brown, Douglas .
INFORMATION SCIENCES, 2016, 374 :51-64
[3]   "Learning-Compression" Algorithms for Neural Net Pruning [J].
Carreira-Perpinan, Miguel A. ;
Idelbayev, Yerlan .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :8532-8541
[4]   Mixed H2/H∞ State Estimation for Discrete-Time Switched Complex Networks With Random Coupling Strengths Through Redundant Channels [J].
Chen, Yun ;
Wang, Zidong ;
Wang, Licheng ;
Sheng, Weiguo .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2020, 31 (10) :4130-4142
[5]   On Adaptive Learning Framework for Deep Weighted Sparse Autoencoder: A Multiobjective Evolutionary Algorithm [J].
Cheng, Hanjing ;
Wang, Zidong ;
Wei, Zhihui ;
Ma, Lifeng ;
Liu, Xiaohui .
IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (05) :3221-3231
[6]  
Dai B, 2018, PR MACH LEARN RES, V80
[7]  
Dong X, 2017, ADV NEUR IN, V30
[8]   More is Less: A More Complicated Network with Less Inference Complexity [J].
Dong, Xuanyi ;
Huang, Junshi ;
Yang, Yi ;
Yan, Shuicheng .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :1895-1903
[9]  
Han S, 2015, ADV NEUR IN, V28
[10]  
Hassibi B., 1993, P ADV NEUR INF PROC