LGAIOct 4, 2025

EvoEngineer: Mastering Automated CUDA Kernel Code Evolution with Large Language Models

arXiv:2510.03760v19 citationsh-index: 19
Originality Incremental advance
AI Analysis

This addresses a critical bottleneck in deep learning efficiency for researchers and practitioners by providing a more reliable and effective automated optimization method, though it builds incrementally on existing LLM approaches.

The paper tackled the problem of automating CUDA kernel optimization for AI performance by formalizing it as a code optimization task and introducing EvoEngineer, a systematic LLM-based framework, which achieved a median speedup of 2.72x over baseline kernels and a code validity rate of 69.8% in experiments on 91 real-world kernels.

CUDA kernel optimization has become a critical bottleneck for AI performance, as deep learning training and inference efficiency directly depends on highly optimized GPU kernels. Despite the promise of Large Language Models (LLMs) for automating kernel optimization, this field suffers from a fragmented ecosystem of isolated and incomparable approaches with unclear problem formulations. Furthermore, general-purpose LLM code evolution methods cannot meet strict correctness requirements of CUDA kernel optimization. We address these fundamental challenges by first formalizing CUDA kernel optimization as a code optimization task with a clear objective, constraints, and evaluation metrics. We then establish the first systematic LLM-based code evolution framework, EvoEngineer, that provides guidance for designing and adapting optimization strategies to achieve a balance between performance and correctness. Finally, we implement a kernel optimization system based on this framework and conduct extensive experiments on 91 real-world CUDA kernels. Our results demonstrate that EvoEngineer achieves a principled balance between performance and correctness, with the highest averaged median speedup of \textbf{2.72}$\times$ over baseline CUDA kernels and a code validity rate of \textbf{69.8}\%, outperforming existing methods on both dimensions. Our method achieves a maximum speedup of \textbf{36.75}$\times$ among all operations over PyTorch kernels and delivers the highest speedup on \textbf{28} (\textbf{56.0\%}) of 50 operations that achieve over \textbf{2$\times$} acceleration.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes