Jul 2026· Annual International ACM SIGIR Conference on Research and Development in Information Retrieval· pp. 4034-4039· 0 citations· 29 references
Computer Science
TL;DR
StAR (Structure-Aware Reranking), a plug-and-play reranking module that injects hyperbolic structural similarity into GraphRAG ranking, suggests that restoring structural faithfulness through hyperbolic structural scoring improves ranking consistency for multi-hop QA.
Abstract
Retrieval-Augmented Generation (RAG) often struggles with multi-hop reasoning because Euclidean embeddings collapse hierarchical structure and let semantic similarity dominate ranking, leading to semantic–structural misalignment. As a result, structurally irrelevant yet semantically similar candidates can outrank the evidence needed for multi-hop QA. We introduce StAR (Structure-Aware Reranking), a plug-and-play reranking module that injects hyperbolic structural similarity into GraphRAG ranking. StAR constructs tree-like representations of the query and candidate subgraphs, computes structure-aware similarity in hyperbolic space, and adaptively modulates structural contributions using a query-level alignment signal based on Spearman's ?. Experiments on four QA benchmarks show consistent gains, with the largest improvements on datasets with stronger hierarchical reasoning demands, while remaining robust on flatter retrieval settings. These results suggest that restoring structural faithfulness through hyperbolic structural scoring improves ranking consistency for multi-hop QA.
Traditional Retrieval-Augmented Generation (RAG) systems score each passage independently against the query, assembling context sets that may be individually relevant yet collectively incoherent. We introduce Coherence-Aware Graph Encoding (CAGE), a reranking framework that models"between-chunk coherence"across four di...
Tong Qi, Jing-Yu Wu, Youbing Yin et al.· 0 citations
Multi-hop retrieval-augmented generation (RAG) requires evidence that remains relevant to a query while introducing enough novelty to bridge semantic gaps. Dense retrieval tends to concentrate on semantically similar documents, whereas graph-based alternatives often depend on costly Large Language Model (LLM) entity ex...
Ze-Liang Li, Xiao-Fen Xing, K. Guo et al.· 0 citations
Asymmetric Dynamic Routing is proposed, an intent-conditioned retrieval framework operating over hierarchical knowledge graphs that maintains strong reasoning performance while reducing prompt token consumption and end-to-end query latency, yielding a favorable quality--efficiency trade-off for query-adaptive Hypergrap...
Qi Sun, Yi-Jia Zhang, Xing-Liang Hou et al.· 0 citations
This study introduces an Edge-Aware Fusion mechanism that leverages edge features as a bridge to adaptively integrate global and local structural information, thereby effectively addressing the alignment and integration of multi-granularity semantics.
Ling-Han Zeng, Yan-Ling Li, Ming-Xia Bi et al.· Tsinghua Science and Technol...· 0 citations
SimGAT, a structure-aware graph attention model built on SimRank-derived structural embeddings, is proposed, which computes structural similarity in the SimRank2Vec embedding space and injects it as a topological prior into the graph attention mechanism, enabling neighborhood aggregation to be jointly guided by node at...
Chengda Xu, Yinglong Zhang· Journal of King Saud Univers...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.