Writing fast GPU kernels requires simultaneous expertise in the algorithm, the hardware architecture, and the programming model. Expert kernel engineers are scarce, and their solutions are hardware-specific.
Wiedemann et al. (arXiv:2603.12440) automate kernel optimization using LLMs guided by MAP-Elites evolutionary search. MAP-Elites maintains a population of kernel variants spread across a behavioral space defined by kernel-specific dimensions (register usage, occupancy, instruction mix). Each cell in the behavioral grid holds the best-performing kernel with that behavioral profile, exploring diverse optimization strategies simultaneously.
Two innovations make this work. First, meta-prompt evolution: instead of directly mutating kernel code, the framework evolves the optimization instructions given to the LLM. Successful prompts are recombined and mutated to discover task-specific optimization techniques. The LLM is the mutation operator; the prompts are the genotype. Second, template-based parameter tuning handles hardware-specific details through structured search rather than LLM generation, avoiding the failure mode where LLMs produce syntactically valid but hardware-incompatible configurations.
The framework produces both SYCL and CUDA kernels from the same pipeline, achieving 2.3x average speedup on KernelBench for SYCL. The generalization across programming models — not just across kernels — is the real result: the same evolutionary search discovers optimization strategies that transfer from one GPU programming abstraction to another, because the underlying hardware constraints (memory hierarchy, warp scheduling, register pressure) are shared.