aiqbench analysis
This paper introduces HGP, a hybrid graph memory framework designed to improve routing and retrieval for LLM-based agents operating on-device. By structuring episodic, semantic, and procedural memories as graphs rather than single vectors, the method preserves relational nuances while reducing reliance on large model calls. The approach demonstrates significant performance gains in personalized solution selection benchmarks, addressing critical bottlenecks in autonomous agent deployment.
HGP:An on-device personalized agent memory via hybrid graph storage
arXiv:2610.10071v1 Announce Type: new Abstract: LLM-based agents face challenges in personalized interactive tasks due to heterogeneous, multi-typed, and implicitly constrained long-term traces. Existing memory mechanisms struggle with accurate routing and retrieval, especially on-device where personalization is critical. Most methods use single-vector representations, blurring type distinctions and relational structure. We propose HGP, a hybrid graph memory framework. HGP employs a lightweight self-enhancement classifier for personalized memory routing and constructs episodic, semantic, and procedural memories as graphs. It also extracts working memory as a state trajectory to capture current state and implicit constraints, ensuring reliable decision-making. The classifier reduces large-model calls, enabling on-device deployment, while graph storage enables accurate retrieval and incremental user profile refinement. Experiments on two benchmarks show that on PAL-Set solution selection, HGP achieves an S-score of 35.58, nearly 7 points above the strongest baseline. Code and data are at https://github.com/Ouan6/HGP-.git.
Abstract:LLM-based agents face challenges in personalized interactive tasks due to heterogeneous, multi-typed, and implicitly constrained long-term traces. Existing memory mechanisms struggle with accurate routing and retrieval, especially on-device where personalization is critical. Most methods use single-vector representations, blurring type distinctions and relational structure. We propose HGP, a hybrid graph memory framework. HGP employs a lightweight self-enhancement classifier for personalized memory routing and constructs episodic, semantic, and procedural memories as graphs. It also extracts working memory as a state trajectory to capture current state and implicit constraints, ensuring reliable decision-making. The classifier reduces large-model calls, enabling on-device deployment, while graph storage enables accurate retrieval and incremental user profile refinement. Experiments on two benchmarks show that on PAL-Set solution selection, HGP achieves an S-score of 35.58, nearly 7 points above the strongest baseline. Code and data are at this https URL.
Artificial Intelligence (cs.AI)
arXiv:2610.10071 [cs.AI]
(or arXiv:2610.10071v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2610.10071 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 233 words
Related coverage

AWS vector solutions: Build agentic AI where your data lives
AWS · Aug 20, 2026
DI Series: Serving Kimi-K3 MXFP4 Wide-EP Disaggregated on AMD Instinct MI300X and MI325X
AMD · Oct 8, 2026
ROCm 10.1: Breaking the Data-Movement Bottleneck
AMD · Oct 5, 2026

Serving 64Mi-Token Contexts on One AMD Instinct™ MI355X Node
AMD · Aug 24, 2026