Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have shown remarkable promise but remain challenging to continually improve through traditional finetuning, particularly when integrating capabilities from other specialized LLMs. Popular methods like ensemble and weight merging require substantial memory and struggle to adapt to changing data environments. Recent efforts have transferred knowledge from multiple LLMs into a single target model; however, they suffer from interference and degraded performance among tasks, largely due to limited flexibility in candidate selection and training pipelines. To address these issues, we propose a framework that adaptively selects and aggregates knowledge from diverse LLMs to build a single, stronger model, avoiding the high memory overhead of ensemble and inflexible weight merging. Specifically, we design an adaptive selection network that identifies the most relevant source LLMs based on their scores, thereby reducing knowledge interference. We further propose a dynamic weighted fusion strategy that accounts for the inherent strengths of candidate LLMs, along with a feedback-driven loss function that prevents the selector from converging on a single subset of sources. Experimental results demonstrate that our method can enable a more stable and scalable knowledge aggregation process while reducing knowledge interference by up to 50% compared to existing approaches. Code is avaliable at https://github.com/ZLKong/LLM_Integration
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 53 of its 65 references that are in the map. First posted on arXiv 28 May 2025.
Builds on
53 of 65 references.
References · 53
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
38 more
- 2024Mixtral of Expertscited by 1,823
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2024Yi: Open Foundation Models by 01.AIcited by 719
- 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 564
- 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 399
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2024Evolutionary Optimization of Model Merging Recipescited by 208
- 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 194
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 156
- 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
- 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 145
- 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
- 2024Knowledge Fusion of Large Language Modelscited by 115
- 2023The MiniPile Challenge for Data-Efficient Language Modelscited by 75
- 2024Pack of LLMs: Model Fusion at Test-Time via Perplexity Optimizationcited by 56
- 2024FuseChat: Knowledge Fusion of Chat Modelscited by 55
- 2024Med42 -- Evaluating Fine-Tuning Strategies for Medical LLMs: Full-Parameter vs. Parameter-Efficient Approachescited by 52
- 2025Token Reduction Should Go Beyond Efficiency in Generative Models -- From Vision, Language to Multimodalitycited by 50
- 2023Fusing Models with Complementary Expertisecited by 46
- 2023Towards the Law of Capacity Gap in Distilling Language Modelscited by 44
- 2020Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruningcited by 39
- 2023Knowledge Unlearning for LLMs: Tasks, Methods, and Challengescited by 38
- 2023Agile-Quant: Activation-Guided Quantization for Faster Inference of LLMs on the Edgecited by 33
- 2021More but Correct: Generating Diversified and Entity-revised Medical Responsecited by 31
- 2024Rehearsal-Free Modular and Compositional Continual Learning for Language Modelscited by 27
- 2024Pruning Foundation Models for High Accuracy without Retrainingcited by 20
- 2024Squat: Quant Small Language Models on the Edgecited by 16
- 2024Rethinking Token Reduction for State Space Modelscited by 15
- 2024Toward Adaptive Large Language Models Structured Pruning via Hybrid-grained Weight Importance Assessmentcited by 13
- 2022Towards Better Chinese-centric Neural Machine Translation for Low-resource Languagescited by 11
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.