Bridging Training and Merging Through Momentum-Aware Optimization
Not on the map. Why?
Abstract (arXiv)
Training large neural networks and merging task-specific models both exploit low-rank structure and require parameter importance estimation, yet these challenges have been pursued in isolation. Current workflows compute curvature information during training, discard it, then recompute similar information for merging--wasting computation and discarding valuable trajectory data. We introduce a unified framework that maintains factorized momentum and curvature statistics during training, then reuses this information for geometry-aware model composition. The proposed method incurs modest memory overhead (approximately 30% over AdamW) to accumulate task saliency scores that enable curvature-aware merging. These scores, computed as a byproduct of optimization, provide importance estimates comparable to post-hoc Fisher computation while producing merge-ready models directly from training. We establish convergence guarantees for non-convex objectives with approximation error bounded by gradient singular value decay. On natural language understanding benchmarks, curvature-aware parameter selection outperforms magnitude-only baselines across all sparsity levels, with multi-task merging improving 1.6% over strong baselines. The proposed framework exhibits rank-invariant convergence and superior hyperparameter robustness compared to existing low-rank optimizers. By treating the optimization trajectory as a reusable asset rather than discarding it, our approach demonstrates that training-time curvature information suffices for effective model composition, enabling a unified training-merging pipeline.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 38 references that are in the map. First posted on arXiv 18 Dec 2025.
Builds on
34 of 38 references.
References · 34
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
22 more
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 20218-bit Optimizers via Block-wise Quantizationcited by 403
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
- 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 192
- 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
- 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 133
- 2024APOLLO: SGD-like Memory, AdamW-level Performancecited by 54
- 2024LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statisticscited by 38
- 2023CAME: Confidence-guided Adaptive Memory Efficient Optimizationcited by 36
- 2025Low-rank Momentum Factorization for Memory Efficient Trainingcited by 4
- 2025Harnessing Optimization Dynamics for Curvature-Informed Model Mergingcited by 1
Built on by
Not cited yet.