mlsanityData to 13 Oct 2026

CAMEx: Curvature-aware Merging of Experts

arXiv 2502.18821 ↗First posted 26 Feb 2025cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Existing methods for merging experts during model training and fine-tuning predominantly rely on Euclidean geometry, which assumes a flat parameter space. This assumption can limit the model's generalization ability, especially during the pre-training phase, where the parameter manifold might exhibit more complex curvature. Curvature-aware merging methods typically require additional information and computational resources to approximate the Fisher Information Matrix, adding memory overhead. In this paper, we introduce CAMEx (Curvature-Aware Merging of Experts), a novel expert merging protocol that incorporates natural gradients to account for the non-Euclidean curvature of the parameter manifold. By leveraging natural gradients, CAMEx adapts more effectively to the structure of the parameter space, improving alignment between model updates and the manifold's geometry. This approach enhances both pre-training and fine-tuning, resulting in better optimization trajectories and improved generalization without the substantial memory overhead typically associated with curvature-aware methods. Our contributions are threefold: (1) CAMEx significantly outperforms traditional Euclidean-based expert merging techniques across various natural language processing tasks, leading to enhanced performance during pre-training and fine-tuning; (2) we introduce a dynamic merging architecture that optimizes resource utilization, achieving high performance while reducing computational costs, facilitating efficient scaling of large language models; and (3) we provide both theoretical and empirical evidence to demonstrate the efficiency of our proposed method. The code is publicly available at: https://github.com/kpup1710/CAMEx.

Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 51 of its 72 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

51 of 72 references.

References · 51

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,549
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,322
  4. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,376
  5. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,111
  6. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,492
  7. 2020Scaling Laws for Neural Language Modelscited by 6,494
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,880
  9. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,133
  10. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,463
  11. 2016Pointer Sentinel Mixture Modelscited by 3,047
  12. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,044
38 more
  1. 2022Training Compute-Optimal Large Language Modelscited by 2,972
  2. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,810
  3. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,676
  4. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,847
  5. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,618
  6. 2019Natural Adversarial Examplescited by 1,405
  7. 2022Editing Models with Task Arithmeticcited by 1,101
  8. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
  9. 2018Neural Network Acceptability Judgmentscited by 957
  10. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 787
  11. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 687
  12. 2022Mixture-of-Experts with Expert Choice Routingcited by 619
  13. 2021Merging Models with Fisher-Weighted Averagingcited by 617
  14. 2014New insights and perspectives on the natural gradient methodcited by 438
  15. 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 402
  16. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
  17. 2022Patching open-vocabulary models by interpolating weightscited by 190
  18. 2024Mixture of LoRA Expertscited by 181
  19. 2022On the Representation Collapse of Sparse Mixture of Expertscited by 156
  20. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 142
  21. 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 115
  22. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 106
  23. 2022StableMoE: Stable Routing Strategy for Mixture of Expertscited by 100
  24. 2022Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalizationcited by 97
  25. 2023Soft Merging of Experts with Adaptive Routingcited by 89
  26. 2019Meta-Curvaturecited by 70
  27. 2023Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformerscited by 59
  28. 2022ColD Fusion: Collaborative Descent for Distributed Multitask Finetuningcited by 52
  29. 2024Lory: Fully Differentiable Mixture-of-Experts for Autoregressive Language Model Pre-trainingcited by 37
  30. 2023Merging Experts into One: Improving Computational Efficiency of Mixture of Expertscited by 36
  31. 2023Omni-SMoLA: Boosting Generalist Multimodal Models with Soft Mixture of Low-rank Expertscited by 26
  32. 2024Mixture of Low-rank Experts for Transferable AI-Generated Image Detectioncited by 21
  33. 2020MomentumRNN: Integrating Momentum into Recurrent Neural Networkscited by 18
  34. 2021Convolutional Neural Network Compression through Generalized Kronecker Product Decompositioncited by 14
  35. 2023Robust Weight Signatures: Gaining Robustness as Easy as Patching Weights?cited by 13
  36. 2021How Does Momentum Benefit Deep Neural Networks Architecture Design? A Few Case Studiescited by 10
  37. 2024MomentumSMoE: Integrating Momentum into Sparse Mixture of Expertscited by 9
  38. 2025Tight Clusters Make Specialized Expertscited by 8

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 13 Oct)

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

4 papers.