Sign inGet started
Paper · arXiv

SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory

Long-term memory is becoming a central bottleneck for language agents. Exsting RAG and GraphRAG systems largely treat memory graphs as static retrieval middleware, which limits their ability to recover complete evidence chains from partial cues, exploit reusable graph-structrual roles, and improve the memory itself through downstream feedback. We introduce SAGE, a Self-evolving Agentic Graph-memory Engine that models graph memory as a dynamic long-term memory substrate. SAGE couples two roles: a memory writer that incrementally constucts structured graph memory from interaction histories, and a Graph Foundation Model-based memory reader to perform retrieval and provide feedback to the mem...

AuthorsJuntong Wang, Haoyue Zhao, guanghui Pan et al.
Primary categorycs.AI
Published12 May 2026
Last updated at source22 September 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/785a29c7-e19a-4c91-bc44-b11e67791a87" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.