mlsanityData to 14 Oct 2026

CABS: Conflict-Aware and Balanced Sparsification for Enhancing Model Merging

arXiv 2503.01874 ↗First posted 26 Feb 2025cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

Model merging based on task vectors, i.e., the parameter differences between fine-tuned models and a shared base model, provides an efficient way to integrate multiple task-specific models into a multitask model without retraining. Recent works have endeavored to address the conflicts between task vectors, one of the significant challenges faced by model merging, through sparsification; however, two issues significantly limit their performance: high parameter overlap and unbalanced weight distribution. To address these issues, we propose a simple, yet effective framework called CABS (Conflict-Aware and Balanced Sparsification), consisting of Conflict-Aware Sparsification (CA) and Balanced Sparsification (BS). CA can reduce parameter overlap by applying masks during sequential pruning, ensuring that each task vector retains distinct, non-overlapping parameters. BS leverages n: m pruning to preserve critical weights while maintaining an even distribution across layers. Our comprehensive experiments demonstrate that CABS outperforms state-of-the-art methods across diverse tasks and model sizes.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 41 of its 56 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

41 of 56 references.

References · 41

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  4. 2024Qwen2.5 Technical Reportcited by 4,942
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  6. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  7. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  9. 2023Mistral 7Bcited by 3,164
  10. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
  11. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  12. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
29 more
  1. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  2. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  3. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
  4. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  5. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  6. 2022Editing Models with Task Arithmeticcited by 1,120
  7. 2018Neural Network Acceptability Judgmentscited by 958
  8. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
  9. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  10. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  11. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  12. 2021Merging Models with Fisher-Weighted Averagingcited by 621
  13. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  14. 2018Rethinking the Value of Network Pruningcited by 599
  15. 2019The State of Sparsity in Deep Neural Networkscited by 476
  16. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
  17. 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 263
  18. 2019Model Fusion via Optimal Transportcited by 219
  19. 2024Evolutionary Optimization of Model Merging Recipescited by 208
  20. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  21. 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
  22. 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
  23. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 133
  24. 2021BERT Busters: Outlier Dimensions that Disrupt Transformerscited by 112
  25. 2023Deep Model Fusion: A Surveycited by 91
  26. 2022Outliers Dimensions that Disrupt Transformers Are Driven by Frequencycited by 55
  27. 2024Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmeticcited by 50
  28. 2022KOBEST: Korean Balanced Evaluation of Significant Taskscited by 37
  29. 2024Online Merging Optimizers for Boosting Rewards and Mitigating Tax in Alignmentcited by 28

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 5.

8 papers.