Challenge: Existing methods to improve computational efficiency are under-explored and face several critical challenges.
Approach: They propose a method that selectively activates only a subset of the model's layers, skipping those deemed less important.
Outcome: The proposed method significantly improves performance on Attention layers and MoE layers while reducing redundant computation and memory usage.

Similar Papers

MoDification: Mixture of Depths Made Easy (2025.naacl-long)

Copied to clipboard

Challenge: Long-context efficiency is a trending topic in large language model (LLM) serving.
Approach: They propose a method to combine long-context efficiency and mixture of depths to bring down both latency and memory.
Outcome: The proposed method achieves 1.2 speedup in latency and 1.8 reduction in memory compared to original LLMs especially in long-context applications.
Dynamic Data Mixing Maximizes Instruction Tuning for Mixture-of-Experts (2025.naacl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) models are constrained by their fixed model capacities when the number of tasks grows in instruction tuning.
Approach: They propose to combine all training tasks and apply fixed sampling weights without considering the importance of different tasks as the model training state changes.
Outcome: The proposed method can be used on knowledge & reasoning tasks and open-ended queries with limited training budget.
DiffSkip: Differential Layer Skipping in Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing Large Language Models (LLMs) enforce uniform computation across all tokens.
Approach: They propose to dynamically skip FFN blocks based on self-attention difference . they propose to use a lightweight router module to do the same .
Outcome: The proposed model can skip FFN blocks even in token generation tasks.
DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution (2024.acl-long)

Copied to clipboard

Challenge: Existing parameter-efficient fine-tuning methods such as Low-Rank Adaptation ignore the differential parameter budget requirements across weight matrices, which may lead to suboptimal fine-uning outcomes.
Approach: They propose a parameter-efficient low-rank Adaptation method that decomposes high-rank LoRA layers into structured single-rank components and allows dynamic pruning of parameter budget .
Outcome: The proposed method outperforms LoRA and LoRA with the same parameter budget and performance.
A Closer Look into Mixture-of-Experts in Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Mixture-of-experts (MoE) architectures are gaining increasing attention for their unique properties and remarkable performance.
Approach: They propose a mixture-of-experts architecture that allows for model scaling without sacrificing computational efficiency.
Outcome: The proposed model increases model size without sacrificing computational efficiency . the proposed model is modular and can be used by a broad spectrum of practitioners .
Parameter-Efficient Routed Fine-Tuning: Mixture-of-Experts Demands Mixture of Adaptation Modules (2026.findings-eacl)

Copied to clipboard

Challenge: Existing Parameter-Efficient Fine-Tuning (PEFT) strategies that focus on specialized experts are not effective for Mixture-of-Experts (MoE).
Approach: They propose to integrate a dynamic routing mechanism among specialized experts in Mixture-of-Experts (MoE) .
Outcome: Extensive experiments on commonsense and math reasoning tasks validate the performance and efficiency of the proposed routed approach.
Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated considerable proficiency in general natural language processing tasks.
Approach: They propose a parameter-efficient sparsity crafting method which crafts dense models into sparse models using the mixture-of-experts architecture.
Outcome: The proposed method significantly reduces computational costs and GPU memory requirements, while maintaining the quality of approximation in function space.
HyperRouter: Towards Efficient Training and Inference of Sparse Mixture of Experts (2023.emnlp-main)

Copied to clipboard

Challenge: Recent studies suggest that fixing the routers can achieve competitive performance by alleviating the collapsing problem, where all experts eventually learn similar representations.
Approach: They propose a method that dynamically generates router parameters through a fixed hypernetwork and trainable embeddings to achieve a balance between training the routers and freezing them to learn an improved routing policy.
Outcome: Experiments on a wide range of tasks show that the proposed method performs better than existing methods.
Faster MoE LLM Inference for Extremely Large Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing inference optimizations for coarse-grained Mixture-of-Experts models implicitly assume a fixed activation budget, which is poorly understood.
Approach: They propose a training-free policy that adapts token-level activation using router confidence and entropy while remaining within the model’s original budget.
Outcome: The proposed skipping policy can provide substantial throughput gains, but optimal static schedules vary significantly across models and routing mechanisms.
MoExtend: Tuning New Experts for Modality and Task Extension (2024.acl-srw)

Copied to clipboard

Challenge: Existing instruction tuning methods for large language models (LLMs) are costly and difficult to implement.
Approach: They propose a framework to streamline the modality adaptation and extension of Mixture-of-Experts (MoE) models.
Outcome: The proposed framework enables rapid adaptation and extension to new modal data or tasks without tuning pretrained models.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations