SkillMem: Compact External Skill Memory for Latent Multi-Agent Reasoning
Summary
SkillMem introduces a compact external latent memory for reusable skills in latent multi-agent reasoning, achieving 38× storage reduction and up to 4.23× inference speedup across benchmarks with Qwen3 models from 4B to 14B.
View Cached Full Text
Cached at: 10/31/26, 09:13 AM
# SkillMem: Compact External Skill Memory for Latent Multi-Agent Reasoning
Source: [https://arxiv.org/abs/2610.37935](https://arxiv.org/abs/2610.37935)
[View PDF](https://arxiv.org/pdf/2610.37935)[HTML \(experimental\)](https://arxiv.org/html/2610.37935v1)
> Abstract:Latent multi\-agent systems reduce inference cost by keeping intermediate reasoning and inter\-agent communication in continuous representations\.\\ Reusable skills, however, are commonly supplied as text or stored as layer\-wise Key\-Value states or skill\-specific model parameters, introducing repeated processing or substantial per\-skill storage\.\\ We introduce \\textbf\{SkillMem\}, which represents each reusable skill as a small external latent memory and makes it directly available during latent multi\-agent reasoning\.\\ A role\-conditioned cross\-attention reader allows the same memory to guide different agents according to their roles and current hidden states\.\\ We train the skill memories and shared reader through behavioral distillation, matching the change in token predictions induced by a textual skill while keeping the backbone frozen\.\\ For our experiments, we obtain textual skills from paired successful and failed multi\-agent trajectories, although existing skills can also be compiled directly\.\\ Across six benchmarks and Qwen3 models ranging from 4B to 14B parameters, SkillMem provides strong gains for smaller backbones while preserving efficient latent multi\-agent inference across model scales\.\\ We use the same $8\\times256$ memory configuration across all evaluated model scales, requiring 9\.6\\,KB of skill\-specific storage per skill, including its retrieval embedding\.\\ For a library of 100 skills, SkillMem reduces total storage by more than $38\\times$ compared with alternative skill representations and achieves up to a $4\.23\\times$ end\-to\-end inference speedup\.\\ These results show that compact procedural memories can be reused without sacrificing the efficiency of latent multi\-agent reasoning\.
## Submission history
From: Yuxuan Zhu \[[view email](https://arxiv.org/show-email/9cb118cf/2610.37935)\] **\[v1\]**Tue, 27 Oct 2026 20:25:47 UTC \(1,646 KB\)Similar Articles
SPEM: Structure-Aware Procedural Memory for Efficient Skill Use in LLM Agents
The paper proposes SPEM, a structure-aware procedural memory framework for LLM agents that combines atomic skill memory with Skill-DAG templates and Skill-GNN retrieval, achieving 87.1% success on ALFWorld and 38.38% reward on SkillsBench while reducing token and runtime costs.
Experience Makes Skillful: Enabling Generalizable Medical Agent Reasoning via Self-Evolving Skill Memory
This paper introduces SkeMex, a self-evolving framework that enhances medical agents by distilling interaction trajectories into structured skill memory, enabling better long-term clinical reasoning through context-dependent utility estimation and governance.
SkillLens: Adaptive Multi-Granularity Skill Reuse for Cost-Efficient LLM Agents
This paper introduces SkillLens, a hierarchical framework for adaptive multi-granularity skill reuse in LLM agents, demonstrating improved accuracy and cost-efficiency on benchmark tasks.
SimpleMem: Efficient Lifelong Memory for LLM Agents
Introduces SimpleMem, an efficient memory framework for LLM agents that uses semantic lossless compression to improve accuracy and reduce token consumption, achieving 26.4% F1 improvement and up to 30x reduction in inference-time token usage.
SkillEffect: Checked Lowering for Memory-Bounded Agent Tools
SkillEffect introduces a checked-lowering runtime for AI agent tools that enforces memory bounds through audited implementations, significantly reducing peak memory usage and improving completion rates under memory constraints.