mlsanityData to 7 Oct 2026

Budget-Aware Pruning for Multi-Domain Learning

arXiv 2210.08101 ↗First posted 14 Oct 2022cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Deep learning has achieved state-of-the-art performance on several computer vision tasks and domains. Nevertheless, it still has a high computational cost and demands a significant amount of parameters. Such requirements hinder the use in resource-limited environments and demand both software and hardware optimization. Another limitation is that deep models are usually specialized into a single domain or task, requiring them to learn and store new parameters for each new one. Multi-Domain Learning (MDL) attempts to solve this problem by learning a single model that is capable of performing well in multiple domains. Nevertheless, the models are usually larger than the baseline for a single domain. This work tackles both of these problems: our objective is to prune models capable of handling multiple domains according to a user defined budget, making them more computationally affordable while keeping a similar classification performance. We achieve this by encouraging all domains to use a similar subset of filters from the baseline model, up to the amount defined by the user's budget. Then, filters that are not used by any domain are pruned from the network. The proposed approach innovates by better adapting to resource-limited devices while, to our knowledge, being the only work that is capable of handling multiple domains at test time with fewer parameters and lower computational complexity than the baseline model for a single domain.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 17 references that are in the map. First posted on arXiv 14 Oct 2022.

Builds on

10 of 17 references.

References · 10

  1. 2016Wide Residual Networkscited by 3,057
  2. 2017Learning multiple visual domains with residual adapterscited by 553
  3. 2018Efficient parametrization of multi-domain deep neural networkscited by 168
  4. 2021Group Fisher Pruning for Practical Network Compressioncited by 130
  5. 2020Learning to Balance Specificity and Invariance for In and Out of Domain Generalizationcited by 128
  6. 2022Task Adaptive Parameter Sharing for Multi-Task Learningcited by 42
  7. 2018Adding New Tasks to a Single Network with Weight Transformations using Binary Maskscited by 21
  8. 2019Budget-Aware Adapters for Multi-Domain Learningcited by 18
  9. 2020DA3:Dynamic Additive Attention Adaption for Memory-EfficientOn-Device Multi-Domain Learningcited by 6
  10. 2021Boosting Binary Masks for Multi-Domain Learning through Affine Transformationscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.