cs.LGSep 19, 2026

Merge++: Universal Merge Refinement Through Data-Free Checkpoint Inversion

Authors: Aditya Pola, Vineeth N. Balasubramanian

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

Explore similar work

CardsList
  1. Model Merging by Output-Space Projection

    May 27, 2026Bethan Evans, Benjamin Etheridge, Stephen Roberts +1Quadratic ProgrammingLanguage Model Merging

  2. A Broader Look at Model Merging: Rethinking Implicit Regularization Induced by Task Arithmetic

    Oct 6, 2026Sin-Han Yang, Shih-Cheng Huang, Chieh-Yen Lin +3Task Vector MergingMulti-Task Optimization

  3. Resolving Interference (RI): Disentangling Models for Improved Model Merging

    Mar 13, 2026Pratik Ramesh, George Stoica, Arun Iyer +2Model Merging