Although multi-turn inference remains more expensive than single-call retrieval, VecTree-RAG provides a structure-aware and traceable architecture for scientific literature question answering.
Abstract
Scientific question answering requires a retrieval system to solve two distinct problems: identifying which papers are relevant and locating the supporting evidence within those papers. Conventional retrieval-augmented generation typically addresses both through similarity search over fixed-length passages, flattening document structure and separating scientific claims from their methodological and argumentative context. We present VecTree-RAG, an agentic framework that assigns these tasks to complementary retrieval mechanisms. Vector search ranks compact document and section representations across the corpus, whereas reasoning-guided traversal of source-verified section trees localizes evidence within shortlisted papers. Full text is retained in a page store and exposed progressively only after structural localization. We evaluate VecTree-RAG on 300 QASPER questions, an open-access subset of 54 LitQA2 questions, and 49 multi-document MOSAIC questions. Compared with Dense RAG, reranked Dense RAG, RAPTOR, and Search-o1, VecTree-RAG obtained the highest observed answer score on all three benchmarks, reaching 0.800 LLM-judge correctness on QASPER, 0.925 accuracy on LitQA2, and a 0.547 composite score on MOSAIC. On QASPER, its evidence-page precision was 0.274, compared with 0.046--0.071 for the baselines. LitQA2 ablations further showed that the complete vector--tree architecture required fewer inference tokens than variants without tree navigation or corpus-level vector routing. These results indicate that vector retrieval narrows the corpus-level search space and tree navigation concentrates reading on structurally relevant evidence. Although multi-turn inference remains more expensive than single-call retrieval, VecTree-RAG provides a structure-aware and traceable architecture for scientific literature question answering.
Evaluation on a multi-page technical PDF document shows that the hybrid retrieval and re-ranking stages together raise retrieval precision and reduce irrelevant or unsupported answers compared with retrieval limited to a single method, supporting the use of this approach for reliable, document-grounded question answering.
Vishwa K Dave, K. Pallavi· International Research Journ...· 0 citations
The evidence indicates that no single RAG or vector-database configuration dominates across retrieval quality, faithfulness, latency, throughput, storage, cost, and scalability, and the review positions RAG–vector database integration as a joint retrieval-and-systems optimization problem rather than a database-selection problem alone.
Muhammad Fuad Bin Abdullah, Safwan Abd Razak, Noorrezam Yusop et al.· International journal of res...· 0 citations
This work proposes EnSI-RAG (Entity-Structure-Indexed Retrieval-Augmented Generation), a framework that constructs a query-independent, entity-centered index that separates evidence localization from answer synthesis while preserving traceable source evidence.
Xuan-Yu Meng, Jiashuo Sun, Jash Parekh et al.· 0 citations
Experimental results show that SAC-RAG reduces token consumption by 38%–58% at the cost of only a 1–2 percentage point EM drop, with EM actually improving after compression for reasoning-type questions, achieving the optimal quality–efficiency trade-off in terms of token consumption.
Deyu Zhang, Hongqiang Yu, Jinze Huo et al.· IEEE Access· 0 citations
Retrieval-Augmented Generation (RAG) has improved the factual grounding of large language models; however, conventional retrieval strategies remain limited for long-document question answering, as relevant information is often distributed across multiple document sections and may be inferential rather than lexically similar to the query. This paper proposes a reasoning-aware hierarchical traversal mechanism that interleaves chain-of-thought generation at each depth-first search node evaluation step, incorporating the resulting reasoning embedding into a combined node scoring function alongside query similarity. The hierarchical tree is constructed through iterative chunking, embedding, clustering, and summarization; retrieval is then guided by this combined score under a dual-threshold pruning mechanism that adaptively controls traversal depth and breadth. The proposed approach is evaluated on the NarrativeQA and QuALITY benchmarks against a semantic similarity-based traversal baseline. On QuALITY, the method achieves marginal gains in overall accuracy (+0.7%) and F1 (+0.1%), while substantially reducing the abstain rate from 4.1% to 1.8%, with improvement concentrated on normal-difficulty questions; on hard questions, the baseline outperforms the proposed method. On NarrativeQA, ROUGE-L F1, BLEU-1, and BLEU-4 improve slightly, though METEOR decreases, reflecting inconsistent metric-level effects. These results suggest that step-wise CoT reasoning can improve node selection quality in hierarchical traversal, with gains most evident on standard-difficulty questions. Performance on hard questions and metric-level consistency across NarrativeQA remain open challenges, indicating that the quality of the generated reasoning signal is a key bottleneck for further improvement.
It is suggested that, in dense-urban POI settings where coordinates are reliable, the marginal benefit of explicit graph edges shrinks for coordinate-computable relationships, while structured spatial processing complements vector retrieval.
Noboru Otsuka· The International Archives o...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.