English

RadixMLP -- Intra-batch Deduplication for Causal Transformers

Machine Learning 2026-01-22 v1 Distributed, Parallel, and Cluster Computing

Abstract

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×\times speedups in realistic reranking workloads, with up to 5×5\times speedups on synthetic benchmarks with longer shared prefixes. Our code is available at https://github.com/michaelfeil/radix-mlp.

Keywords

Cite

@article{arxiv.2601.15013,
  title  = {RadixMLP -- Intra-batch Deduplication for Causal Transformers},
  author = {Michael Feil and Julius Lipp},
  journal= {arXiv preprint arXiv:2601.15013},
  year   = {2026}
}
R2 v1 2026-07-01T09:14:11.904Z