Capacity and Redundancy Trade-offs in Multi-Task Learning
Not on the map. Why?
Abstract (arXiv)
In multi-task learning (MTL) negative transfer is often considered as an optimization artifact, but it can also be viewed as a consequence of limited shared capacity and weak task redundancy. We investigate this effect through a Capacity--Redundancy (CR) identity that decomposes the sum of per-task predictive informations into joint predictive information that includes label redundancy defined via total correlation (TC), and a residual coupling term that quantifies interference left unresolved by the shared representation. Additionally, we show two key results: (i) a clustering-gap decomposition that gives a necessary and sufficient condition for clustered sharing to outperform global sharing, and (ii) a gradient--TC bridge in a Gaussian multi-task model that formally justifies gradient cosine similarity as a proxy for redundancy ordering. Empirically, we estimate the residual coupling Delta from validation residual correlations, showing that clustered LoRA substantially reduces widehatDelta, outperforms size-matched random partitions, and results in statistically significant gains with multi-seed confidence intervals.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 17 Jul 2026.
Builds on
27 of 48 references.
References · 27
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2020Gradient Surgery for Multi-Task Learningcited by 1,210
- 2016Deep Variational Information Bottleneckcited by 915
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 816
- 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 791
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2020GoEmotions: A Dataset of Fine-Grained Emotionscited by 479
- 2016Cross-stitch Networks for Multi-task Learningcited by 466
- 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 458
15 more
- 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 367
- 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 278
- 2018Characterizing and Avoiding Negative Transfercited by 226
- 2015The Benefit of Multitask Representation Learningcited by 194
- 2021DEMix Layers: Disentangling Domains for Modular Language Modelingcited by 130
- 2020Controllable Pareto Multi-Task Learningcited by 51
- 2021How Fine-Tuning Allows for Effective Meta-Learningcited by 41
- 2018K for the Price of 1: Parameter-efficient Multi-task and Transfer Learningcited by 34
- 2019Quantifying High-order Interdependencies via Multivariate Extensions of the Mutual Informationcited by 30
- 2020A No-Free-Lunch Theorem for MultiTask Learningcited by 28
- 2023Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustnesscited by 27
- 2021Conditional Meta-Learning of Linear Representationscited by 12
- 2019Feature Partitioning for Efficient Multi-Task Architecturescited by 9
- 2020Multi-Task Variational Information Bottleneckcited by 7
- 2020Small Towers Make Big Differencescited by 7
Built on by
Not cited yet.