mlsanityData to 7 Oct 2026

AgentCompile: An LLM-Guided Compiler for Direct CUDA Inference

arXiv 2606.07665 ↗First posted 4 Jun 2026cs.PL cs.AIcited by 0

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

Transformer inference increasingly relies on specialized compiler and runtime support, while recent LLMs can generate nontrivial CUDA kernels. However, unconstrained generation guarantees neither correctness nor performance. We present textscAgentCompile, an LLM-guided CUDA inference compiler that combines two complementary uses of LLMs. First, the LLM provides advisory metadata for compiler-derived region summaries and bounded candidate spaces. The compiler then instantiates template-based CUDA candidates, validates correctness, selects implementations by measured latency, and falls back when specialization is unsupported or unprofitable. Second, under compiler-defined contracts, the LLM directly generates five classes of decode-critical kernels to accelerate inference, prompted by distilled optimization principles. textscAgentCompile integrates these kernels into a serving runtime with paged KV cache, continuous batching, preemption, chunked prefill, and bucketed full-step CUDA Graph replay. Across six evaluated model families, textscAgentCompile achieves speedups of 2.23--6.98× over PyTorch eager for single-request generation, and 1.04--1.16× over vLLM for both single-request generation and multi-request serving. Our code is publicly available at https://github.com/veneno1213822/AgentCompile.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 11 of its 23 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

11 of 23 references.

References · 11

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  2. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  3. 2022Competition-Level Code Generation with AlphaCodecited by 1,427
  4. 2023StarCoder: may the source be with you!cited by 790
  5. 2025KernelBench: Can LLMs Write Efficient GPU Kernels?cited by 206
  6. 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 199
  7. 2018Learning to Optimize Tensor Programscited by 138
  8. 2024NExT: Teaching Large Language Models to Reason about Code Executioncited by 60
  9. 2021DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusioncited by 56
  10. 2023Large Language Models for Compiler Optimizationcited by 52
  11. 2021Torch.fx: Practical Program Capture and Transformation for Deep Learning in Pythoncited by 38

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Kernel Forge: An Agent Harness for LLM-based Generation and Optimization of CUDA Kernels
  2. 2025Towards Robust Agentic CUDA Kernel Benchmarking, Verification, and Optimization
  3. 2025From Large to Small: Transferring CUDA Optimization Expertise via Reasoning Graph
  4. 2025CudaForge: An Agent Framework with Hardware Feedback for CUDA Kernel Optimization
  5. 2025ProofWright: Towards Agentic Formal Verification of CUDA
  6. 2026CUDA-Harness: Harnessing Agentic CUDA Kernel Generation and Optimization from Natural Language
  7. 2026CUDA Agent: Large-Scale Agentic RL for High-Performance CUDA Kernel Generation
  8. 2026FastKernels: Benchmarking GPU Kernel Generation in Production