KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization
Red Hat
arXiv:2609.30059 [cs.DC], (24 Sep 2026)
@misc{poddar2026kernelopt,
title={KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization},
author={Aheli Poddar and Sanskar Prasad and Arindam Samanta and Subha Chakraborty and Vishal Goyal and Rohit Singh Rathaur},
year={2026},
eprint={2609.30059},
archivePrefix={arXiv},
primaryClass={cs.DC},
url={https://arxiv.org/abs/2609.30059}
}
Deep learning inference and training performance depends critically on GPU kernel efficiency. Modern compilers such as PyTorch Inductor automatically generate GPU kernels from high-level model code, but frequently underperform expert-written implementations by wide margins. Recent LLM-assisted kernel optimizers can close this gap for standalone kernels, yet treat compiled models as black boxes, generally optimizing individual standalone kernels without respecting the compiler's structural decisions or verifying the model end-to-end. We present KernelOPT, a multi-agent system that treats compiled models as structured artifacts. It preserves vendor library calls (cuBLAS, cuDNN) and exclusively targets generated Triton sub-kernels using five profiling-guided LLM agents. A four-gate verification cascade of static validation, multi-seed correctness, model-level float64-fallback verification, and performance gating filters candidates during optimization and verifies the re-stitched model end-to-end. If no candidate passes all four gates, the system preserves the compiler baseline. The system accepts PyTorch this http URL, standalone Triton kernels, and Helion kernels. Evaluated on 250 KernelBench problems, KernelOPT achieves geometric mean speedups over torch.compile of 1.40x (Level 1: 51/100), 1.15x (Level 2: 31/100), and 1.07x (Level 3: 12/50) across all problems.
September 28, 2026 by hgpu
Your response
You must be logged in to post a comment.



