arXiv AI
Graph-free Retrieval with Graph-Modified Embeddings
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Aug 25
Hypergraph Embedding Indexing for Efficient Dense Vector Retrieval
arXiv:2608.22980v1 Announce Type: cross Abstract: Dense vector retrieval has become the foundation of modern semantic search, yet existing approximate nearest neighbor (ANN) indexes treat an embeddin...
arXiv AI
Sep 30
Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning
arXiv:2609.36359v1 Announce Type: new Abstract: Graph-based approximate nearest neighbor search (ANNS) is widely used for large-scale semantic search. Its indices are constructed primarily based on g...
arXiv AI
Aug 12
GraFine: Retrieval-Time Refinement for Efficient Graph RAG over Corpus Graphs
arXiv:2601. 18579v2 Announce Type: replace-cross Abstract: Graph RAG on corpus graphs enhances retrieval by leveraging intermediate node content as contextual clues to uncover unretrieved oracle nodes.
arXiv Computation and Language
Sep 30
Corpus-Guided Dual-Path Propagation for Graph Retrieval-Augmented Generation
arXiv:2609.37661v1 Announce Type: new Abstract: Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free g...
arXiv Machine Learning
Jun 9
GraphER: An Efficient Graph-Based Enrichment and Reranking Method for Retrieval-Augmented Generation
arXiv:2603. 24925v2 Announce Type: replace Abstract: Retrieval-augmented generation (RAG) systems that rely on semantic search often fail to retrieve the complete set of evidence for complex queries, particularly when information is distributed across multiple sources.
arXiv Computation and Language
Sep 7
CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation
CAGE: Coherence-Aware Graph Encoding for Retrieval-Augmented Generation introduces a reranking framework that evaluates and enhances the coherence of retrieved passages across four dimensions—Intra-Domain Relevance, Noise Resistance, Informational Bonding, and Factual Consistency. The method transforms passages into directed heterogeneous entity graphs, reweights factual anchors, encodes structural patterns with a Relational Graph Convolutional Network, and fuses inter-chunk coherence with query relevance to produce a final ranking. Evaluations on four multi‑hop benchmarks show that CAGE matches or surpasses strong baselines, improving Recall@5 on bridge‑dominated datasets and consistently boosting downstream Exact Match scores, indicating that structurally coherent context leads to more precise answers even when retrieval recall is similar or lower.