Graph-free Retrieval with Graph-Modified Embeddings

arXiv:2610.18410v1 Announce Type: cross Abstract: Dense vector retrieval can miss evidence connected through intermediate entities, while direct graph retrieval requires access to the graph at query time. We compare five offline graph-based embedding transformations and strategies for using the resulting graph-modified embeddings alongside the originals, without query-time graph access. On a synthetic professional-network benchmark with complete supporting-evidence sets, direct replacement of the original embeddings reduces evidence recovery. Multi-stage strategies improve recovery by using graph-modified embeddings to guide the search while retaining the originals for semantic relevance. On questions requiring linked facts or comparisons among candidates, the strongest configuration improves recovery by up to 25.9% relative to plain vector retrieval. It also matches baseline recovery with 40% fewer returned nodes. Controls confirm that graph information contributes beyond multi-stage retrieval alone. Across the tested methods, retrieval performance depends more on how graph-modified embeddings are used than on how they are produced.

Related

• Knowledge Graphs as Files: An Agent Harness Where Tool Creation and Tool Use Co-Evolve
• OmniRetrieval: Unified Retrieval across Heterogeneous Knowledge Sources
• Natural Language Knowledge Graph Query Execution: Leveraging Controlled Semantics in the LLM Context Window
• Relational-Core Graph Analytics Querying graphs at SQL scale, and why the node/edge model is a performance tax, not a truer picture of connected data
• Evidence Graph Consistency in Retrieval-Augmented Generation: A Model-Dependent Analysis of Hallucination Detection

Source: arXiv cs.AI | 2026-10-15