arXiv AI By Ran Zhou, Zehui Kong, Fanyu Lin, Jiaheng Liu, Zhen Zhang, Yuxiang Ren

SPEM: Structure-Aware Procedural Memory for Efficient Skill Use in LLM Agents

Read the original on arXiv AI →

SPEM is a lightweight, structure‑aware procedural memory framework designed to improve skill use in large language model agents. It stores individual skills in an Atomic Skill Memory and reusable skill compositions in a Skill‑DAG Memory, reusing high‑confidence templates when possible and falling back to atomic skills with a Skill‑GNN for state‑aware selection. The system writes successful executions back as new Skill‑DAGs, enabling continuous accumulation of procedural knowledge and achieving higher effectiveness‑efficiency trade‑offs on ALFWorld and SkillsBench benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 6

LatentSkill: From In-Context Textual Skills to In-Weight Latent Skills for LLM Agents

arXiv:2606. 06087v1 Announce Type: cross Abstract: Agent systems increasingly use textual skills to encode reusable task procedures, but injecting these skills into the prompt at every step incurs substantial context overhead and exposes skill content as plaintext.

By Aofan Yu, Chenyu Zhou, Tianyi Xu, Zihan Guo, Rong Shan, Zhihui Fu, Jun Wang, Weiwen Liu, Yong Yu, Weinan Zhang, Jianghao Lin
arXiv AI
Oct 2

SkillLens: Adaptive Multi-Granularity Skill Reuse for Cost-Efficient LLM Agents

SkillLens introduces a hierarchical skill-evolution framework that organizes skills into a four-layer graph of policies, strategies, procedures, and primitives, allowing retrieval at mixed granularity. The system first retrieves semantically relevant skill seeds, expands them via a degree‑corrected random walk, and uses a verifier to decide whether to accept, decompose, rewrite, or skip each visited unit. This approach enables agents to reuse compatible subskills while locally adapting mismatched components, and theoretical analysis shows sublinear cost under sparse mismatch assumptions, with empirical results on MuLocbench and ALFWorld demonstrating consistent improvements over strong baselines.

By Ziyang Yu, Yongliang Miao, Liang Zhao, Bowen Zhu, Hasibul Haque