mlsanityData to 14 Oct 2026

PT-MoE: An Efficient Finetuning Framework for Integrating Mixture-of-Experts into Prompt Tuning

arXiv 2505.09519 ↗First posted 14 May 2025cs.CLcited by 6

On the map: Mixture-of-experts → MoE large language models

Abstract (arXiv)

Parameter-efficient fine-tuning (PEFT) methods have shown promise in adapting large language models, yet existing approaches exhibit counter-intuitive phenomena: integrating router into prompt tuning (PT) increases training efficiency yet does not improve performance universally; parameter reduction through matrix decomposition can improve performance in specific domains. Motivated by these observations and the modular nature of PT, we propose PT-MoE, a novel framework that integrates matrix decomposition with mixture-of-experts (MoE) routing for efficient PT. Results across 17 datasets demonstrate that PT-MoE achieves state-of-the-art performance in both question answering (QA) and mathematical problem solving tasks, improving F1 score by 1.49 points over PT and 2.13 points over LoRA in QA tasks, while enhancing mathematical accuracy by 10.75 points over PT and 0.44 points over LoRA, all while using 25% fewer parameters than LoRA. Our analysis reveals that while PT methods generally excel in QA tasks and LoRA-based methods in math datasets, the integration of matrix decomposition and MoE in PT-MoE yields complementary benefits: decomposition enables efficient parameter sharing across experts while MoE provides dynamic adaptation, collectively enabling PT-MoE to demonstrate cross-task consistency and generalization abilities. These findings, along with ablation studies on routing mechanisms and architectural components, provide insights for future PEFT methods.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 27 of its 45 references that are in the map. First posted on arXiv 14 May 2025.

Builds on

27 of 45 references.

References · 27

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  5. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  6. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  7. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  8. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
  9. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  10. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
  11. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
  12. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
15 more
  1. 2017Zero-Shot Relation Extraction via Reading Comprehensioncited by 426
  2. 2021A Diverse Corpus for Evaluating and Developing English Math Word Problem Solverscited by 318
  3. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  4. 2017SearchQA: A New Q&A Dataset Augmented with Context from a Search Enginecited by 225
  5. 2019MRQA 2019 Shared Task: Evaluating Generalization in Reading Comprehensioncited by 184
  6. 2023Multitask Prompt Tuning Enables Parameter-Efficient Transfer Learningcited by 115
  7. 2022ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Promptscited by 85
  8. 2018DuoRC: Towards Complex Language Understanding with Paraphrased Reading Comprehensioncited by 71
  9. 2024Prompt Compression for Large Language Models: A Surveycited by 67
  10. 2023Residual Prompt Tuning: Improving Prompt Tuning with Residual Reparameterizationcited by 64
  11. 2024500xCompressor: Generalized Prompt Compression for Large Language Modelscited by 47
  12. 2023DePT: Decomposed Prompt Tuning for Parameter-Efficient Fine-tuningcited by 35
  13. 2022XPrompt: Exploring the Extreme of Prompt Tuningcited by 30
  14. 2023Decomposed Prompt Tuning via Low-Rank Reparameterizationcited by 8
  15. 2023Efficient Cross-Task Prompt Tuning for Few-Shot Conversational Emotion Recognitioncited by 5

Built on by

Cited by year (2026 to 14 Oct)

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

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025FlyLoRA: Boosting Task Decoupling and Parameter Efficiency via Implicit Rank-Wise Mixture-of-Experts
  2. 2026Flexi-LoRA with Input-Adaptive Ranks: Efficient Finetuning for Speech and Reasoning Tasks
  3. 2025Parameter-Efficient Routed Fine-Tuning: Mixture-of-Experts Demands Mixture of Adaptation Modules
  4. 2026DAG-MoE: From Simple Mixture to Structural Aggregation in Mixture-of-Experts
  5. 2024MoELoRA: Contrastive Learning Guided Mixture of Experts on Parameter-Efficient Fine-Tuning for Large Language Models
  6. 2025PAFT: Prompt-Agnostic Fine-Tuning
  7. 2026Monkey Jump : MoE-Style PEFT for Efficient Multi-Task Learning
  8. 2026Routing-Aligned Fine-Tuning for Multilingual Downstream Tasks in Mixture-of-Experts Models