C2M3: Cycle-Consistent Multi-Model Merging

Donato Crisostomi, M. Fumero, Daniele Baieri, F. Bernard, E. Rodolà
5/1/2024

No official code found. Best implementation: crisostomi/cycle-consistent-model-merging (13 stars, MIT, last commit 2025-08-20). 1 more below.

Abstract

In this paper, we present a novel data-free method for merging neural networks in weight space. Differently from most existing works, our method optimizes for the permutations of network neurons globally across all layers. This allows us to enforce cycle consistency of the permutations when merging $N \geq 3$ models, allowing circular compositions of permutations to be computed without accumulating error along the path. We qualitatively and quantitatively motivate the need for such a constraint, showing its benefits when merging sets of models in scenarios spanning varying architectures and datasets. We finally show that, when coupled with activation renormalization, our approach yields the best results in the task.

View on arXivView PDF

Code Implementations(2)

MIT

Codebase for "C2M3: Cycle-Consistent Multi-Model Merging".

134HTML, ShellAug 3, 20231 years agoMIT
cycle-consistencydeep-learningmatchingmodel-merging

Side experiment for "C2M3: Cycle-Consistent Multi-Model Merging".

00Python, Jupyter NotebookAug 21, 20251 years ago
cycle-consistencydeep-learningfederated-learningmodel-merging

Cite this paper

@article{crisostomi2024cm,
  title  = {C2M3: Cycle-Consistent Multi-Model Merging},
  author = {Donato Crisostomi and M. Fumero and Daniele Baieri and F. Bernard and E. Rodolà},
  year   = {2024},
  eprint = {2405.17897},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2405.17897},
  url    = {https://arxiv.org/abs/2405.17897},
  journal = {NEURIPS 2024 2024}
}

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/2405.17897.svg)](https://codeofpaper.com/paper/2405.17897)

Discussion