Pith. sign in

REVIEW 4 cited by

Mixture of Quantized Experts (MoQE): Complementary Effect of Low-bit Quantization and Robustness

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.02410 v1 pith:RBQSXZET submitted 2023-10-03 cs.LG cs.CL

classification cs.LGcs.CL
keywords modelquantizationexpertlow-bitmemorymodelsexpertsmixture
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Large Mixture of Experts (MoE) models could achieve state-of-the-art quality on various language tasks, including machine translation task, thanks to the efficient model scaling capability with expert parallelism. However, it has brought a fundamental issue of larger memory consumption and increased memory bandwidth bottleneck at deployment time. In this paper, we propose Mixture of Quantized Experts (MoQE) which is a simple weight-only quantization method applying ultra low-bit down to 2-bit quantizations only to expert weights for mitigating the increased memory and latency issues of MoE models. We show that low-bit quantization together with the MoE architecture delivers a reliable model performance while reducing the memory size significantly even without any additional training in most cases. In particular, expert layers in MoE models are much more robust to the quantization than conventional feedforward networks (FFN) layers. In our comprehensive analysis, we show that MoE models with 2-bit expert weights can deliver better model performance than the dense model trained on the same dataset. As a result of low-bit quantization, we show the model size can be reduced by 79.6% of the original half precision floating point (fp16) MoE model. Combined with an optimized GPU runtime implementation, it also achieves 1.24X speed-up on A100 GPUs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Expert Reduction to Behavioral Divergence: Tracing Numerical State through Sparse MoE Inference

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Mathematically equivalent expert-reduction orders in native DeepSeek-V4-Flash produce distinct routes, persistent states, and continuation basins; BF16 operands with FP32 accumulation match the native path.

  2. PagedWeight: Efficient MoE LLM Serving with Dynamic Quality-Aware Weight Quantization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    PagedWeight pages quantized MoE expert weights on and off the GPU at runtime, releasing memory to the KV cache while using sensitivity, routing, and prompt signals to choose which experts to shrink.

  3. ButterflyMoE: Compression-Scalable Ternary Experts via Structured Butterfly Orbits

    cs.LG 2026-01 reject novelty 6.0 of 10

    Experts in an MoE are reparameterized as butterfly rotations of a single shared ternary matrix, giving O(d^2 + N d log d) memory and a claimed ~150x compression at 256 experts.

  4. Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline

    cs.LG 2025-02 conditional novelty 5.0 of 10

    Klotski pipelines multiple batches of MoE inference, prefetches only likely-used 'hot' experts, and reorders expert computations to overlap I/O with compute, claiming up to 85.12x throughput gains.

Pith tools