Challenge: Mixture-of-Experts (MoE) models are crucial for scaling model capacity while controlling inference costs.
Approach: They propose an alternative training strategy that converts a dense CLIP model into a sparse MoE architecture.
Outcome: The proposed training strategy outperforms dense models on COCO and Flickr30k benchmarks.

Similar Papers

CLIP-MoE: Towards Building Mixture of Experts for CLIP with Diversified Multiplet Upcycling (2025.emnlp-main)

Copied to clipboard

Challenge: Recent studies found that CLIP can only encode one aspect of the feature space, leading to substantial information loss and indistinctive features.
Approach: They propose a model-agnostic approach that fine-tunes complementary CLIP models and transforms them into a CLIP-MoE.
Outcome: The proposed framework fine-tunes a series of complementary CLIP models and transforms them into a CLIP-MoE.
Efficiently Editing Mixture-of-Experts Models with Compressed Experts (2025.findings-emnlp)

Copied to clipboard

Challenge: Mixture-of-Experts models allow for efficient scaling of large language models . fewer experts reduce computational costs, while more experts improve performance .
Approach: They propose to activate only a subset of experts during training and inference . they propose compressed experts that preserve the most important experts .
Outcome: The proposed approach preserves the most important experts while replacing other auxiliary activated experts with compressed experts.
Masks Can be Learned as an Alternative to Experts (2025.acl-long)

Copied to clipboard

Challenge: a recent study shows that sparse activation techniques can reduce inference performance without sacrificing performance.
Approach: They propose to sparsify a pre-trained dense large language model into a mixture-of-experts architecture for faster inference.
Outcome: The proposed approach is more efficient than one-shot sparsification techniques . it achieves 97% performance retention on downstream tasks with only 50% of parameters activated .
Improved Sparse Upcycling for Instruction Tuning (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for sparse upcycling lead to performance degradation in instruction tuning scenarios.
Approach: They propose a representation-based approach to convert dense language models into sparsely activated ones by initializing router weights from language models.
Outcome: The proposed architecture improves model capabilities and routing consistency across multiple benchmarks.
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.
Sparse Mixers: Combining MoE and Mixing to build a more efficient BERT (2022.findings-emnlp)

Copied to clipboard

Challenge: Sparse Mixer encoder model outperforms BERT on GLUE and SuperGLUE, trains 65% faster and runs inference 61% faster.
Approach: They combine the capacity of sparsely gated Mixture-of-Experts (MoE) with the speed and stability of linear, mixing transformations to design the Sparse Mixer encoder model.
Outcome: The proposed model outperforms BERT on GLUE and SuperGLUE but trains and runs twice as fast.
Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) LLMs achieve higher performance with fewer active parameters, but are still difficult to deploy due to their immense parameter sizes.
Approach: They propose expert-level sparsification techniques to enhance the deployment efficiency of large language models by introducing plug-and-play expert pruning and skipping techniques.
Outcome: The proposed methods reduce model sizes and increase inference speed while maintaining satisfactory performance across a wide range of tasks.
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 .
XMoE: Sparse Models with Fine-grained and Adaptive Expert Selection (2024.findings-acl)

Copied to clipboard

Challenge: XMoE leverages small experts and a threshold-based router to selectively engage only essential parameters.
Approach: They propose a novel MoE that leverages small experts to selectively engage only essential parameters.
Outcome: The proposed model can reduce computation load at MoE layers by over 50% without sacrificing performance.
Scaling Vision-Language Models with Sparse Mixture of Experts (2023.findings-emnlp)

Copied to clipboard

Challenge: a study explores the effectiveness of mixture-of-experts (MoE) techniques in scaling vision-language models . alayrac and colleagues demonstrate the effectiveness and performance of MoE in scaling VLMs .
Approach: They propose to use sparsely-gated mixture-of-experts techniques to scale vision-language models . they show that MoE can achieve state-of the-art performance over dense models a range of benchmarks .
Outcome: The proposed approach achieves state-of-the-art performance over dense models of equivalent computational cost.

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