arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.07985cs.LGcs.AIcs.CV
收藏

多任务学习中基于解析不确定性的损失加权

Analytical Uncertainty-Based Loss Weighting in Multi-Task Learning

University of Mannheim(曼海姆大学);Center for AI, Robert Bosch(罗伯特·博世公司人工智能中心);MPI for Intelligent Systems(马克斯·普朗克智能系统研究所)

Lukas Kirchdorfer, Cathrin Elich, Simon Kutsche, Heiner Stuckenschmidt, Lukas Schott, Jan M. Köhler

AI总结:

针对多任务学习中任务损失平衡的难题,提出基于解析不确定性、带可调温度softmax归一化的新型加权方法,性能优于六种常用方法,接近暴力标量化方案且成本更低,还给出实用实验发现。

摘要:

随着神经网络在各领域的兴起,多任务学习(MTL)的重要性日益凸显。MTL的一大核心挑战是在神经网络训练过程中平衡各任务的损失,从而通过任务间的知识共享提升性能与效率。为应对这些挑战,我们在最主流的不确定性加权(Uncertainty Weighting)方法基础上,提出了一种全新的任务加权方法,通过解析方式计算基于不确定性的最优权重,并用带可调温度的softmax函数进行归一化。我们的方法取得了与计算量极大、难以实现的暴力搜索标量化(Scalarization)方法相当的效果,同时提供了一种成本更低、性能优异的替代方案。我们在多个数据集和架构上开展了广泛的基准测试,我们的方法始终优于另外六种常用加权方法。此外,我们还报告了对MTL实际应用颇具价值的实验发现:例如,更大的网络会降低加权方法的影响,且与学习率相比,调整权重衰减的影响很小。

英文摘要:

With the rise of neural networks in various domains, multi-task learning (MTL) gained significant relevance. A key challenge in MTL is balancing individual task losses during neural network training to improve performance and efficiency through knowledge sharing across tasks. To address these challenges, we propose a novel task-weighting method by building on the most prevalent approach of Uncertainty Weighting and computing analytically optimal uncertainty-based weights, normalized by a softmax function with tunable temperature. Our approach yields comparable results to the combinatorially prohibitive, brute-force approach of Scalarization while offering a more cost-effective yet high-performing alternative. We conduct an extensive benchmark on various datasets and architectures. Our method consistently outperforms six other common weighting methods. Furthermore, we report noteworthy experimental findings for the practical application of MTL. For example, larger networks diminish the influence of weighting methods, and tuning the weight decay has a low impact compared to the learning rate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑