From Experience to Expertise: Adoption-Aware Memory Learning for Data-Scarce NPU Kernel Synthesis
Not on the map. Why?
Abstract (arXiv)
High-performance kernels underpin efficient accelerator execution but require expert tuning and lengthy manual optimization cycles. LLM coding agents promise automation, yet their CUDA knowledge transfers poorly to data-scarce domain-specific architectures (DSAs) such as NPUs, whose execution models and memory hierarchies differ substantially from those of GPUs. To address this transfer gap, post-training methods adapt LLMs to NPU programming but depend on scarce expert data and substantial training compute. Memory-learning agents instead adapt through external memory, but their uniform credit assignment gives adopted and unused experiences the same reward target, potentially biasing subsequent retrieval rankings. Moreover, when learned values guide only retrieval, high-value experiences that generalize across operators must be retrieved repeatedly rather than retained in context, thereby increasing retrieval overhead and weakening cross-task guidance. We therefore present SAGE, a persistent self-improving agent for NPU kernel synthesis. Adoption-Traced Utility estimation (ATU) combines explicit adoption records with kernel evaluation outcomes for adoption-aware credit assignment. Utility-Gated Consolidation (UGC) uses positive utility and repeated adoption across operators to select and abstract reusable rules into a bounded resident context. On NPUKernelBench, SAGE achieves a 95.5% execution rate versus 84.1% for the strongest controlled baseline, with 86.9% of solved operators outperforming torch_npu. With GLM-5.3, SAGE achieves a 43.99x speedup over the torch_npu reference on sparse flash attention. These results show that adoption-aware credit assignment and selective consolidation enable agents to accumulate and reuse hardware-specific knowledge across tasks.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 34 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
29 of 34 references.
References · 29
- 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,276
- 2022Scaling Instruction-Finetuned Language Modelscited by 3,024
- 2023Voyager: An Open-Ended Embodied Agent with Large Language Modelscited by 2,191
- 2023MemGPT: Towards LLMs as Operating Systemscited by 1,389
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
- 2023ExpeL: LLM Agents Are Experiential Learnerscited by 876
- 2025From RAG to Memory: Non-Parametric Continual Learning for Large Language Modelscited by 231
- 2025KernelBench: Can LLMs Write Efficient GPU Kernels?cited by 225
- 2026MemRL: Self-Evolving Agents via Runtime Reinforcement Learning on Episodic Memorycited by 129
- 2025Memento: Fine-tuning LLM Agents without Fine-tuning LLMscited by 127
- 2026Qwen3-Coder-Next Technical Reportcited by 71
- 2025CUDA-L1: Improving CUDA Optimization via Contrastive Reinforcement Learningcited by 61
17 more
- 2026CUDA Agent: Large-Scale Agentic RL for High-Performance CUDA Kernel Generationcited by 47
- 2023Settling the Sample Complexity of Online Reinforcement Learningcited by 45
- 2025CudaForge: An Agent Framework with Hardware Feedback for CUDA Kernel Optimizationcited by 45
- 2025AccelOpt: A Self-Improving LLM Agentic System for AI Accelerator Kernel Optimizationcited by 23
- 2026Dr. Kernel: Reinforcement Learning Done Right for Triton Kernel Generationscited by 22
- 2023A Survey on Deep Learning Hardware Accelerators for Heterogeneous HPC Platformscited by 21
- 2025QiMeng-Kernel: Macro-Thinking Micro-Coding Paradigm for LLM-Based High-Performance GPU Kernel Generationcited by 19
- 2023Exploring Distributional Shifts in Large Language Models for Code Analysiscited by 14
- 2026AscendKernelGen: A Systematic Study of LLM-Based Kernel Generation for Neural Processing Unitscited by 12
- 2026Towards Automated Kernel Generation in the Era of LLMscited by 11
- 2026AscendCraft: Automatic Ascend NPU Kernel Generation via DSL-Guided Transcompilationcited by 7
- 2026MemQ: Integrating Q-Learning into Self-Evolving Memory Agents over Provenance DAGscited by 5
- 2026Towards Cold-Start Drafting and Continual Refining: A Value-Driven Memory Approach with Application to NPU Kernel Synthesiscited by 3
- 2026AscendOptimizer: Episodic Agent for Ascend NPU Operator Optimizationcited by 3
- 2026NKI-Agent: Domain-Specific Fine-Tuning and Agentic Tool Use for Neuron Kernel Generationcited by 2
- 2026Hawk: Harnessing Hardware-Aware Knowledge for High-Performance NPU Kernel Generationcited by 1
- 2026AgenticCANN: Automated Ascend C Operator Generation via Knowledge-Augmented Agentic Evolutioncited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Prior Knowledge or Search? A Study of LLM Agents in Hardware-Aware Code Optimization
- 2026Beyond Scaling: Self-Evolving LLM Agents for Hardware Kernel Optimization via an Experience-Driven Workflow and Experience Graph Memory
- 2026Learning When to Optimize: Verified Optimization Skills from Expert GPU-Kernel Lineages
- 2026KernelBlaster: Continual Cross-Task CUDA Optimization via Memory-Augmented In-Context Reinforcement Learning
- 2026KernelCraft: Benchmarking for Agentic Close-to-Metal Kernel Generation on Emerging Hardware
- 2025STARK: Strategic Team of Agents for Refining Kernels
- 2026Rosetta Memory: Adaptive Memory for Cross-LLM Agents
- 2026KernelGenBench: Can LLMs and Agents Write Efficient Kernels Across Operator Sources and Hardware Platforms?