REVIEW 10 cited by
SuRe: Summarizing Retrievals using Answer Candidates for Open-domain QA of LLMs
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
read the original abstract
Large language models (LLMs) have made significant advancements in various natural language processing tasks, including question answering (QA) tasks. While incorporating new information with the retrieval of relevant passages is a promising way to improve QA with LLMs, the existing methods often require additional fine-tuning which becomes infeasible with recent LLMs. Augmenting retrieved passages via prompting has the potential to address this limitation, but this direction has been limitedly explored. To this end, we design a simple yet effective framework to enhance open-domain QA (ODQA) with LLMs, based on the summarized retrieval (SuRe). SuRe helps LLMs predict more accurate answers for a given question, which are well-supported by the summarized retrieval that could be viewed as an explicit rationale extracted from the retrieved passages. Specifically, SuRe first constructs summaries of the retrieved passages for each of the multiple answer candidates. Then, SuRe confirms the most plausible answer from the candidate set by evaluating the validity and ranking of the generated summaries. Experimental results on diverse ODQA benchmarks demonstrate the superiority of SuRe, with improvements of up to 4.6% in exact match (EM) and 4.0% in F1 score over standard prompting approaches. SuRe also can be integrated with a broad range of retrieval methods and LLMs. Finally, the generated summaries from SuRe show additional advantages to measure the importance of retrieved passages and serve as more preferred rationales by models and humans.
Forward citations
Cited by 10 Pith papers
-
HALT: Verification-Aware Stopping for Retrieval-Augmented Search Agents
A per-hop evidence coverage verifier can stop multi-hop retrieval agents early, cutting search loops by up to 45% while preserving standardized-extractor exact match.
-
LLM Embedding-based Attribution (LEA): Quantifying Source Contributions to Generative Model's Response for Vulnerability Analysis
LEA uses rank-based linear dependence of layer-0 hidden states to attribute each response token to query, retrieved context, or internal knowledge, and distinguishes valid from generic retrieval with over 95% accuracy.
-
Toward Structured Knowledge Reasoning: Contrastive Retrieval-Augmented Generation on Experience
CoRE improves structured knowledge reasoning by retrieving both correct and incorrect past examples into the prompt, using MCTS-generated experience memory.
-
GainRAG: Preference Alignment in Retrieval-Augmented Generation through Gain Signal Synthesis
GainRAG aligns retriever and LLM preferences by training a selector on contrastive-perplexity 'gain' signals plus a pseudo-passage fallback, improving RAG accuracy on six QA datasets.
-
Atom-Searcher: Enhancing Agentic Deep Research via Fine-Grained Atomic Thought Reward
A new RL framework that rewards fine-grained reasoning steps, called Atomic Thoughts, claims better agentic deep research on seven benchmarks.
-
FlexRAG: A Flexible and Comprehensive Framework for Retrieval-Augmented Generation
FlexRAG is a modular, open-source RAG framework with text, multimodal, and web retrieval, plus evaluation tools and efficient memory-mapped indexing.
-
Optimizing Question Semantic Space for Dynamic Retrieval-Augmented Multi-hop Question Answering
Q-DREAM improves multi-hop retrieval-augmented QA by decomposing questions, rewriting dependent subquestions, and retrieving with cluster-specific LoRA embeddings.
-
ComposeRAG: A Modular and Composable RAG for Corpus-Grounded Multi-Hop Question Answering
A modular, verifier-driven RAG pipeline with iterative re-decomposition outperforms fine-tuned and agentic baselines on four multi-hop QA benchmarks.
-
Removal of Hallucination on Hallucination: Debate-Augmented RAG
DRAG adds structured multi-agent debates to both the retrieval and generation stages of RAG, improving multi-hop QA accuracy while showing mixed single-hop results.
-
Benchmarking Poisoning Attacks against Retrieval-Augmented Generation
A unified benchmark evaluation finds that existing RAG poisoning attacks remain effective on standard QA datasets, drop on expanded knowledge bases, and are only partially mitigated by current defenses.
Discussion (0). Sign in to comment.