^{2}Aiola ^{3}National University of Singapore ^{4}NVIDIA Research |
Auxiliary learning is an effective method for enhancing the generalization capabilities of trained models,
particularly when dealing with small datasets. However, this approach may present several difficulties:
(i) optimizing multiple objectives can be more challenging, and
(ii) how to balance the auxiliary tasks to best assist the main task is unclear.
In this work, we propose a novel approach, named AuxiNash, for balancing tasks in auxiliary
learning by formalizing the problem as generalized bargaining game with asymmetric task bargaining power.
Furthermore, we describe an efficient procedure for learning the bargaining power of tasks based on their
contribution to the performance of the main task and derive theoretical guarantees for its convergence.
Finally, we evaluate AuxiNash on multiple multi-task benchmarks and find that it consistently
outperforms competing methods.
Auxiliary learning has a large potential to improve learning in the low data regime, but it gives rise to two main challenges: Defining the joint optimization problem and performing the optimization efficiently. (1) First, given a main task at hand, it is not clear which auxiliary tasks would benefit the main task and how tasks should be combined into a joint optimization objective. (2) Second, training with auxiliary tasks involves optimizing multiple objectives simultaneously; While training with multiple tasks can potentially improve performance via better generalization, it often underperforms compared to single-task models. Previous auxiliary learning research focused mainly on the first challenge: namely, weighting and combining auxiliary tasks. The second challenge, optimizing the main task in the presence of auxiliary tasks, has been less explored.
In this work we propose a novel approach named AuxiNash that takes inspiration from recent advances in MTL optimization as a cooperative bargaining game (Nash-MTL). The idea is to view a gradient update as a shared resource, view each task as a player in a game, and have players compete over making the joint gradient similar to their own task gradient. In Nash-MTL, tasks play a symmetric role, since no task is particularly favorable. This leads to a bargaining solution that is proportionally fair across tasks. In contrast, task symmetry no longer holds in auxiliary learning, where there is a clear distinction between the primary task and the auxiliary ones. As such, we propose to view auxiliary learning as an asymmetric bargaining game. Specifically, we consider gradient aggregation as a cooperative bargaining game where each player represents a task with varying bargaining power. We formulate gradient update using asymmetric Nash bargaining solution which takes into account varying task preferences. By generalizing Nash-MTL to asymmetric games with AuxiNash, we can efficiently direct optimization solution towards various areas of the Pareto front.
We consider a regression problem with parameters $W^T=(w_1, w_2)\in\mathbb{R}^2$, fully shared among tasks. The optimal parameters for the main and helpful auxiliary tasks are $W^\star$, while the optimal parameters for the harmful auxiliary are $\tilde{W}\neq W^\star$. The main task is sampled from a Normal distribution $N({W^\star}^T x, \sigma_{\text{main}})$, with $\sigma_{\text{main}} > \sigma_{\text{h}}$ where $\sigma_{\text{h}}$ denotes the standard deviation for the noise of the helpful auxiliary. The change in the task preference throughout the optimization process is depicted in the left panel of Figure 2. AuxiNash identify the helpful tasks and fully ignore the harmful ones. In addition, Figure 2 right panel presents the main task's loss landscape, along with the optimal solution ($W^\star$, marked $\blacktriangle$), the optimal training set solution of the main task alone (${\scriptstyle \blacksquare}$) and the solution obtained by AuxiNash (marked $\bullet$). While using the training data alone with no auxiliary information yields a solution that generalizes poorly, AuxiNash converges to a solution with large proximity to the optimal solution $W^\star$,
Here, we show that controlling the preference vector can be used to steer the optimization outcome to different parts of the Pareto front, compared to the NashMTL baseline. We consider MTL setup with 2 image classification tasks and use the Multi-MNIST dataset. We run AuxiNash $11$ times with varying preference vector values $p$ and fix it throughout the training. For both tasks we report the classification accuracy. For Nash-MTL we run the experiments with different seed values. Figure 3 shows the results. AuxiNash reaches a diverse set of solutions across the Pareto front while Nash-MTL solutions are all relatively similar due to its symmetry property.
Here, we evaluate AuxiNash on Cityscapes and NYUv2 datasets. The indoor scene NYUv2 dataset contains 3 tasks: 13 classes semantic segmentation, depth estimation, and surface normal prediction. We also use the Cityscapes dataset with 3 tasks: 19-class semantic segmentation, disparity (inverse depth) estimation, and 10-class part segmentation. The results are presented in Table 1 and Table 2.
We evaluate AuxiNash on a Self-supervised Semi-supervised Learning setting.
We use CIFAR-10 dataset to form 3 tasks. We set the supervised classification as the main task along with two
self-supervised learning (SSL) tasks used as auxiliaries.
For the supervised task we randomly allocate samples from the training set.
We repeat this experiment twice with $5K$ and $10K$ labeled training examples.
The results are presented in Table 3. AuxiNash significantly outperforms most baselines.