mlsanityData to 13 Oct 2026

FW-Merging: Scaling Model Merging with Frank-Wolfe Optimization

arXiv 2503.12649 ↗First posted 16 Mar 2025cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Model merging has emerged as a promising approach for multi-task learning (MTL), offering a data-efficient alternative to conventional fine-tuning. However, with the rapid development of the open-source AI ecosystem and the increasing availability of fine-tuned foundation models, existing model merging methods face two key limitations: (i) They are primarily designed for in-house fine-tuned models, making them less adaptable to diverse model sources with partially unknown model and task information, (ii) They struggle to scale effectively when merging numerous model checkpoints. To address these challenges, we formulate model merging as a constrained optimization problem and introduce a novel approach: Frank-Wolfe Merging (FW-Merging). Inspired by Frank-Wolfe optimization, our approach iteratively selects the most relevant model in the pool to minimize a linear approximation of the objective function and then executes a local merging similar to the Frank-Wolfe update. The objective function is designed to capture the desired behavior of the target-merged model, while the fine-tuned candidate models define the constraint set. More importantly, FW-Merging serves as an orthogonal technique for existing merging methods, seamlessly integrating with them to further enhance accuracy performance. Our experiments show that FW-Merging scales across diverse model sources, remaining stable with 16 irrelevant models and improving by 15.3% with 16 relevant models on 20 CV tasks, while maintaining constant memory overhead, unlike the linear overhead of data-informed merging methods. Compared with the state-of-the-art approaches, FW-Merging surpasses the data-free merging method by 32.8% and outperforms the data-informed Adamerging by 8.39% when merging 20 ViT models. Our code is open-sourced at github.com/hmarkc/FW-Merging.

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). Builds on 45 of its 74 references that are in the map. First posted on arXiv 16 Mar 2025.

Builds on

45 of 74 references.

References · 45

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,231
  2. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,322
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,979
  4. 2021Evaluating Large Language Models Trained on Codecited by 8,205
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,880
  6. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,328
  7. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,898
  8. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,785
  9. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,388
  10. 2013Describing Textures in the Wildcited by 2,115
  11. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,492
  12. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,384
33 more
  1. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,289
  2. 2019PubMedQA: A Dataset for Biomedical Research Question Answeringcited by 1,281
  3. 2020Gradient Surgery for Multi-Task Learningcited by 1,225
  4. 2014How transferable are features in deep neural networks?cited by 1,219
  5. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,202
  6. 2022Editing Models with Task Arithmeticcited by 1,101
  7. 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 822
  8. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 810
  9. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 808
  10. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
  11. 2021Merging Models with Fisher-Weighted Averagingcited by 617
  12. 2018End-to-End Multi-Task Learning with Attentioncited by 533
  13. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 463
  14. 2018Rotation Equivariant CNNs for Digital Pathologycited by 420
  15. 2018Deep Learning for Classical Japanese Literaturecited by 418
  16. 2023Fine-Tuning Language Models with Just Forward Passescited by 340
  17. 2013Challenges in Representation Learning: A report on three machine learning contestscited by 301
  18. 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 249
  19. 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 199
  20. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 196
  21. 2014Qualitatively characterizing neural network optimization problemscited by 187
  22. 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 159
  23. 2024Localizing Task Information for Improved Model Merging and Compressioncited by 130
  24. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 115
  25. 2024Representation Surgery for Multi-Task Model Mergingcited by 95
  26. 2021Federated Learning: Opportunities and Challengescited by 84
  27. 2016Convergence Rate of Frank-Wolfe for Non-Convex Objectivescited by 60
  28. 2023UnIVAL: Unified Model for Image, Video, Audio and Language Taskscited by 45
  29. 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
  30. 2023Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusioncited by 36
  31. 2023ForkMerge: Mitigating Negative Transfer in Auxiliary-Task Learningcited by 28
  32. 2024Unleashing the Power of Multi-Task Learning: A Comprehensive Survey Spanning Traditional, Deep, and Pretrained Foundation Model Erascited by 26
  33. 2022lo-fi: distributed fine-tuning without communicationcited by 19

Built on by

Cited by year (2026 to 13 Oct)

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

5 papers.