- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents REPAIR, a recursive optimization framework for Ascend kernels. REPAIR decouples the optimization process into two stages: identification, which diagnoses the current kernel and proposes an actionable direction for the next round of optimization; and revision, which carries out the actual kernel code changes according to the plan generated in the identification stage. REPAIR instantiates the identification module with a (relatively) small LLM and delegates the revision to off-the-shelf coding agents powered by larger LLMs. It focuses on learning the identification LLM to propose effective and actionable plans via data generation and OPSD. Experimental results on MultiKernelBench show that the identification LLM can learn high-quality optimization suggestions that simultaneously preserve correctness.
Critical strengths
- This work identifies the core challenges of Ascend kernel optimization in entangled optimization planning and execution, with the proposed decoupling framework providing a novel aspect to approach the challenge.
- The experimental results demonstrate the empirical strength of learning a (relatively) lightweight optimization proposal module.
Critical weaknesses
-
Some details of the identification module. In the abstract, it states that "Identification selects an actionable optimization direction"; However, in Sec 4.1, it seems that "Consequently, interdependent changes are combined into one internally consistent plan rather than selected independently" suggests that the generated plan might be composed of multiple possible directions. Is there any constraint on the scope and coverage of the plan in terms of direction, or any empirical results suggesting that one direction per turn is better than one plan that points to multiple edits?
-
While the paper claims that REPAIR is conducted for multiple iterations, there are no experimental details or results on the test-time performance across multi-turn runs.
-
Though the authors argue that "a key challenge lies in coupling optimization decision-making with code implementation, requiring models to jointly determine what to optimize and how to implement the corresponding changes.", it seems to me that this challenge is not unique to Ascend kernels (e.g., complex CUDA kernels from KernelBench level 2 & 3); thus, limiting the experiment to Ascend kernels only hinders the general applicability of the proposed framework.
Questions for authors
Please see the weaknesses above.
Short response to major concern
Thank you for these insightful questions. Regard your question about details of the identification module: one optimization direction does not necessarily correspond to a single code modification. In kernel optimization, meaningful improvements often require several interdependent changes, such as adjusting task ownership, data residency, and memory transfers together. Identification therefore produces one coherent optimization plan, which Revision implements as a whole while preserving the necessary constraints. This also motivates the recursive design: once a performance bottleneck is addressed, the kernel's execution characteristics change, and the next optimization decision should be made based on the resulting implementation rather than the original one. We agree that multi-turn optimization trajectories are important for demonstrating this mechanism empirically. While Ascend C provides a particularly compelling setting due to its specialized programming requirements and limited training data, the underlying challenge of separating optimization decisions from implementation also arises in complex CUDA kernels. Exploring this generality is a valuable direction for future work.