CompeteSMoE - Effective Training of Sparse Mixture of Experts via Competition
원문 초록
Sparse mixture of experts (SMoE) offers an appealing solution to scale up the model complexity beyond the mean of increasing the network's depth or width. However, effective training of SMoE has proven to be challenging due to the representation collapse issue, which causes parameter redundancy and limited representation potentials. In this work, we propose a competition mechanism to address this fundamental challenge of representation collapse. By routing inputs only to experts with the highest neural response, we show that, under mild assumptions, competition enjoys the same convergence rate as the optimal estimator. We further propose CompeteSMoE, an effective and efficient algorithm to train large language models by deploying a simple router that predicts the competition outcomes. Consequently, CompeteSMoE enjoys strong performance gains from the competition routing policy while having low computation overheads. Our extensive empirical evaluations on two transformer architectures and a wide range of tasks demonstrate the efficacy, robustness, and scalability of CompeteSMoE compared to state-of-the-art SMoE strategies.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MoFE-Time: Mixture of Frequency Domain Experts for Time-Series Forecasting Models
A Survey on Prompt Tuning
Growing Transformers: Modular Composition and Layer-wise Expansion on a Frozen Substrate
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
Learning to Skip the Middle Layers of Transformers
Latent Prototype Routing: Achieving Near-Perfect Load Balancing in Mixture-of-Experts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.