Author
Listed:
- Lining Li
(College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
These authors contributed equally to this work.)
- Fenglin Cen
(State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China
These authors contributed equally to this work.)
- Quan Feng
(Hunan Vanguard Group Corporation Limited, Changsha 410100, China)
- Ji Xu
(State Key Laboratory of Public Big Data, Guizhou University, Guiyang 550025, China)
Abstract
In resource-constrained mobile systems, efficiently handling incrementally added tasks under dynamically evolving requirements is a critical challenge. To address this, we propose aggregate pruning (AP), a framework that combines pruning with filter aggregation to optimize deep neural networks for continuous incremental multi-task learning (MTL). The approach reduces redundancy by dynamically pruning and aggregating similar filters across tasks, ensuring efficient use of computational resources while maintaining high task-specific performance. The aggregation strategy enables effective filter sharing across tasks, significantly reducing model complexity. Additionally, an adaptive mechanism is incorporated into AP to adjust filter sharing based on task similarity, further enhancing efficiency. Experiments on different backbone networks, including LeNet, VGG, ResNet, and so on, show that AP achieves substantial parameter reduction and computational savings with minimal accuracy loss, outperforming existing pruning methods and even surpassing non-pruning MTL techniques. The architecture-agnostic design of AP also enables potential extensions to complex architectures like graph neural networks (GNNs), offering a promising solution for incremental multi-task GNNs.
Suggested Citation
Lining Li & Fenglin Cen & Quan Feng & Ji Xu, 2025.
"Aggregation and Pruning for Continuous Incremental Multi-Task Inference,"
Mathematics, MDPI, vol. 13(9), pages 1-18, April.
Handle:
RePEc:gam:jmathe:v:13:y:2025:i:9:p:1414-:d:1642579
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:9:p:1414-:d:1642579. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.