Sign inGet started
Paper · arXiv

Hierarchical Graph Memory for LLM Agents with Path-level Localization and Rewrite

Agents for long term reasoning require a memory that can be efficiently and effectively updated over time, as new facts and external feedback continue to arrive. Recently, graph memory has been adopted to offer structural organization for multi-hop retrieval and reasoning. However, existing methods store all memories in a flat graph, and accumulated historical memories can introduce irrelevant contexts and increase the cost of evidence selection during retrieval. Moreover, they typically update memory units independently, requiring repeated unit-wise rewrite to cover related changes. To address these issues, we propose HiGram, an evolving hierarchical graph memory framework with path-leve...

AuthorsXiawei Yue, Boran Wang, Xiaoqing Zhang et al.
Primary categorycs.AI
Published5 August 2026
Last updated at source5 August 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/a9935da7-1d6a-4a2d-a667-166c9e6b5b61" 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.