AdapMTL: Adaptive Pruning Framework for Multitask Learning Model
Not on the map. Why?
Abstract (arXiv)
In the domain of multimedia and multimodal processing, the efficient handling of diverse data streams such as images, video, and sensor data is paramount. Model compression and multitask learning (MTL) are crucial in this field, offering the potential to address the resource-intensive demands of processing and interpreting multiple forms of media simultaneously. However, effectively compressing a multitask model presents significant challenges due to the complexities of balancing sparsity allocation and accuracy performance across multiple tasks. To tackle these challenges, we propose AdapMTL, an adaptive pruning framework for MTL models. AdapMTL leverages multiple learnable soft thresholds independently assigned to the shared backbone and the task-specific heads to capture the nuances in different components' sensitivity to pruning. During training, it co-optimizes the soft thresholds and MTL model weights to automatically determine the suitable sparsity level at each component to achieve both high task accuracy and high overall sparsity. It further incorporates an adaptive weighting mechanism that dynamically adjusts the importance of task-specific losses based on each task's robustness to pruning. We demonstrate the effectiveness of AdapMTL through comprehensive experiments on popular multitask datasets, namely NYU-v2 and Tiny-Taskonomy, with different architectures, showcasing superior performance compared to state-of-the-art pruning methods.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 42 of its 64 references that are in the map. First posted on arXiv 7 Aug 2024.
Builds on
42 of 64 references.
References · 42
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,241
- 2015Fast R-CNNcited by 2,933
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2014Deep Learning in Neural Networks: An Overviewcited by 770
- 2019VideoBERT: A Joint Model for Video and Language Representation Learningcited by 703
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 634
- 2018Rethinking the Value of Network Pruningcited by 599
30 more
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2019HAWQ: Hessian AWare Quantization of Neural Networks with Mixed-Precisioncited by 402
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2017Distral: Robust Multitask Reinforcement Learningcited by 233
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 189
- 2015Actor-Mimic: Deep Multitask and Transfer Reinforcement Learningcited by 178
- 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2019Attentive Single-Tasking of Multiple Taskscited by 148
- 2018A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multiplierscited by 120
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
- 2020PatDNN: Achieving Real-Time DNN Execution on Mobile Devices with Pattern-based Weight Pruningcited by 76
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2019Neural Network Pruning with Residual-Connections and Limited-Datacited by 52
- 2020MTL-NAS: Task-Agnostic Neural Architecture Search towards General-Purpose Multi-Task Learningcited by 50
- 2021Playing Lottery Tickets with Vision and Languagecited by 45
- 2019Stabilizing the Lottery Ticket Hypothesiscited by 37
- 2019Learning Sparse Sharing Architectures for Multiple Taskscited by 31
- 2021AutoMTL: A Programming Framework for Automating Efficient Multi-Task Learningcited by 17
- 2022DiSparse: Disentangled Sparsification for Multitask Model Compressioncited by 14
- 2022Are Straight-Through gradients and Soft-Thresholding all you need for Sparse Training?cited by 9
- 2023Performance-aware Approximation of Global Channel Pruning for Multitask CNNscited by 9
- 2020MTP: Multi-Task Pruning for Efficient Semantic Segmentation Networkscited by 7
- 2022A Tree-Structured Multi-Task Model Recommendercited by 6
Built on by
Citing papers per year: 2025: 2.
2 papers.