SimSMoE: Solving Representational Collapse via Similarity Measure
Giang Do, Hung Le, Truyen Tran
TL;DR
SimSMoE tackles representational collapse in sparse mixture-of-experts by diversifying expert representations using a centered kernel alignment ($CKA$) based similarity loss. It introduces a Similarity Learning module that identifies collapsed experts via shared-token analysis and applies a $CKA$-based loss with a projection head to minimize inter-expert similarity. The method is compatible with existing routing policies and demonstrates improved pre-training and fine-tuning performance across multiple decoder-only LLM architectures (Brainformer, GLaM, Mistral) on Enwik8, Text8 and downstream NLP tasks, with ablations supporting robustness and scalability. These results suggest that directly addressing expert representations can enhance SMoE training efficiency and scalability for large-scale LLMs.
Abstract
Sparse mixture of experts (SMoE) have emerged as an effective approach for scaling large language models while keeping a constant computational cost. Regardless of several notable successes of SMoE, effective training such architecture remains elusive due to the representation collapse problem, which in turn harms model performance and causes parameter redundancy. In this work, we present Similarity-based Sparse Mixture of Experts (SimSMoE), a novel similarity of neural network algorithm, that guarantees a solution to address the representation collapse issue between experts given a fixed FLOPs budget. We conduct extensive empirical evaluations on three large language models for both Pre-training and Fine-tuning tasks to illustrate the efficacy, robustness, and scalability of our method. The results demonstrate that SimSMoE significantly enhances existing routing policy and outperforms other SMoE training methods in performance for the tasks.
