Foldable SuperNets: Scalable Merging of Transformers with Different Initializations and Tasks
<|reference_start|>Foldable SuperNets: Scalable Merging of Transformers with Different Initializations and Tasks: Many recent methods aim to merge neural networks (NNs) with identical architectures trained on different tasks to obtain a single multi-task model. Most existing works tackle the simpler setup of merging NNs initialized from a common pre-trained network, where simple heuristics like weight averaging work well. This work targets a more challenging goal: merging large transformers trained on different tasks from distinct initializations. First, we demonstrate that traditional merging methods fail catastrophically in this setup. To overcome this challenge, we propose Foldable SuperNet Merge (FS-Merge), a method that optimizes a SuperNet to fuse the original models using a feature reconstruction loss. FS-Merge is simple, data-efficient, and capable of merging models of varying widths. We test FS-Merge against existing methods, including knowledge distillation, on MLPs and transformers across various settings, sizes, tasks, and modalities. FS-Merge consistently outperforms them, achieving SOTA results, particularly in limited data scenarios.<|reference_end|>
@article{kinderman2024foldable,
    title={Foldable SuperNets: Scalable Merging of Transformers with Different
  Initializations and Tasks},
    author={Edan Kinderman, Itay Hubara, Haggai Maron, Daniel Soudry},
    journal={arXiv preprint arXiv:2410.01483},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01483},
    primaryClass={cs.LG}
}