IntBMoE: Integrating Block-Level Conditioning into Expert Composition for Full-Participation Mixture-of-Experts

📅 2026-09-18
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
为了解决Mixture-of-Experts中参与度、执行成本和内存成本难以独立控制的问题,IntBMoE通过结合块级条件与专家组合的方法实现了全参与的同时保持了低计算和存储成本。
📝 Abstract
Mixture-of-Experts (MoE) scales capacity, but existing designs cannot set three quantities independently. For a single token, participation is how many experts contribute knowledge to its output, execution is how many are actually computed (compute cost), and materialization is how many expert-sized parameter sets must be built and stored (memory cost). Sparse routing keeps execution and materialization low, but shrinks participation: for each token, only a few experts contribute. Dense output-mixing restores full participation, but its execution grows with the number of experts. Parameter-merging keeps execution at one expert, but its materialization grows with the number of routing decisions. We propose IntBMoE, a block-conditioned MoE that decouples all three by pairing dense expert composition with sparse block execution. Its blocks come from a small learned codebook, one per entry. At each internal layer, a lightweight hypernetwork merges all expert bases in that layer's pool into one composed expert. Participation is full, because every composed expert draws on the entire pool. Execution stays sparse, because a router sends each token to only a few blocks. Materialization is bounded, because the codebook, not the input, fixes how many blocks exist. Dual-Path Residual Gating (DPRG) further couples two independently composed paths through multiplicative gating. Experiments on image classification show consistent gains over representative sparse and dense MoE baselines. Additional experiments on language modeling and sequential recommendation validate its generalization beyond vision. IntBMoE is fully deployed in AMap's generative recommendation system, serving hundreds of millions of users under a 60ms latency budget, with a 2.4% relative UVCTR gain in online A/B testing. Our code is available at https://github.com/AMAP-ML/DreamX-Rec/.
Problem

Research questions and friction points this paper is trying to address.

Mixture-of-Experts
participation
execution cost
materialization cost
sparse routing
Innovation

Methods, ideas, or system contributions that make the work stand out.

Block-Conditioned MoE
Dense Expert Composition
Sparse Block Execution
Dual-Path Residual Gating (DPRG)
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
R
Ran Cheng
DreamX, Alibaba Group
L
Longfei Xu
DreamX, Alibaba Group
Z
Zheng Liu
DreamX, Alibaba Group
K
Kaikui Liu
DreamX, Alibaba Group
X
Xiangxiang Chu
DreamX, Alibaba Group