Model merging has emerged as a cost-efficient approximation to multitask learning. Among merging strategies, task arithmetic (Ilharco et al., 2022) is notable for its simplicity and effectiveness. In this work, we provide a theoretical motivation for task vectors by highlighting that, under single-epoch full-batch gradient descent, they are equivalent to multitask gradients. This insight leads us to reinterpret model merging as a single step in an iterative procedure that Alternates between Tuning and Merging (ATM). We propose two applications of ATM: (1) as an alternative to multitask learning in scenarios where data sharing is restricted (e.g., federated settings), and (2) as a lightweight refinement step to improve existing model merging methods using a small validation set. Experiments across diverse vision tasks demonstrate the effectiveness of ATM.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

ATM: Improving Model Merging by Alternating Tuning and Merging

  • Luca Zhou,
  • Daniele Solombrino,
  • Donato Crisostomi,
  • Maria Sofia Bucarelli,
  • Fabrizio Silvestri,
  • Emanuele Rodolà

摘要

Model merging has emerged as a cost-efficient approximation to multitask learning. Among merging strategies, task arithmetic (Ilharco et al., 2022) is notable for its simplicity and effectiveness. In this work, we provide a theoretical motivation for task vectors by highlighting that, under single-epoch full-batch gradient descent, they are equivalent to multitask gradients. This insight leads us to reinterpret model merging as a single step in an iterative procedure that Alternates between Tuning and Merging (ATM). We propose two applications of ATM: (1) as an alternative to multitask learning in scenarios where data sharing is restricted (e.g., federated settings), and (2) as a lightweight refinement step to improve existing model merging methods using a small validation set. Experiments across diverse vision tasks demonstrate the effectiveness of ATM.