Searcharxiv⌕ Search

arXiv subjects

Guanxian Li

Publications and source records attributed to Guanxian Li.

3 recordsLinked to original sources

SAG2: Embedding-Free Multi-Hop Retrieval with BM25 and Decision Models

Multi-hop retrieval must find passages that become useful only after intermediate evidence is retrieved. We present SAG2, an embedding-free retriever whose only persistent structure is a SQLite lexical index, built without an LLM. Where SAG and HippoRAG 2 rely on a generative LLM for graph extraction and selection, SAG2 uses a decision model. Given the question and a shared context of selected retrieved passages, the decision model scores whether each candidate supplies an answer-chain fact. Terms activated from the top-scoring passages retrieve unvisited passages through the lexical index, which holds a passage-term hypergraph implicitly. SAG2 reaches Recall@10 of 86.62%, 97.43%, and 99.00% on 1,000-question subsets of MuSiQue, 2WikiMultiHopQA, and HotpotQA, the highest among the compared systems. With a decision model priced at about a fifth of SAG's LLM, indexing and retrieval on MuSiQue cost USD 4.33 against USD 14.85 for SAG. On EnterpriseRAG-Bench, SAG2 reaches 81.12% document Recall@10. As the benchmark's nested corpus grows 447.5-fold, SAG2's Recall@5 lead over BM25 alone widens from 7.28 to 14.76 points, at a nearly constant model cost per question. Because indexing makes no model call, SAG2 suits corpora that change often or must be searchable as soon as they are indexed.

cs.CL↗

SAG: SQL-Retrieval Augmented Generation with Query-Time Dynamic Hyperedges

While retrieval-augmented generation (RAG) has proven effective at giving LLMs access to external knowledge, mainstream dense-retrieval implementations remain inherently limited in handling structured constraints and multi-hop reasoning. Graph-based methods address this by constructing knowledge graphs offline, but they often fragment semantics, incur high maintenance, and complicate incremental updates. We propose SAG (SQL-Retrieval Augmented Generation), a structured retrieval architecture that organizes documents into an event-entity index without building a global knowledge graph. SAG represents each chunk as a semantically complete event paired with its entities, forming a latent hyperedge that preserves n-ary relations without decomposing them into triples. At query time, SAG treats shared entities as join keys to connect related chunks. This dynamically yields a query-scoped neighborhood of events, and yet every piece of evidence remains the original chunk throughout. Experiments on HotpotQA, 2WikiMultiHopQA, and MuSiQue show that SAG achieves the best retrieval and end-to-end QA performance on every benchmark, with gains that widen as reasoning-chain complexity increases. On MuSiQue, where multi-hop evidence chaining is most demanding, SAG reaches 80.36% Recall@5, outperforming the strongest baseline by 11.52 points. This work paves the way for knowledge infrastructure that enables LLM agents to retrieve and reason over continually growing organizational knowledge.

cs.CL↗

SAG: SQL-Retrieval Augmented Generation with Query-Time Dynamic Hyperedges

While retrieval-augmented generation (RAG) has proven effective at giving LLMs access to external knowledge, mainstream dense-retrieval implementations remain inherently limited in handling structured constraints and multi-hop reasoning. Graph-based methods address this by constructing knowledge graphs offline, but they often fragment semantics, incur high maintenance, and complicate incremental updates. We propose SAG (SQL-Retrieval Augmented Generation), a structured retrieval architecture that organizes documents into an event-entity index without building a global knowledge graph. SAG represents each chunk as a semantically complete event paired with its entities, forming a latent hyperedge that preserves n-ary relations without decomposing them into triples. At query time, SAG treats shared entities as join keys to connect related chunks. This dynamically yields a query-scoped neighborhood of events, and yet every piece of evidence remains the original chunk throughout. Experiments on HotpotQA, 2WikiMultiHopQA, and MuSiQue show that SAG achieves the best retrieval and end-to-end QA performance on every benchmark, with gains that widen as reasoning-chain complexity increases. On MuSiQue, where multi-hop evidence chaining is most demanding, SAG reaches 80.36% Recall@5, outperforming the strongest baseline by 11.52 points. This work paves the way for knowledge infrastructure that enables LLM agents to retrieve and reason over continually growing organizational knowledge.

cs.CL↗