Mixtral of Experts
Mixtral of Experts
Metadata
- Reading status: read complete
- Year: 2024
- Compute regime: Sparse and memory-efficient scaling (
sparse_memory_efficient_scaling) - PDF: 2024-mixtral_2024.pdf
- Extracted text: 2024-mixtral_2024.txt
- PDF URL: https://arxiv.org/pdf/2401.04088.pdf
- OpenAlex:
- Citation count source/date:
- Citation count:
- Reading card created: 2026-06-15
Compute Setup
The paper does not list the training accelerator model, number of devices, wall-clock time, token count, or training FLOPs. It thanks CoreWeave and Scaleway for technical support during model training and NVIDIA for support integrating TensorRT-LLM and Triton, but those acknowledgements are not a concrete hardware setup. Under the project rule, the training environment is inferred as a 2023-2024 large-scale GPU cluster, while the exact topology remains unsupported.
The model architecture and serving context are explicit. Mixtral 8x7B is a decoder-only sparse mixture-of-experts model with 32 layers, hidden dimension 4096, feed-forward hidden dimension 14336, 32 attention heads, 8 key/value heads, vocabulary size 32000, and context length 32768. Each MoE feed-forward block has 8 experts and top-2 routing. The paper states that each token has access to 47B parameters but uses only 13B active parameters during inference. It also says the team submitted changes to vLLM integrating MegaBlocks CUDA kernels for efficient inference, and discusses expert parallelism across multiple GPUs.
Bottleneck
The bottleneck is 70B-class serving cost. Dense models like Llama 2 70B use all feed-forward parameters for every token, so inference cost scales with the full active parameter count. Mixtral tries to match or beat that quality while evaluating only a subset of experts per token. The paper explicitly distinguishes sparse parameter count, which drives storage and memory, from active parameter count, which is directly proportional to inference compute cost.
Sparse MoE does not erase hardware constraints; it changes them. Serving memory is proportional to the 47B sparse parameter count, not the 13B active count. Routing also creates overhead and load-balancing pressure. The paper notes that SMoE layers add overhead from routing and increased memory loads when running more than one expert per device, and that they are more suitable for batched workloads. In distributed expert parallelism, tokens assigned to an expert must be routed to the GPU holding that expert and then returned, creating an interconnect and load-balance problem that dense models do not have in the same form.
The bound should therefore use stored parameters plus KV cache for memory, and active parameters for compute. In BF16, 47B stored parameters are about 94 GB before cache or workspace, even though each token activates only about 13B parameters. With 32 layers, 8 KV heads, head dimension 128, and the 32K context, batch-1 KV cache is about 4.3 GB; batch 8 raises it to about 34 GB. Mixtral saves per-token FLOPs relative to a dense 47B model, but it still needs memory and interconnect for the full expert pool and cache.
Method Adaptation
Mixtral adapts the Transformer feed-forward block into a sparse routing problem. At every layer and for every token, a router chooses two of eight experts, applies those expert feed-forward networks, and adds their outputs according to router weights. The paper uses a top-K softmax over router logits; with K fixed at 2, the model can increase total parameter capacity by increasing the number of experts without making each token pay for all experts.
The method fits memory and bandwidth constraints in several ways. Grouped-query attention is visible in the architecture table through 32 attention heads but only 8 key/value heads, reducing key/value cache pressure. The 32K context length makes KV-cache size and attention memory important for serving, while the MoE layer moves most parameter growth into feed-forward experts. MegaBlocks is cited because MoE inference needs efficient sparse matrix multiplication when different experts receive variable numbers of tokens. Expert parallelism shards experts across GPUs, routes token states to the right device, and depends on balanced workload.
Evidence
The main evidence is the active-compute comparison to Llama 2 70B. Table 2 reports Mixtral 8x7B at 13B active parameters, compared with Llama 2 70B at 70B active parameters, and states that Mixtral matches or beats Llama 2 70B on almost all popular benchmarks while using 5x fewer active parameters. Reported scores include MMLU 70.6 versus 69.9, MBPP 60.7 versus 49.8, Math 28.4 versus 13.8, GSM8K 74.4 versus 69.6, and HumanEval 40.2 versus 29.3.
The paper also compares Mixtral against GPT-3.5 and Llama 2 70B in Table 3, reporting that Mixtral matches or exceeds them on most listed metrics, and states that Mixtral 8x7B Instruct outperforms Claude-2.1, Gemini Pro, GPT-3.5 Turbo, and Llama 2 70B chat on human evaluation benchmarks. The long-context evidence is compute-relevant because it stresses cache and attention behavior: the model is reported to retrieve a passkey from its 32K context regardless of sequence length and passkey position.
Historical Effect
Mixtral made sparse open-weight LLMs mainstream by packaging MoE scaling into a widely usable model. Earlier MoE systems such as GShard, Switch, and GLaM established the training logic, but Mixtral made the serving tradeoff visible to practitioners: a model can store 47B parameters, activate 13B per token, and compete with dense 70B-class baselines. Its open weights and vLLM/MegaBlocks integration also connected architecture to deployment rather than leaving MoE as only a training-paper idea.
In the compute-spine framing, Mixtral is a late sparse-scaling milestone because it puts active parameter count, total memory footprint, context length, batching, and expert routing into one practical serving problem. It changes which part of the hardware budget is scarce.
Limits
The source does not disclose enough to analyze training compute precisely. There is no device count, training-token budget, optimizer setup, batch size, or wall-clock time, so training efficiency claims must be limited to the architecture and benchmark comparisons the paper reports. The strongest device-specific statements are about serving software support, not pretraining hardware.
Serving limits remain substantial. All experts must be available in memory, so 13B active parameters does not mean 13B storage. Routing adds overhead, variable expert loads can create bottlenecks, and expert parallelism depends on interconnect bandwidth and implementation quality. The paper itself notes that SMoE utilization is better for batched workloads, which means low-batch interactive serving may not realize the full active-parameter advantage. Mixtral demonstrates a strong cost-quality point, but not a free replacement for dense inference.
Links
- Compute regime:
history/compute_regimes/sparse_memory_efficient_scaling/README.md - Source PDF and extracted text are listed in metadata above.
- Queue status:
read_complete. - Method index: moe, transformer
- Ledger updates: compute bottlenecks