mlsanityData to 14 Oct 2026

Harnessing Optimization Dynamics for Curvature-Informed Model Merging

arXiv 2509.11167 ↗First posted 14 Sep 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Model merging is an effective post-training strategy for composing capabilities in large language models without joint retraining. We study this in the supervised fine-tuning (SFT) stage, where multiple capability-based SFT checkpoints -- spanning math, code, precise instruction following, general instruction following, and knowledge recall -- must be consolidated into a single model. We introduce Optimization Trajectory Aware (OTA) Merging, a curvature-aware aggregation that leverages optimizer second-moment statistics as a diagonal curvature proxy to reweight parameter edits and mitigate interference. Complementing OTA, we propose Fast Fisher Grafting (FFG), a curvature-driven task-localization step that sparsifies conflicting or low-importance edits. FFG induces extremely low-rank masks concentrated in early attention query/key projections and token embeddings, exploiting shared curvature across capabilities. We further develop a memory-light compression of the second moments that preserves OTA's effect. Across diverse capability-based SFT checkpoints, OTA+FFG improves merged-model quality over strong weight-space baselines, reduces negative transfer, and remains robust across sparsity levels. Analyses reveal substantial curvature overlap between checkpoints, offering a novel lens on why simple linear merging can be effective in practice. Ablations confirm that FFG is critical for reducing task interference and that the compressed second moments retain the gains of the full formulation. To facilitate reproducibility, we open-source all code, training and evaluation scripts, visualization artifacts, and capability-specific SFT checkpoints at https://github.com/pmahdavi/ota-merge.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 38 of its 45 references that are in the map. First posted on arXiv 14 Sep 2025.

Builds on

38 of 45 references.

References · 38

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  5. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  6. 2024LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Modelscited by 1,464
  7. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  8. 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
  9. 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,128
  10. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  11. 2022Editing Models with Task Arithmeticcited by 1,120
  12. 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
26 more
  1. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  2. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
  3. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  4. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  5. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  6. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  7. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  9. 2021Merging Models with Fisher-Weighted Averagingcited by 621
  10. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  11. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  12. 2014New insights and perspectives on the natural gradient methodcited by 443
  13. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  14. 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
  15. 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 194
  16. 2020Deep learning versus kernel learning: an empirical study of loss landscape geometry and the time evolution of the Neural Tangent Kernelcited by 187
  17. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 133
  18. 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 110
  19. 2023Task-Specific Skill Localization in Fine-tuned Language Modelscited by 105
  20. 2023Transformers as Support Vector Machinescited by 74
  21. 2024A New Perspective on Shampoo's Preconditionercited by 59
  22. 2024LoRA Soups: Merging LoRAs for Practical Skill Composition Taskscited by 52
  23. 2023Merging by Matching Models in Task Parameter Subspacescited by 36
  24. 2022Limitations of the NTK for Understanding Generalization in Deep Learningcited by 35
  25. 2025Fishers for Free? Approximating the Fisher Information Matrix by Recycling the Squared Gradient Accumulatorcited by 14
  26. 2024Multi LoRA Meets Vision: Merging multiple adapters to create a multi task modelcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.