How to Weight Multitask Finetuning? Fast Previews via Bayesian Model-Merging
Hugo Monzón Maldonado, Thomas Möllenhoff, Nico Daheim, Iryna Gurevych, Mohammad Emtiyaz Khan
TL;DR
This paper tackles the challenge of selecting task weights in multitask finetuning by introducing fast previews based on Bayesian model merging. It recasts merging as weighted surrogate minimization and derives a principled framework using exponential-family posteriors, with variational and mixture-based extensions to improve preview quality. The authors implement practical algorithms (AdamW-SG, IVON-Hess, MultiIVON-Hess) and validate them across vision and language benchmarks, showing that more expressive posteriors yield previews that closely track full multitask finetuning while drastically reducing compute. The results indicate that bayesianly-informed merging provides reliable guidance for weight selection, enabling scalable multitask adaptation for large models and diverse tasks.
Abstract
When finetuning multiple tasks altogether, it is important to carefully weigh them to get a good performance, but searching for good weights can be difficult and costly. Here, we propose to aid the search with fast previews to quickly get a rough idea of different reweighting options. We use model merging to create previews by simply reusing and averaging parameters of models trained on each task separately (no retraining required). To improve the quality of previews, we propose a Bayesian approach to design new merging strategies by using more flexible posteriors. We validate our findings on vision and natural-language transformers. Our work shows the benefits of model merging via Bayes to improve multitask finetuning.
