paper-with-me

홈 › Papers

Adaptive and Fine-grained Module-wise Expert Pruning for Efficient LoRA-MoE Fine-Tuning

2026-04-29 · Weihang Li, Jianchun Liu, Hongli Xu arxiv

LoRA-MoE has emerged as an effective paradigm for parameter-efficient fine-tuning, combining the low training cost of LoRA with the increased adaptation capacity of Mixture-of-Experts (MoE). However, existing LoRA-MoE frameworks typically adopt a fixed and uniform expert configuration across heterogeneous Transformer modules (\eg, attention query/key projections and MLP gating networks), ignoring their distinct functional roles and capacity requirements. This design leads to localized over-provisioning, redundant trainable parameters, and unnecessary optimizer-state overhead. Moreover, prior methods enforce load balancing among experts throughout training. Although beneficial in the early stage, this constraint becomes restrictive once routing patterns stabilize, limiting expert specialization on downstream tasks. In this paper, we propose DMEP, a novel LoRA-MoE fine-tuning framework based on Dynamic Module-wise Expert Pruning. DMEP tracks expert utilization during training and physically removes low-utility experts on a per-module basis, yielding a more compact expert structure tailored to different modules. The pruned model then continues training without the load-balancing constraint, freeing the remaining experts to focus entirely on the downstream task and develop specialized expertise. By jointly adapting module-wise expert capacity and eliminating unnecessary balancing, DMEP improves both parameter efficiency and training efficiency. Extensive experiments on multiple reasoning benchmarks show that DMEP reduces trainable parameters by 35\%--43\% and improves training throughput by about 10\%, while maintaining or surpassing the downstream reasoning accuracy of uniform LoRA-MoE baselines.

📄 PDF Abstract BibTeX arXiv:2604.26340

Code (0)

등록된 구현이 없습니다.

Tasks

parameter-efficient fine-tuning

Similar Papers 제목 키워드 기반

Task-Oriented Channel Attention for Fine-Grained Few-Shot Classification

2023-07-28 · SuBeen Lee, WonJun Moon, Hyun Seok Seong, Jae-Pil Heo

The difficulty of the fine-grained image classification mainly comes from a shared overall appearance across classes. Thus, recognizing discriminative details, such as eyes and beaks for birds, is a key in the task. Howe…

Cross-Domain Few-ShotFine-Grained Image Classificationimage-classificationImage Classification

LookWise: Knowing When and Where to Look for Fine-Grained Visual Reasoning in Multimodal Large Language Models

2026-02-26 · Yuxiang Shen, Hailong Huang, Zhenkun Gao, Xueheng Li 외 arxiv

Multimodal Large Language Models (MLLMs) are shifting towards "Thinking with Images" by actively exploring image details. While effective, large-scale training is computationally expensive, which has spurred growing inte…

Visual Reasoning

Task Discrepancy Maximization for Fine-grained Few-Shot Classification

2022-07-04 · CVPR 2022 1 · SuBeen Lee, WonJun Moon, Jae-Pil Heo

Recognizing discriminative details such as eyes and beaks is important for distinguishing fine-grained classes since they have similar overall appearances. In this regard, we introduce Task Discrepancy Maximization (TDM)…

ClassificationFew-Shot Image Classification

A Feature Consistency Driven Attention Erasing Network for Fine-Grained Image Retrieval

2021-10-09 · Qi Zhao, Xu Wang, Shuchang Lyu, Binghao Liu 외

Large-scale fine-grained image retrieval has two main problems. First, low dimensional feature embedding can fasten the retrieval process but bring accuracy reduce due to overlooking the feature of significant attention …

Image RetrievalRetrieval

SmartFont: Dynamic Condition Allocation for Few-Shot Font Generation

2026-06-11 · Zian Yang, Zixin Wang arxiv

Few-shot font generation simultaneously requires global structural completeness and fine-grained local style fidelity. Existing methods usually either rely on global content-style modeling, which is robust but imperfectl…