Pith

open record

sign in

arxiv: 2503.23100 · v2 · pith:QTCVSXC7 · submitted 2025-03-29 · cs.LG · cs.CL

MoLAE: Mixture of Latent Experts for Parameter-Efficient Language Models

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QTCVSXC7record.jsonopen to challenge →

classification cs.LG cs.CL
keywords molaedimensionsexpertslatentmixturemodelslanguagellms
0
0 comments X
read the original abstract

Mixture of Experts (MoE) has become a key architectural paradigm for efficiently scaling Large Language Models (LLMs) by selectively activating a subset of parameters for each input token. However, standard MoE architectures face significant challenges, including high memory consumption and communication overhead during distributed training. In this paper, we introduce Mixture of Latent Experts (MoLAE), a novel parameterization that addresses these limitations by reformulating expert operations through a shared projection into a lower-dimensional latent space, followed by expert-specific transformations. This factorized approach substantially reduces parameter count and computational requirements, particularly in existing LLMs where hidden dimensions significantly exceed MoE intermediate dimensions. We provide a rigorous mathematical framework for transforming pre-trained MoE models into MoLAE architecture, characterizing conditions for optimal factorization, and developing a systematic two-step algorithm for this conversion. Our comprehensive theoretical analysis demonstrates that MoLAE significantly improves efficiency across multiple dimensions while preserving model capabilities. Experimental results confirm that MoLAE achieves comparable performance to standard MoE with substantially reduced resource requirements.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Riemannian Gradient Descent for Low-Rank Architectures

    cs.LG 2026-06 unverdicted novelty 3.0

    Riemannian optimization on low-rank attention parameters yields no conclusive improvement over AdamW after hyperparameter tuning.