提出高效多任务学习框架,解决梯度平衡计算慢的问题。
Feed m Birds with One Scone: Accelerating Multi-task Gradient Balancing via Bi-level Optimization
- 将多任务梯度平衡建模为双层优化问题,解耦训练与权重调整
- 采用零阶方法加速求解,显著降低计算开销
- 在公开与工业级数据集上均实现更快收敛和更优性能
多任务学习的目标是协同优化多个目标。近年来,如多梯度下降算法(MGDA)及其变体的方法通过动态调整各任务权重,在缓解任务间冲突、提升整体性能方面表现良好。然而,这类方法存在计算效率低的缺陷,需访问所有任务的梯度。本文提出MARIGOLD,一种统一的高效多任务学习算法框架。研究表明,多任务梯度平衡具有层次结构,模型训练与梯度平衡在整个优化过程中耦合,可视为双层优化问题。此外,我们证明可通过零阶方法高效求解该双层问题。在多个公开数据集和工业级数据集上的大量实验表明,该方法在效率和性能上均优于现有方法。
原文摘要 · Abstract (English)
In machine learning, the goal of multi-task learning (MTL) is to optimize multiple objectives together. Recent works, for example, Multiple Gradient Descent Algorithm (MGDA) and its variants, show promising results with dynamically adjusted weights for different tasks to mitigate conflicts that may potentially degrade the performance on certain tasks. Despite the empirical success of MGDA-type methods, one major limitation of such methods is their computational inefficiency, as they require access to all task gradients. In this paper we introduce MARIGOLD, a unified algorithmic framework for efficiently solving MTL problems. Our method reveals that multi-task gradient balancing methods have a hierarchical structure, in which the model training and the gradient balancing are coupled during the whole optimization process and can be viewed as a bi-level optimization problem. Moreover, we showcase that the bi-level problem can be solved efficiently by leveraging zeroth-order method. Extensive experiments on both public datasets and industrial-scale datasets demonstrate the efficiency and superiority of our method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。