Small Towers Make Big Differences
Not on the map. Why?
Abstract (arXiv)
Multi-task learning aims at solving multiple machine learning tasks at the same time. A good solution to a multi-task learning problem should be generalizable in addition to being Pareto optimal. In this paper, we provide some insights on understanding the trade-off between Pareto efficiency and generalization as a result of parameterization in multi-task deep learning models. As a multi-objective optimization problem, enough parameterization is needed for handling task conflicts in a constrained solution space; however, from a multi-task generalization perspective, over-parameterization undermines the benefit of learning a shared representation which helps harder tasks or tasks with limited training examples. A delicate balance between multi-task generalization and multi-objective optimization is therefore needed for finding a better trade-off between efficiency and generalization. To this end, we propose a method of under-parameterized self-auxiliaries for multi-task models to achieve the best of both worlds. It is task-agnostic and works with other multi-task learning algorithms. Empirical results show that small towers of under-parameterized self-auxiliaries can make big differences in improving Pareto efficiency in various multi-task applications.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
7 papers.
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learningcited by 114
- 2022HyperPrompt: Prompt-based Task-Conditioning of Transformerscited by 67
- 2021Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task Learningcited by 34
- 2025Pareto Set Learning for Multi-Objective Reinforcement Learningcited by 18
- 2021Exceeding the Limits of Visual-Linguistic Multi-Task Learningcited by 3
- 2023COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Searchcited by 2
- 2026Capacity and Redundancy Trade-offs in Multi-Task Learningcited by 0
- 2026Capacity and Redundancy Trade-offs in Multi-Task Learning17 Jul 2026
- 2025Pareto Set Learning for Multi-Objective Reinforcement Learning12 Jan 2025
- 2023COMET: Learning Cardinality Constrained Mixture of Experts with Trees and Local Search5 Jun 2023
- 2022HyperPrompt: Prompt-based Task-Conditioning of Transformers1 Mar 2022
- 2021Exceeding the Limits of Visual-Linguistic Multi-Task Learning27 Jul 2021
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning7 Jun 2021
- 2021Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task Learning4 Jun 2021