mlsanityData to 14 Oct 2026

Efficient Controllable Multi-Task Architectures

arXiv 2308.11744 ↗First posted 22 Aug 2023cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

We aim to train a multi-task model such that users can adjust the desired compute budget and relative importance of task performances after deployment, without retraining. This enables optimizing performance for dynamically varying user needs, without heavy computational overhead to train and save models for various scenarios. To this end, we propose a multi-task model consisting of a shared encoder and task-specific decoders where both encoder and decoder channel widths are slimmable. Our key idea is to control the task importance by varying the capacities of task-specific decoders, while controlling the total computational cost by jointly adjusting the encoder capacity. This improves overall accuracy by allowing a stronger encoder for a given budget, increases control over computational cost, and delivers high-quality slimmed sub-architectures based on user's constraints. Our training strategy involves a novel 'Configuration-Invariant Knowledge Distillation' loss that enforces backbone representations to be invariant under different runtime width configurations to enhance accuracy. Further, we present a simple but effective search algorithm that translates user constraints to runtime width configurations of both the shared encoder and task decoders, for sampling the sub-architectures. The key rule for the search algorithm is to provide a larger computational budget to the higher preferred task decoder, while searching a shared encoder configuration that enhances the overall MTL performance. Various experiments on three multi-task benchmarks (PASCALContext, NYUDv2, and CIFAR100-MTL) with diverse backbone architectures demonstrate the advantage of our approach. For example, our method shows a higher controllability by ~33.5% in the NYUD-v2 dataset over prior methods, while incurring much less compute cost.

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

Builds on

45 of 64 references.

References · 45

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  5. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  6. 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,161
  7. 2016Progressive Neural Networkscited by 1,361
  8. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  9. 2017Random Erasing Data Augmentationcited by 1,239
  10. 2016HyperNetworkscited by 1,027
  11. 2018Regularized Evolution for Image Classifier Architecture Searchcited by 909
  12. 2017A Survey on Multi-Task Learningcited by 840
33 more
  1. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 803
  2. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  3. 2016Cross-stitch Networks for Multi-task Learningcited by 467
  4. 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 375
  5. 2018Slimmable Neural Networkscited by 305
  6. 2019Pareto Multi-Task Learningcited by 224
  7. 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
  8. 2016UberNet: Training a `Universal' Convolutional Neural Network for Low-, Mid-, and High-Level Vision using Diverse Datasets and Limited Memorycited by 200
  9. 2020BigNAS: Scaling Up Neural Architecture Search with Big Single-Stage Modelscited by 188
  10. 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
  11. 2018NDDR-CNN: Layerwise Feature Fusing in Multi-Task CNNs by Neural Discriminative Dimensionality Reductioncited by 127
  12. 2017Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learningcited by 126
  13. 2020Learning the Pareto Front with Hypernetworkscited by 125
  14. 2020Learning to Branch for Multi-Task Learningcited by 115
  15. 2016MultiNet: Real-time Joint Semantic Reasoning for Autonomous Drivingcited by 90
  16. 2021Dynamic Slimmable Networkcited by 83
  17. 2019Branched Multi-Task Networks: Deciding What Layers To Sharecited by 76
  18. 2021Exploring Relational Context for Multi-Task Dense Predictioncited by 71
  19. 2016Deep Multi-task Representation Learning: A Tensor Factorisation Approachcited by 69
  20. 2022In Defense of the Unitary Scalarization for Deep Multi-Task Learningcited by 67
  21. 2022Do Current Multi-Task Optimization Methods in Deep Learning Even Help?cited by 60
  22. 2020Knowledge Distillation for Multi-task Learningcited by 51
  23. 2020Automated Search for Resource-Efficient Branched Multi-Task Networkscited by 51
  24. 2020Controllable Pareto Multi-Task Learningcited by 51
  25. 2016Trace Norm Regularised Deep Multi-Task Learningcited by 50
  26. 2020MTL-NAS: Task-Agnostic Neural Architecture Search towards General-Purpose Multi-Task Learningcited by 50
  27. 2022MulT: An End-to-End Multitask Learning Transformercited by 48
  28. 2022You Need Multiple Exiting: Dynamic Early Exiting for Accelerating Unified Vision Language Modelcited by 43
  29. 2020Slimmable Generative Adversarial Networkscited by 27
  30. 2022Controllable Dynamic Multi-Task Architecturescited by 21
  31. 2021On-edge Multi-task Transfer Learning: Model and Practice with Data-driven Task Allocationcited by 9
  32. 2022Toward Edge-Efficient Dense Predictions with Synergistic Multi-Task Neural Architecture Searchcited by 5
  33. 2022SlimSeg: Slimmable Semantic Segmentation with Boundary Supervisioncited by 4

Built on by

Cited by year

Citing papers per year: 2024: 5; 2025: 2.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Return of the Encoder: Maximizing Parameter Efficiency for SLMs
  2. 2026Block-Based Double Decoders
  3. 2026The Economics of AI Decoding Chips: Rebalancing Compute, Capacity, and Bandwidth for Efficient LLM Inference
  4. 2026Task-Centric Acceleration of Small-Language Models
  5. 2025Distribution-Aligned Decoding for Efficient LLM Task Adaptation
  6. 2026MoTE: Mixture of Task Experts for Multi-Task Video Understanding
  7. 2026Accelerating Unified Multimodal Models with Core-Expansion Routing and Unified Computation Scheduling
  8. 2022Less is More: Task-aware Layer-wise Distillation for Language Model Compression