RadixMLP -- Intra-batch Deduplication for Causal Transformers
Not on the map. Why?
Abstract (arXiv)
Batch inference workloads for causal transformer models frequently process sequences that share common prefixes, such as system prompts, few-shot examples, or shared queries. Standard inference engines treat each sequence independently, redundantly recomputing identical MLP activations for every copy of the shared prefix. We introduce RadixMLP, a technique that exploits the position-wise nature of MLPs, LayerNorms, linear projections, and embeddings to eliminate this redundancy. RadixMLP dynamically maps batches to a prefix trie, gathering shared segments into a compressed representation for position-wise computation and scattering results back only at attention boundaries. RadixMLP is stateless and operates within a single forward pass. In end-to-end serving benchmarks on MS~MARCO v1.1 with Qwen3 models (0.6B to 8B parameters), RadixMLP achieves 1.44-1.59× speedups in realistic reranking workloads, with up to 5× speedups on synthetic benchmarks with longer shared prefixes. Our code is available at https://github.com/michaelfeil/radix-mlp.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 21 Jan 2026.
Builds on
13 of 20 references.
References · 13
- 2017Attention Is All You Needcited by 59,932
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2020GLU Variants Improve Transformercited by 1,724
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
- 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 248
- 2024NanoFlow: Towards Optimal Large Language Model Serving Throughputcited by 85
- 2024Hydragen: High-Throughput LLM Inference with Shared Prefixescited by 71
- 2024Preble: Efficient Distributed Prompt Scheduling for LLM Servingcited by 68
- 2024BatchLLM: Optimizing Large Batched LLM Inference with Global Prefix Sharing and Throughput-oriented Token Batchingcited by 31
- 2024DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inferencecited by 19
1 more
Built on by
Not cited yet.