Organizations: University of Wisconsin-Madison Madison, Wisconsin, USA · Korea University Seoul, Republic of Korea · NVIDIA Santa Clara, California, USA
We introduce FORGE (Fast On-chip Rotor Generation for Experts), a procedural weight generation system for Sparse Mixture-of-Experts (MoE) inference. Rather than storing and loading every expert weight tensor from HBM, we show how a compact accelerator inside each Streaming Multiprocessor can regenerate them on-the-fly from O(log2d) rotor parameters per projection. Per replaced layer, gigabytes of stored expert weights are approximated with under a megabyte of seeds. This addresses the dual memory bottleneck of autoregressive Sparse MoE decode, where per-expert FFN operations are HBM-bandwidth-bound at small routed-token counts and the aggregate expert footprint forces multi-node Expert Parallelism (EP) with all-to-all traffic. We realize the approach as the Rotor Generation Unit (RGU), a fixed-function datapath that generates FFN weight tiles without competing with Tensor Core execution. With 30% of the MoE FFN layers replaced across five Sparse MoE models, we estimate 1.3-2.8x higher system throughput at matched GPU count and 1.10-1.15x lower per-user decode latency at short context. In exchange, downstream accuracy on three model families falls below that of the same model fine-tuned without rotor replacement, and the replacement ratio controls this tradeoff. FORGE also expands KV cache capacity by 1.2-2.6x. It is agnostic to the bit width at which weights are stored, so it can compose with quantization. The RGU is fully implemented/verified in SystemVerilog at ~0.9% SM area overhead (0.032 mm^2/SM, 7nm).
Figures & tables
Figure 1. FORGE replaces HBM-resident expert weights with on-chip procedural regeneration. (Top) Training adds an offline rotor-fitting step that compresses each dense expert into a rotor-parameter seed θ . (Bottom) At inference, the RGU inside each SM materializes weight tiles on-the-fly from seeds alone, reclaiming HBM capacity for an expanded KV cache.
Model
E
K
MoE%
Seed/layer
Comp.
DeepSeek-v3.2
256
8
94.5
594 KB
19,065×
GLM-5
256
8
98.2
509 KB
19,065×
Qwen3-235B
128
8
96.6
276 KB
8,738×
Qwen3-30B
128
8
95.0
221 KB
2,731×
Qwen3-Coder-Next
512
10
98.0
776 KB
2,081×
Table 1. Target Sparse MoE model configurations. E , K : total and activated experts; Seed: the FORGE parameters that replace one layer’s experts.
Table 5. Full-Model Decode Latency Speedup (FP8, RGU, B=1 , r=0.3 ). Baseline: TP+EP with minimum GPUs to fit weights. FORGE replaces 30% of the MoE layers; kept baseline MoE layers still pay EP all-to-all.
Figure 10. Context-length ablation (matched GPU count). (a) Decode speedup narrows as KV cache access dilutes the MoE FFN contribution. (b) Freed HBM grows max concurrent users per GPU sharply at long context. (c) The user-count gain offsets the narrowing decode speedup, so TPS gains hold or widen.
Figure 11. System throughput scaling across replacement ratios (r) (T=4096). Accuracy is evaluated at r=0.3 only; r=0.7 is a what-if point (Section 5.5 ).
Component
Value
Notes
Logic Area
0.017 mm2
PE array ∼ 69%
SRAM Area
0.015 mm2
28.875 KB, 4-bank
Total / SM
0.032 mm2
vs one SM (3.475 mm2 ( Locuza, 2022 ) )
∼ 0.9%
Clock (ASAP7)
1.80 GHz
WNS −65 ps @ 2 GHz
Logic Power (0.7 V)
35.9 mW
3.4 switch + 32.5 internal
Table 6. 7 nm PPA Summary for the FP8 dual-pair RGU.
Config
WikiText ↓
ARC-C ↑
HellaSwag ↑
ERNIE-21B
Baseline
8.37
58.00
61.10
Baseline + LoRA
5.93
58.96
62.50
FORGE
7.16
57.25
59.30
Qwen3-30B
Baseline
9.40
52.60
59.50
Table 7. Model performance with r=0.3 on ERNIE-21B , Qwen3-30B , and Qwen3-Coder-Next on WikiText, ARC-C, and HellaSwag. Baseline + LoRA is the reference for FORGE. The gap between the two is the accuracy cost of rotor replacement.
Sparse Mixture-of-Experts (MoE) language models separate total parameter count from per-token active computation, but local inference systems often still require the full model, key-value cache, runtime buffers, and operatingsystem headroom to fit in fast memory. MawForge tests a different systems hypothesis: local MoE serving can be made practical on constrained unified-memory machines by storing the full model on disk, keeping common tensors resident, and materializing routed expert tensors into a bounded execution cache on demand. The central finding is that MawForge is effective as a bounded execution mechanism and measurement substrate for local MoE inference, but not as a cache-maximization policy. Performance depends on balancing expert reuse against resident footprint, KV-cache size, quantization, route locality, and macOS memory pressure.
Sparse mixture-of-experts (MoE) language models reduce arithmetic by activating only a small subset of experts per token, yet deployment still requires storing and moving the full expert bank. We present ExactMoE, an inference design that applies symmetric group-128 four-bit weight quantization only to routed experts, stores those experts in kernel-native MARLIN form in pinned host memory, and executes all selected experts through a configurable GPU-resident slot cache and fused grouped MoE kernels. The router, attention, embeddings, normalization layers, and language-model head remain in BF16. "Exact" refers to complete expert availability and an unchanged top-k routing procedure: no expert is pruned, substituted, or forced to execute on the CPU. It does not imply numerical identity with the BF16 model. On OLMoE-1B-7B-0924-Instruct, evaluated on a single NVIDIA L4, a 16-slot configuration reduces peak reserved GPU memory from 14.168 to 1.836 GiB (87.04%) while retaining 81.85% of BF16 decode throughput. A fully resident 64-slot configuration reaches 31.923 tokens/s versus 21.662 tokens/s for BF16 while reserving 4.061 GiB. Across 12,450 zero-shot multiple-choice questions, ExactMoE obtains 70.3534% normalized accuracy versus 70.8996% for BF16, retaining 99.23% of the baseline accuracy. In a matched 16-token ablation, fused grouped execution is 1.97x as fast as a sequential W4 reference. These results identify a practical memory-transfer-throughput frontier for complete-expert MoE inference.
Mixture-of-Experts (MoE) architectures allow frontier language models to scale to trillions of parameters, but their deployment is constrained by massive memory footprints and memory-bandwidth limitations. Although modern accelerators provide Sparse Tensor Cores (SpTCs) that reduce weight storage and increase throughput through low-precision semi-structured sparsity, exploiting them for MoEs remains challenging because of substantial model-quality degradation and the lack of grouped sparse GEMM primitives. We present an end-to-end hardware-software co-design framework that compresses expert weights into hardware-native, low-precision sparse representations and accelerates their execution on SpTCs. Algorithmically, our framework relaxes discrete semi-structured support selection through continuous reparameterization, enabling differentiable joint optimization with quantized weights under a router-weighted reconstruction objective and scalable expert-parallel compression. Systemically, we develop a custom grouped sparse GEMM kernel tailored to low-precision sparse MoE inference on SpTCs. Across MoE models ranging from 30 billion to one trillion parameters, our framework improves state-of-the-art joint sparse-quantization accuracy by up to 4.35 percentage points while preserving 96.09% of the original model's performance. On NVIDIA B200 GPUs, our kernel outperforms the vendor baseline by up to 1.65×, increasing serving throughput by 1.18× and reducing end-to-end latency by up to 4.03×. These results establish hardware-software co-design as a practical path toward scalable and efficient MoE deployment.