A Contract-Grade Verifier for LLM-Generated GPU Kernels, and a Native Blackwell Backward for the Gated-Linear-Recurrence Family
- View PDF HTML (experimental) Abstract:Systems that generate GPU kernels with language models report high correctness rates.
- Those rates come from a single loose test: run the kernel on a few random inputs at one fixed shape and accept it if the output is close to a reference.
- A kernel can pass that test and still be silently wrong.
Unverified
- View PDF HTML (experimental) Abstract:Systems that generate GPU kernels with language models report high correctness rates.
- Those rates come from a single loose test: run the kernel on a few random inputs at one fixed shape and accept it if the output is close to a reference.
- A kernel can pass that test and still be silently wrong.
Sources: Arxiv