SuRe: Summarizing Retrievals using Answer Candidates for Open-domain QA of LLMs

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. 1 * This work is done when Jaehyung Kim was at KAIST.