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
12/11/2024
cs.LGcs.AIstat.ML

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{maldonado2024weight,
  title  = {How to Weight Multitask Finetuning? Fast Previews via Bayesian Model-Merging},
  author = {Hugo Monzón Maldonado and Thomas Möllenhoff and Nico Daheim and Iryna Gurevych and Mohammad Emtiyaz Khan},
  year   = {2024},
  eprint = {2412.08147},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.08147v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2412.08147.svg)](https://codeofpaper.com/paper/2412.08147)

Discussion