mlsanityData to 14 Oct 2026

Less is More -- Towards parsimonious multi-task models using structured sparsity

arXiv 2308.12114 ↗First posted 23 Aug 2023cs.CV cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Model sparsification in deep learning promotes simpler, more interpretable models with fewer parameters. This not only reduces the model's memory footprint and computational needs but also shortens inference time. This work focuses on creating sparse models optimized for multiple tasks with fewer parameters. These parsimonious models also possess the potential to match or outperform dense models in terms of performance. In this work, we introduce channel-wise l1/l2 group sparsity in the shared convolutional layers parameters (or weights) of the multi-task learning model. This approach facilitates the removal of extraneous groups i.e., channels (due to l1 regularization) and also imposes a penalty on the weights, further enhancing the learning efficiency for all tasks (due to l2 regularization). We analyzed the results of group sparsity in both single-task and multi-task settings on two widely-used Multi-Task Learning (MTL) datasets: NYU-v2 and CelebAMask-HQ. On both datasets, which consist of three different computer vision tasks each, multi-task models with approximately 70% sparsity outperform their dense equivalents. We also investigate how changing the degree of sparsification influences the model's performance, the overall sparsity percentage, the patterns of sparsity, and the inference time.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 23 Aug 2023.

Builds on

24 of 45 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
  3. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  4. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
  5. 2019MaskGAN: Towards Diverse and Interactive Facial Image Manipulationcited by 628
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
  7. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  8. 2016Cross-stitch Networks for Multi-task Learningcited by 467
  9. 2020Multi-Task Learning with Deep Neural Networks: A Surveycited by 375
  10. 2017Dilated Residual Networkscited by 294
  11. 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
  12. 2020Learning to Branch for Multi-Task Learningcited by 115
12 more
  1. 2020Understanding and Improving Information Transfer in Multi-Task Learningcited by 114
  2. 2016Fully-adaptive Feature Sharing in Multi-Task Networks with Applications in Person Attribute Classificationcited by 93
  3. 2019Branched Multi-Task Networks: Deciding What Layers To Sharecited by 76
  4. 2020Pruning Filter in Filtercited by 47
  5. 2022Task Adaptive Parameter Sharing for Multi-Task Learningcited by 42
  6. 2020Recent advances in deep learning theorycited by 41
  7. 2019Learning Sparse Sharing Architectures for Multiple Taskscited by 31
  8. 2021Structured Sparsity Inducing Adaptive Optimizers for Deep Learningcited by 17
  9. 2015Distributed Multitask Learningcited by 11
  10. 2022Multi-Task Meta Learning: learn how to adapt to unseen taskscited by 8
  11. 2021Sharing to learn and learning to share; Fitting together Meta-Learning, Multi-Task Learning, and Transfer Learning: A meta reviewcited by 6
  12. 2017Learning task structure via sparsity grouped multitask learningcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.