通过动态分组任务并分批更新,缓解多任务学习中的负迁移问题。
Selective Task Group Updates for Multi-Task Optimization
- 按任务间亲和性动态分组,分批更新以优化共享与专用参数
- 理论证明分组顺序更新能显著提升任务特定参数学习效果
- 适用于多种架构和任务数量,有效缓解负迁移现象
多任务学习通过在统一架构中联合训练多个任务来获取任务通用知识。然而,在单一架构中同时训练所有任务可能导致性能下降,即负迁移,这是多任务学习的主要挑战。现有方法通过梯度调控或加权损失调整来优化网络,但其策略仅关注共享参数的任务不平衡问题,忽视了任务特定参数的学习。由于共享空间与任务特定信息在优化过程中相互影响,导致这些方法在缓解负迁移方面存在局限。为此,本文提出一种新方法:在优化过程中动态分组任务并分批更新。我们设计了一种自适应算法,用于确定任务的有效分组方式与更新策略。为追踪任务间关系并同步优化多任务网络,引入可在线计算的近端任务亲和性(proximal inter-task affinity)。理论分析表明,将任务划分为多组并顺序更新,能显著提升任务特定参数的学习能力。实验结果显示,该方法显著优于现有多任务优化方法,并具备良好的可扩展性,适用于不同架构及任务数量。
原文摘要 · Abstract (English)
Multi-task learning enables the acquisition of task-generic knowledge by training multiple tasks within a unified architecture. However, training all tasks together in a single architecture can lead to performance degradation, known as negative transfer, which is a main concern in multi-task learning. Previous works have addressed this issue by optimizing the multi-task network through gradient manipulation or weighted loss adjustments. However, their optimization strategy focuses on addressing task imbalance in shared parameters, neglecting the learning of task-specific parameters. As a result, they show limitations in mitigating negative transfer, since the learning of shared space and task-specific information influences each other during optimization. To address this, we propose a different approach to enhance multi-task performance by selectively grouping tasks and updating them for each batch during optimization. We introduce an algorithm that adaptively determines how to effectively group tasks and update them during the learning process. To track inter-task relations and optimize multi-task networks simultaneously, we propose proximal inter-task affinity, which can be measured during the optimization process. We provide a theoretical analysis on how dividing tasks into multiple groups and updating them sequentially significantly affects multi-task performance by enhancing the learning of task-specific parameters. Our methods substantially outperform previous multi-task optimization approaches and are scalable to different architectures and various numbers of tasks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。