- Rating
- 3(+1)
- Confidence
- 2(−1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a new framework to conduct post-optimization of AscendC operators. The optimization process are divided into two parts, kernel program, and tiling program. For kernel program, the authors build a shared experience bank by rewinding strong existing implementations, which can be retrieved to offer inspirations to the optimizing agent. For tiling program, evolution search with hardware in the loop helps to accelerate the operators on the specific hardware. Formulating AscendC optimization as a coupled problem of host-side tiling and device-side kernel refinement, using rewind strategy to build knowledge base and introducing hardware feedback to search progress, the framework achieves best results on a transductive benchmark, which could be a good contribution to AscendC Optimization.
Critical strengths
-
The authors uses Optimization Rewind to get reusable and verified experience in the field with limited external references, which might also be useful for other fields.
-
The authors uses comparison experiments between Doc-KB and Rewind, and shows the effectiveness of Rewind strategy, which offers a great insight of how to inject knowledge to better help models.
Critical weaknesses
-
Test-set information leaks into the experience bank. Rewind mines motifs from all 101 benchmark operators, and the same bank is then used to optimize them. Self-source retrieval is only "audited," not excluded, and no leave-one-operator-out ablation is provided. The 1.21× speedup thus mixes genuine knowledge transfer with intra-benchmark information recycling.
-
Comparison is fair only on hardware evaluations. Baselines match the 230-evaluation budget, but the extra LLM cost of the Rewind pipeline is unreported, and no baseline gets comparable cross-operator information access. A key controlled baseline is missing: plain RAG over raw, undistilled kernels, which would isolate the value of Rewind distillation itself.
-
Generalization evidence is thin. The only inductive test uses 8 single-category held-out operators; gains shrink to 1.06 vs. 1.02 against the authors' own ablation only, with no external baseline compared under the same budget.
Questions for authors
- Can Rewind beat Doc-KB on eight held-out operators?
- Can AscendOptimizer beat other frameworks like OpenEvolve on eight held-out operators?
- How much budget do Stage I and Stage II use respectively in 230 turns?
- How much speedup do the 6.5% self-sourced retrievals contribute?