Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yunfan Wei

dblp:417/3547 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0002-3388-0481ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 33% Query processing and optimization · 33% Knowledge graphs · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs › knowledge graph reasoning
multi-hop reasoning
1.012026
PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation · WWW 2026
Query processing and optimization › query rewriting › query transformation
query decomposition
1.012026
PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation · WWW 2026
Information retrieval
retrieval-augmented generation
1.012026
PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation · WWW 2026

Methods — techniques the papers use, named apart from their topics

large language model · 1.0confidence-guided pruning · 1.0
YearPublicationVenuePosition
2026 PruneRAG: Confidence-Guided Query Decomposition Trees for Efficient Retrieval-Augmented Generation
abstract
Retrieval-augmented generation (RAG) has become a powerful framework for enhancing large language models in knowledge-intensive and reasoning tasks. However, as reasoning chains deepen or search trees expand, RAG systems often face two persistent failures: evidence forgetting, where retrieved knowledge is not effectively used, and inefficiency, caused by uncontrolled query expansions and redundant retrieval. These issues reveal a critical gap between retrieval and evidence utilization in current RAG architectures. We propose PruneRAG, a confidence-guided query decomposition framework that builds a structured query decomposition tree to perform stable and efficient reasoning. PruneRAG introduces three key mechanisms: adaptive node expansion that regulates tree width and depth, confidence-guided decisions that accept reliable answers and prune uncertain branches, and fine-grained retrieval that extracts entity-level anchors to improve retrieval precision. Together, these components preserve salient evidence throughout multi-hop reasoning while significantly reducing retrieval overhead. To better analyze evidence misuse, we define the Evidence Forgetting Rate as a metric to quantify cases where golden evidence is retrieved but not correctly used. Extensive experiments across various multi-hop QA benchmarks show that PruneRAG achieves superior accuracy and efficiency over state-of-the-art baselines. The code is publicly available.
Shuguang Jiao, Xinyu Xiao, Yunfan Wei, Shuhan Qi, Chengkai Huang, Quan Z. Sheng, Lina Yao 0001
WWW3