Merge++: Universal Merge Refinement Through Data-Free Checkpoint Inversion
Organizations: IIT Hyderabad · Microsoft Research, India
Abstract
Model merging consolidates fine-tuned experts into one multi-task model without retraining. All existing data-free methods approach this problem entirely in weight space. Restricted to arithmetic on parameters, these methods never observe how each expert behaves, a signal that only emerges through forward evaluation. Accessing this behavioral signal requires inputs to evaluate on, which the data-free setting prohibits. We propose Merge++, a post-hoc method that addresses this by inverting the expert checkpoints to synthesize task-representative images, then distilling expert knowledge into the merged model using those images. Merge++ requires no additional data beyond the checkpoints themselves. It applies universally across merging algorithms and operates as a complementary refinement stage independent of the underlying weight-space method. The method consistently improves merging algorithms ranging from simple task arithmetic to state-of-the-art spectral methods, with average gains of +2 to +8 points and up to +25.9 on individual configurations.
Figures & tables
| ViT-B/32 | ViT-B/16 | ViT-L/14 | ||||||||
| Method | 8T | 14T | 20T | 8T | 14T | 20T | 8T | 14T | 20T | |
| TA [ICLR’23] | base | 69.0 | 53.1 | 33.6 | 75.7 | 56.6 | 32.8 | 84.1 | 58.4 | 38.1 |
| +MERGE++ | +6.6 | +12.6 | +21.6 | +4.6 | +12.1 | +21.1 | +1.6 | +18.7 | +25.9 | |
| TIES [NeurIPS’23] | base | 72.8 | 43.2 | 37.4 | 77.1 | 35.4 | 26.5 | 84.5 | 63.2 | 63.7 |
| +MERGE++ | +3.5 | +5.1 | +5.3 | +3.1 | +5.5 | +5.2 | +0.5 | +5.2 | +2.5 | |
| Iso-CTS [ICML’25] | base | 82.7 | 75.7 | 63.7 | 87.6 | 77.9 | 64.4 | 92.2 | 87.9 | 79.4 |