Co-Evolving Graph and Text Memory for Training-Free Multi-Hop Question Answering
Proposes Co-E, a training-free multi-hop QA system using synchronized bidirectional graph-text working memory. Implements a synchronization cycle that consolidates textual memory, extracts relational triples into graph memory, and injects graph facts back into generation context. Maintains both graph and textual memories to shape subsequent retrieval and reasoning steps. Evaluated on six multi-hop QA benchmarks, outperforming comparable training-free open-backbone baselines while remaining compe
Analysis
TL;DR
- Proposes Co-E, a training-free multi-hop QA system using synchronized bidirectional graph-text working memory.
- Implements a synchronization cycle that consolidates textual memory, extracts relational triples into graph memory, and injects graph facts back into generation context.
- Maintains both graph and textual memories to shape subsequent retrieval and reasoning steps.
- Evaluated on six multi-hop QA benchmarks, outperforming comparable training-free open-backbone baselines while remaining competitive with larger or trained systems.
Why It Matters
This work addresses a critical gap in multi-hop question answering by jointly leveraging structured (graph) and unstructured (textual) evidence without requiring model training. For AI practitioners, it demonstrates how memory-augmented architectures can achieve strong performance through architectural innovation rather than scale or fine-tuning, offering an efficient alternative for deployment in resource-constrained environments.
Technical Details
- Synchronized Bidirectional Memory: Co-E maintains two parallel memory structures—a text memory storing retrieved passages and a graph memory storing extracted relational triples—that are continuously updated and aligned during reasoning.
- Three-Step Synchronization Cycle:
- Consolidate textual memory by summarizing relevant passages.
- Extract subject-predicate-object triples from consolidated text to update graph memory.
- Inject graph-based facts back into the LLM’s generation context to inform next-step reasoning.
- Training-Free Design: Relies solely on pre-trained language models and off-the-shelf information extraction tools; no end-to-end fine-tuning or reinforcement learning is used.
- Benchmark Evaluation: Tested across six standard multi-hop QA datasets (e.g., HotpotQA, 2WikiMultihopQA), showing consistent gains over retrieval-augmented generation (RAG) and knowledge graph-only baselines.
Industry Insight
The co-evolution of graph and text memory offers a blueprint for building lightweight, interpretable reasoning systems suitable for enterprise applications where model transparency and low latency are paramount. As organizations increasingly adopt hybrid knowledge representations, this approach provides a scalable pathway to integrate structured databases with unstructured corpora without costly retraining cycles.
Disclaimer: The above content is generated by AI and is for reference only.