G-Long: Graph-Enhanced Memory Management for Efficient Long-Term Dialogue Agents

작성자

카테고리:

← 피드로
arXiv cs.AI · Minjun Choi, Yoonjin Jang, Sangwon Youn, Youngjoong Ko · 2026-06-12 AI

[Submitted on 11 Jun 2026]

View PDF HTML (experimental)

Abstract:While Large Language Models (LLMs) have advanced open-domain dialogue systems, maintaining long-term consistency remains a challenge due to inherent limitations in long-context reasoning and the inefficiency of processing extensive raw text. Existing approaches typically rely on either unstructured memory storage, which is prone to information loss, or computationally expensive LLMs that incur high latency. To address these limitations, we propose G-Long, a graph-enhanced framework that utilizes a fine-tuned small Language Model (sLM) for structured triplet extraction and associative retrieval, significantly reducing operational costs. Furthermore, we introduce the novel attention-aware importance scoring mechanism that leverages the intrinsic cross-attention signals of a T5 summarizer to identify salient memories. Extensive experiments across diverse benchmarks demonstrate that G-Long achieves state-of-the-art performance in both response generation and memory retrieval, yielding performance gains of up to 9.8% in response quality on MSC and 40.8% in retrieval recall on LME, while significantly minimizing computational overhead.

Submission history

From: Yoonjin Jang [view email]
[v1] Thu, 11 Jun 2026 09:42:13 UTC (783 KB)

원문에서 계속 ↗

추출 본문 · 출처: arxiv.org · https://arxiv.org/abs/2606.13115

코멘트

답글 남기기

이메일 주소는 공개되지 않습니다. 필수 필드는 *로 표시됩니다