Neptune: Advanced ML Operator Fusion for Locality and Parallelism on GPUs
Not on the map. Why?
Abstract (arXiv)
Operator fusion has become a key optimization for deep learning, which combines multiple deep learning operators to improve data reuse and reduce global memory transfers. However, existing tensor compilers struggle to fuse complex reduction computations involving loop-carried dependencies, such as attention mechanisms. This paper introduces Neptune, a tensor compiler for advanced operator fusion for sequences of reduction operators. Neptune presents a new approach for advanced operator fusion, which intentionally breaks some existing dependencies and compensates by constructing algebraic correction expressions that allow the kernel to produce the correct result. Applying Neptune's advanced operator fusion to a plain attention operator generates operators equivalent to FlashAttention and FlashDecoding. On ten attention-based benchmarks, Neptune, starting from a plain attention code and a high-level scheduling template, outperforms existing compilers like Triton, TVM, and FlexAttention, including Triton-based implementations of FlashAttention. Across four different GPU architectures from NVIDIA and AMD, Neptune-generated kernels have an average speedup of 1.35× over the next best alternative, with up to 2.65× speedup on Nvidia GPUs and up to 3.32× on AMD GPUs, demonstrating its effectiveness for deep learning workloads.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 16 of its 58 references that are in the map. First posted on arXiv 9 Oct 2025.
Builds on
16 of 58 references.
References · 16
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2020Rethinking Attention with Performerscited by 1,601
- 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 258
- 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 201
- 2024Flex Attention: A Programming Model for Generating Optimized Attention Kernelscited by 185
- 2021DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusioncited by 57
- 2025TileLang: A Composable Tiled Programming Model for AI Systemscited by 43
- 2024Mirage: A Multi-Level Superoptimizer for Tensor Programscited by 41
- 2022TensorIR: An Abstraction for Automatic Tensorized Program Optimizationcited by 38
- 2024ThunderKittens: Simple, Fast, and Adorable AI Kernelscited by 36
4 more
- 2022Tensor Program Optimization with Probabilistic Programscited by 30
- 2021Equality Saturation for Tensor Graph Superoptimizationcited by 27
- 2021UNIT: Unifying Tensorized Instruction Compilationcited by 10
- 2020Automatic Kernel Generation for Volta Tensor Corescited by 8
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Hexagon-MLIR: An AI Compilation Stack For Qualcomm's Neural Processing Units (NPUs)cited by 2
- 2026Nautilus: An Auto-Scheduling Tensor Compiler for Efficient Tiled GPU Kernelscited by 1
- 2026Ada-MK: Adaptive MegaKernel Optimization via Automated DAG-based Search for LLM Inferencecited by 1
- 2026Cleave: Scaling Tensor Program Optimization via Decoupled Algebraic Search and Operator Schedulingcited by 0
- 2026Cleave: Scaling Tensor Program Optimization via Decoupled Algebraic Search and Operator Scheduling6 Oct 2026
- 2026Ada-MK: Adaptive MegaKernel Optimization via Automated DAG-based Search for LLM Inference12 May 2026
- 2026Nautilus: An Auto-Scheduling Tensor Compiler for Efficient Tiled GPU Kernels16 Apr 2026
- 2026Hexagon-MLIR: An AI Compilation Stack For Qualcomm's Neural Processing Units (NPUs)23 Feb 2026