Arrow Research search

Author name cluster

Ke Wang 0022

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

ICML Conference 2025 Conference Paper

Improving Parallel Program Performance with LLM Optimizers via Agent-System Interfaces

  • Anjiang Wei
  • Allen Nie
  • Thiago S. F. X. Teixeira
  • Rohan Yadav
  • Wonchan Lee
  • Ke Wang 0022
  • Alexander Aiken

Modern scientific discovery increasingly relies on high-performance computing for complex modeling and simulation. A key challenge in improving parallel program performance is efficiently mapping tasks to processors and data to memory, a process dictated by intricate, low-level system code known as mappers. Developing high-performance mappers demands days of manual tuning, posing a significant barrier for domain scientists without systems expertise. We introduce a framework that automates mapper development with generative optimization, leveraging richer feedback beyond scalar performance metrics. Our approach features the Agent-System Interface, which includes a Domain-Specific Language (DSL) to abstract away the low-level complexity of system code and define a structured search space, as well as AutoGuide, a mechanism that interprets raw execution output into actionable feedback. Unlike traditional reinforcement learning methods such as OpenTuner, which rely solely on scalar feedback, our method finds superior mappers in far fewer iterations. With just 10 iterations, it outperforms OpenTuner even after 1000 iterations, achieving $3. 8\times$ faster performance. Our approach finds mappers that surpass expert-written mappers by up to $1. 34\times$ speedup across nine benchmarks while reducing tuning time from days to minutes.

ICLR Conference 2020 Conference Paper

Hoppity: Learning Graph Transformations to Detect and Fix Bugs in Programs

  • Elizabeth Dinella
  • Hanjun Dai
  • Ziyang Li 0002
  • Mayur Naik
  • Le Song
  • Ke Wang 0022

We present a learning-based approach to detect and fix a broad range of bugs in Javascript programs. We frame the problem in terms of learning a sequence of graph transformations: given a buggy program modeled by a graph structure, our model makes a sequence of predictions including the position of bug nodes and corresponding graph edits to produce a fix. Unlike previous works that use deep neural networks, our approach targets bugs that are more complex and semantic in nature (i.e.~bugs that require adding or deleting statements to fix). We have realized our approach in a tool called HOPPITY. By training on 290,715 Javascript code change commits on Github, HOPPITY correctly detects and fixes bugs in 9,490 out of 36,361 programs in an end-to-end fashion. Given the bug location and type of the fix, HOPPITY also outperforms the baseline approach by a wide margin.

v2026.09.13