Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/23446
Title: Multi-task Pruning via Filter Index Sharing: A Many-Objective Optimization Approach
Authors: Cheng, H
Wang, Z
Ma, L
Liu, X
Wei, Z
Keywords: multi-task learning;evolutionary algorithm;network pruning;multiple input delays;many-objective optimization
Issue Date: 25-Jun-2021
Publisher: Springer Nature Switzerland AG
Citation: Cheng, H., Wang, Z., Ma, L., Liu, X. and Wei, Z. (2021) 'Multi-task Pruning via Filter Index Sharing: A Many-Objective Optimization Approach', Cognitive Computation, 13 (4), pp. 1070 - 1084. doi: 10.1007/s12559-021-09894-x.
Abstract: © The Author(s) 2021. 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.
URI: https://bura.brunel.ac.uk/handle/2438/23446
DOI: https://doi.org/10.1007/s12559-021-09894-x
ISSN: 1866-9956
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf2.8 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons