Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 58 min ago
PreprintarXiv licencearXiv

Server-Side Sparse Assignment for Federated Mixture-of-Experts

Abstract

Large language models (LLMs) are increasingly recognized for their remarkable capabilities; federated learning (FL) offers a promising framework for collaboratively fine-tuning LLMs on edge devices while achieving data privacy. However, edge devices are inherently heterogeneous: clients may exhibit diverse data distributions and resource constraints, including limited memory and computation budgets. Recent federated Mixture-of-Experts (MoE) approaches address these challenges by using sparse expert activation or partial expert loading. However, existing partial-expert methods rely on heuristic full-pool observations or prioritize system-wide load balance, without guarantees for recovering client-specific relevant experts from partial observations. We propose S3-MoE, a server-side sparse expert assignment framework that estimates client-specific expert relevance from partial observations and refines assignments through an exploit--explore mechanism. We also establish relevance-estimation error and exact Top-K recovery guarantees. Experiments using a CNN-based MoE on CIFAR-100 show that S3-MoE recovers task-dependent client--expert preferences and reduces conflicts caused by correlated expert selection across clients. Compared with Full-20 FedAvg, which gives each client access to all 20 experts for local Top-5 routing, S3-MoE achieves 1.31 percentage points higher mean final accuracy while loading only $5$ experts per client.

Related

  1. When Does Sparse Routing Help? The Geometry of Expert Separation in Mixture of Experts
    Huy Nguyen, Dung Le, Alessandro Rinaldo +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Sparsity Saves Compute, Not Samples: Oracle Inequalities for Dense and Sparse Mixture of Experts
    Sagar Ghosh, Huy Nguyen, Alessandro Rinaldo
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Relative-Error Composite Federated Optimization with One Server-Side Proximal Step per Round
    Sirong Dai, Jianting Pan, Ming Yan
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Mixture of Censored Partially Linear Experts Models for Symmetric or Asymmetric Data with or without Outlying Observations: A novel approach with two-piece scale-mixture of normal distributions
    Mohsen Maleki, Geoffrey J. McLachlan
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. A Practical Recipe for Semi-Supervised Federated ASR: Online Pseudo-Labels with Server Update Stabilization
    Wonho Bae, Zakaria Aldeneh, Martin Pelikan +3
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{zheng2026serverside,
  title = {{Server-Side Sparse Assignment for Federated Mixture-of-Experts}},
  author = {Xue Zheng and Aylin Yener},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07093},
  eprint = {2611.07093},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07093},
}
RIS
TY  - UNPB
TI  - Server-Side Sparse Assignment for Federated Mixture-of-Experts
AU  - Xue Zheng
AU  - Aylin Yener
PY  - 2026
DA  - 2026/11/04
PB  - arXiv
DO  - 10.48550/arxiv.2611.07093
UR  - https://arxiv.org/abs/2611.07093
AB  - Large language models (LLMs) are increasingly recognized for their remarkable capabilities; federated learning (FL) offers a promising framework for collaboratively fine-tuning LLMs on edge devices while achieving data privacy. However, edge devices are inherently heterogeneous: clients may exhibit diverse data distributions and resource constraints, including limited memory and computation budgets. Recent federated Mixture-of-Experts (MoE) approaches address these challenges by using sparse expert activation or partial expert loading. However, existing partial-expert methods rely on heuristic full-pool observations or prioritize system-wide load balance, without guarantees for recovering client-specific relevant experts from partial observations. We propose S^3-MoE, a server-side sparse expert assignment framework that estimates client-specific expert relevance from partial observations and refines assignments through an exploit--explore mechanism. We also establish relevance-estimation error and exact Top-K recovery guarantees. Experiments using a CNN-based MoE on CIFAR-100 show that S^3-MoE recovers task-dependent client--expert preferences and reduces conflicts caused by correlated expert selection across clients. Compared with Full-20 FedAvg, which gives each client access to all 20 experts for local Top-5 routing, S^3-MoE achieves 1.31 percentage points higher mean final accuracy while loading only $5$ experts per client.
ER  -