כתבה
arXiv cs.CL ·
Co-Evolving Graph and Text Memory for Training-Free Multi-Hop Question Answering
תקציר מקורי באנגליתarXiv:2607.23278v1 Announce Type: new Abstract: Multi-hop question answering requires coordinating relational and textual evidence across reasoning steps, a combination neither a text corpus nor a knowledge graph can supply alone. Prior work often emphasizes only part of this loop: graph-augmented RAG retrieves from a pre-built or query-updated graph, KGQA systems search within topic-centered subgraphs, and memory-augmented agents maintain evolving memories without continuously reconciling graph memory with textual context. We propose Co-E, a training-free system built around synchronized bidirectional graph-text working memory. A synchronization cycle consolidates textual memory, extracts relational triples into graph memory, and injects graph facts back into the generation context. Becau
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית