Pith. sign in

REVIEW 2 cited by

SUNAR: Semantic Uncertainty based Neighborhood Aware Retrieval for Complex QA

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.17990 v1 pith:R3JEPARP submitted 2025-03-23 cs.IR

classification cs.IR
keywords complexdocumentsretrievalsunarllmsneighborhoodapproachaware
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Complex question-answering (QA) systems face significant challenges in retrieving and reasoning over information that addresses multi-faceted queries. While large language models (LLMs) have advanced the reasoning capabilities of these systems, the bounded-recall problem persists, where procuring all relevant documents in first-stage retrieval remains a challenge. Missing pertinent documents at this stage leads to performance degradation that cannot be remedied in later stages, especially given the limited context windows of LLMs which necessitate high recall at smaller retrieval depths. In this paper, we introduce SUNAR, a novel approach that leverages LLMs to guide a Neighborhood Aware Retrieval process. SUNAR iteratively explores a neighborhood graph of documents, dynamically promoting or penalizing documents based on uncertainty estimates from interim LLM-generated answer candidates. We validate our approach through extensive experiments on two complex QA datasets. Our results show that SUNAR significantly outperforms existing retrieve-and-reason baselines, achieving up to a 31.84% improvement in performance over existing state-of-the-art methods for complex QA.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sample Efficient Demonstration Selection for In-Context Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    CASE is a top-m linear bandit algorithm with challenger-arm sampling that selects exemplar subsets for in-context learning using up to 7x fewer LLM calls than prior methods.

  2. RAGtifier: Evaluating RAG Generation Approaches of State-of-the-Art RAG Systems for the SIGIR LiveRAG Competition

    cs.IR 2025-06 conditional novelty 4.0 of 10

    A RAG pipeline using InstructRAG, Pinecone, and BGE placed third in the 2025 LiveRAG Challenge, though internal evaluation only weakly predicted official scores.

Pith tools