- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes UniMerge, a framework for architecture-level merging of heterogeneous pretrained models. It formulates layer selection as an MDP, uses parameter-derived layer embeddings and contrastive actor-critic search to select inference paths, and introduces knowledge-distillation-based glue layers to align representations across adjacent layers. Experiments cover language and vision models, including models with different widths and depths.
Critical strengths
-
The paper addresses two important challenges in architecture-level merging: searching over layer combinations and maintaining compatible representations when connecting layers from different models.
-
The experiments cover multiple model families and tasks, and the cross-scale experiments are a useful attempt to extend architecture-level merging beyond models with identical structures.
Critical weaknesses
-
Although UniMerge is compared with alternative search strategies under a matched candidate-evaluation budget, this does not ensure equal end-to-end computational cost. UniMerge incurs additional overhead from SVD preprocessing, representation learning, and PPO training, while its hyperparameters are selected through grid search on smaller models. A wall-clock-matched comparison that accounts for preprocessing, hyperparameter tuning, and search would better establish whether UniMerge provides a genuine efficiency advantage.
-
Generalization of the learned search policy. The PPO policy selects candidate layers based on their embeddings and previously selected layers, but it remains unclear whether a trained policy can generalize to unseen model architectures or candidate pools without retraining.
Questions for authors
Q1.Can the authors compare UniMerge with alternative search strategies under the same end-to-end wall-clock or compute budget, including preprocessing and hyperparameter tuning? Does UniMerge retain its performance advantage under such a comparison?
Q2.Does the learned PPO policy generalize to unseen model combinations without retraining, or must the policy and Glue layers be optimized separately for each merging task? Can the authors evaluate cross-task or cross-model transfer of a trained policy and compare its performance and computational cost with training a new policy from scratch?