Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Anne Ouyang

dblp:304/3210 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 44% Hardware accelerators and domain-specific architectures · 44% Performance modeling and evaluation · 13%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code generation with language models
0.912025
KernelBench: Can LLMs Write Efficient GPU Kernels? · ICML 2025
GPUs and heterogeneous computing
GPU kernel
0.912025
KernelBench: Can LLMs Write Efficient GPU Kernels? · ICML 2025
Hardware accelerators and domain-specific architectures
kernel generation
0.912025
KernelBench: Can LLMs Write Efficient GPU Kernels? · ICML 2025
Performance modeling and evaluation
benchmarking
0.312025
KernelBench: Can LLMs Write Efficient GPU Kernels? · ICML 2025

Methods — techniques the papers use, named apart from their topics

large language model · 1.7iterative refinement · 1.7
YearPublicationVenuePosition
2025 KernelBench: Can LLMs Write Efficient GPU Kernels?
abstract
Efficient GPU kernels are crucial for building performant machine learning architectures, but writing them is a time-consuming challenge that requires significant expertise; therefore, we explore using language models (LMs) to automate kernel generation. We introduce KernelBench, an open-source framework for evaluating LMs’ ability to write fast and correct kernels on a suite of 250 carefully selected PyTorch ML workloads. KernelBench represents a real-world engineering environment and making progress on the introduced benchmark directly translates to faster practical kernels. We introduce a new evaluation metric $\text{fast}_p$, which measures the percentage of generated kernels that are functionally correct and offer a speedup greater than an adjustable threshold $p$ over baseline. Our experiments across various state-of-the-art models and test-time methods show that frontier reasoning models perform the best out of the box but still fall short overall, matching the PyTorch baseline in less than 20% of the cases. While we show that results can improve by leveraging execution and profiling feedback during iterative refinement, KernelBench remains a challenging benchmark, with its difficulty increasing as we raise speedup threshold $p$.
Anne Ouyang, Simon Guo 0004, Simran Arora, Alex L. Zhang, William Hu, Christopher Ré, Azalia Mirhoseini
ICML1