Black-box Model Merging for Language-Model-as-a-Service with Massive Model Repositories
Not on the map. Why?
Abstract (arXiv)
Model merging refers to the process of integrating multiple distinct models into a unified model that preserves and combines the strengths and capabilities of the individual models. Most existing approaches rely on task vectors to combine models, typically under the assumption that model parameters are accessible. However, for extremely large language models (LLMs) such as GPT-4, which are often provided solely as black-box services through API interfaces (Language-Model-as-a-Service), model weights are not available to end users. This presents a significant challenge, which we refer to as black-box model merging (BMM) with massive LLMs. To address this challenge, we propose a derivative-free optimization framework based on the evolutionary algorithm (Evo-Merging) that enables effective model merging using only inference-time API queries. Our method consists of two key components: (1) sparsity-based denoising, designed to identify and filter out irrelevant or redundant information across models, and (2) sign-aware scaling, which dynamically computes optimal combination weights for the relevant models based on their performance. We also provide a formal justification, along with a theoretical analysis, for our asymmetric sparsification. Extensive experimental evaluations demonstrate that our approach achieves state-of-the-art results on a range of tasks, significantly outperforming existing strong baselines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 29 references that are in the map. First posted on arXiv 16 Sep 2025.
Builds on
19 of 29 references.
References · 19
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 364
- 2022Black-Box Tuning for Language-Model-as-a-Servicecited by 256
- 2023InstructUIE: Multi-task Instruction Tuning for Unified Information Extractioncited by 170
- 2024Model merging with SVD to tie the Knotscited by 122
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 116
- 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 110
- 2020CrossNER: Evaluating Cross-Domain Named Entity Recognitioncited by 104
7 more
- 2024DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Samplingcited by 81
- 2024Merging LoRAs like Playing LEGO: Pushing the Modularity of LoRA to Extremes Through Rank-Wise Clusteringcited by 59
- 2024LoRA-Flow: Dynamic LoRA Fusion for Large Language Models in Generative Taskscited by 39
- 2022Named Entity Recognition in Twitter: A Dataset and Analysis on Short-Term Temporal Shiftscited by 28
- 2019GCDT: A Global Context Enhanced Deep Transition Architecture for Sequence Labelingcited by 22
- 2024See Further for Parameter Efficient Fine-tuning by Standing on the Shoulders of Decompositioncited by 14
- 2025Adaptive LoRA Merge with Parameter Pruning for Low-Resource Generationcited by 5
Built on by
Not cited yet.