迈向多任务学习中有原则的任务分组
Towards Principled Task Grouping for Multi-Task Learning
AI总结:
针对多任务学习中的正负迁移冲突,本文提出一种有理论依据、可纳入多种资源约束的任务分组数学规划方法,并在视觉、组合优化和时间序列任务上验证其优于基线且保持效率。
摘要:
多任务学习(MTL)旨在利用任务之间的共享信息来提高学习效率和准确性。然而,MTL往往难以有效管理任务之间的正迁移和负迁移,这可能会阻碍性能提升。任务分组通过将任务组织成有意义的簇来应对这一挑战,在最大化有益迁移的同时最小化有害交互。本文介绍了一种MTL中有原则的任务分组方法,通过解决关键的理论和实践局限,超越了现有方法。与以往研究不同,我们的方法提供了一种具有理论基础的途径,在构建迁移增益时不依赖限制性假设。我们还提出了一种灵活的数学规划形式,可容纳广泛的资源约束,从而增强其通用性。在包括计算机视觉数据集、组合优化基准和时间序列任务在内的多个领域的实验结果表明,我们的方法优于大量基线方法,从而验证了其在MTL中的有效性和广泛适用性,且不会牺牲效率。
英文摘要:
Multi-task learning (MTL) aims to leverage shared information among tasks to improve learning efficiency and accuracy. However, MTL often struggles to effectively manage positive and negative transfer between tasks, which can hinder performance improvements. Task grouping addresses this challenge by organizing tasks into meaningful clusters, maximizing beneficial transfer while minimizing detrimental interactions. This paper introduces a principled approach to task grouping in MTL, advancing beyond existing methods by addressing key theoretical and practical limitations. Unlike prior studies, our method offers a theoretically grounded approach that does not depend on restrictive assumptions for constructing transfer gains. We also present a flexible mathematical programming formulation that accommodates a wide range of resource constraints, thereby enhancing its versatility. Experimental results across diverse domains, including computer vision datasets, combinatorial optimization benchmarks, and time series tasks, demonstrate the superiority of our method over extensive baselines, thereby validating its effectiveness and general applicability in MTL without sacrificing efficiency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。