Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.17238

Help | Advanced Search

Computer Science > Artificial Intelligence

arXiv:2509.17238 (cs)
[Submitted on 21 Sep 2025 ]

Title: MoEs Are Stronger than You Think: Hyper-Parallel Inference Scaling with RoE

Title: MoEs 比你想象的更强:通过 RoE 的超并行推理扩展

Authors:Soheil Zibakhsh, Mohammad Samragh, Kumari Nishu, Lauren Hannah, Arnav Kundu, Minsik Cho
Abstract: The generation quality of large language models (LLMs) is often improved by utilizing inference-time sequence-level scaling methods (e.g., Chain-of-Thought). We introduce hyper-parallel scaling, a complementary framework that improves prediction quality at the token level. Hyper-parallel scaling computes and aggregates multiple output proposals for a single token from the model. We implement this concept in Mixture-of-Experts (MoE) models, which we refer to as Roster of Experts (RoE). RoE is a training-free inference algorithm that turns a single MoE into a dynamic ensemble of MoEs. RoE injects controlled stochasticity into the expert routing mechanism, enabling it to sample multiple diverse experts for each token and aggregate their outputs for a more accurate final prediction.To overcome the computational cost, we introduce an efficient batching strategy and a specialized KV-caching mechanism that minimizes compute and memory overhead. For example, RoE enables a 7B MoE model to match the performance of a 10.5B MoE model while using 30% less compute for inference. These gains are achieved without any fine-tuning of model parameters.
Abstract: 大型语言模型(LLMs)的生成质量通常通过利用推理时的序列级缩放方法(例如,思维链)来提高。我们引入了超并行缩放,这是一种补充框架,在标记级别上提高预测质量。超并行缩放从模型中计算并聚合单个标记的多个输出建议。我们将这一概念实现于专家混合(MoE)模型中,我们称之为专家名单(RoE)。RoE是一种无需训练的推理算法,它将单个MoE转变为动态的MoE集合。RoE在专家路由机制中注入受控的随机性,使其能够为每个标记采样多个不同的专家,并聚合它们的输出以获得更准确的最终预测。为了克服计算成本,我们引入了一种高效的批处理策略和一种专门的KV缓存机制,以最小化计算和内存开销。例如,RoE使一个7B的MoE模型在推理时使用30%更少的计算量就能达到10.5B MoE模型的性能。这些改进是在不微调模型参数的情况下实现的。
Subjects: Artificial Intelligence (cs.AI) ; Computation and Language (cs.CL); Emerging Technologies (cs.ET); Machine Learning (cs.LG)
Cite as: arXiv:2509.17238 [cs.AI]
  (or arXiv:2509.17238v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2509.17238
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Soheil Zibakhsh Shabgahi [view email]
[v1] Sun, 21 Sep 2025 21:05:29 UTC (516 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.AI
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.CL
cs.ET
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号