Challenge: Existing beam retrieval frameworks for multi-hop question answering were customized for two-hop questions and were poorly supervised.
Approach: They propose an end-to-end beam retrieval framework for multi-hop question answering . they combine an encoder and two classification heads to optimize the retrieval process .
Outcome: The proposed framework improves on MuSiQue-Ans and surpasses all previous retrievers on HotpotQA and achieves 99.9% precision on 2WikiMultiHopQA.

Similar Papers

Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering (D19-58)

Copied to clipboard

Challenge: Existing work on open-domain multi-hop question answering relies on off-the-shelf information retrieval techniques to retrieve answer passages.
Approach: They propose a new subproblem for open-domain multi-hop question answering . they aim to recognize the anchor from a set of start passages with a reading comprehension model .
Outcome: The proposed method significantly improves the baseline method on the open-domain hotpotQA benchmark.
Multi-Hop Paragraph Retrieval for Open-Domain Question Answering (P19-1)

Copied to clipboard

Challenge: Existing methods for textual question answering are capable of outperforming humans on certain tasks.
Approach: They propose a method for retrieving multiple supporting paragraphs from a large knowledge base.
Outcome: The proposed method achieves state-of-the-art over two well-known datasets, SQuAD-Open and HotpotQA, which serve as benchmarks for the proposed method.
Weakly Supervised Pre-Training for Multi-Hop Retriever (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for weakly supervised multi-hop pretraining require costly human annotation.
Approach: They propose a method for weakly supervised multi-hop retriever pretraining without human efforts by generating vector representations of complex questions and subquestion as weak supervision for pre-training.
Outcome: The proposed method is effective and robust on limited data and computational resources.
Don’t Forget the Base Retriever! A Low-Resource Graph-based Retriever for Multi-hop Question Answering (2025.emnlp-industry)

Copied to clipboard

Challenge: Existing GraphRAG approaches to multi-hop question answering rely on expensive LLM calls.
Approach: They propose a lightweight, low-resource, multi-step graph-based retriever for multi-hop QA that performs multi- step retrieval in a few hundred milliseconds.
Outcome: The proposed retriever outperforms conventional retrievers on multi-hop QA datasets and shows strong potential as a base retriever within multi-step agentic frameworks.
Multi-step Entity-centric Information Retrieval for Multi-Hop Question Answering (D19-58)

Copied to clipboard

Challenge: Multi-hop question answering (QA) requires an information retrieval system that can find multiple supporting evidence needed to answer the question.
Approach: They propose a technique that uses information of entities present in the initial retrieved evidence to learn to ‘hop’ onto other relevant evidence.
Outcome: The proposed method boosts retrieval performance on a multi-hop question answering dataset with 5 million Wikipedia paragraphs and a model without training increases its performance by 10.59 F1.
If You Want to Go Far Go Together: Unsupervised Joint Candidate Evidence Retrieval for Multi-hop Question Answering (2021.naacl-main)

Copied to clipboard

Challenge: et al. : evidence retrieval is highly dependent on partial, incorrect or no supporting knowledge.
Approach: They propose a method that retrieves and reranks evidence facts jointly . they propose to account for links between sentences and coverage with the given query .
Outcome: The proposed approach achieves state-of-the-art evidence retrieval performance on two multi-hop question answering datasets.
Do Multi-Hop Question Answering Systems Know How to Answer the Single-Hop Sub-Questions? (2021.eacl-main)

Copied to clipboard

Challenge: Existing models fail to answer a large portion of sub-questions . Existing systems have achieved super-human performance .
Approach: They propose to use a neural decomposition model to generate sub-questions for a multi-hop question and extract the corresponding sub-answers.
Outcome: The proposed model is based on a hotpotQA dataset with a multi-hop question and sub-answers.
Understanding and Improving Zero-shot Multi-hop Reasoning in Generative Question Answering (2022.coling-1)

Copied to clipboard

Challenge: Generative question answering (QA) models generate answers to complex questions, but their mechanism for doing so is still poorly understood.
Approach: They decompose multi-hop questions into multiple corresponding single-hop question chains and find marked inconsistency in QA models’ answers on these pairs of ostensibly identical question chains.
Outcome: The proposed models lack zero-shot multi-hop reasoning ability when trained on single-hop questions and on logical forms.
BeamAggR: Beam Aggregation Reasoning over Multi-source Knowledge for Multi-hop Question Answering (2024.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated strong reasoning capabilities, but they still suffer from factual errors when tackling knowledge-intensive tasks.
Approach: They propose a reasoning framework for knowledge-intensive multi-hop QA that prioritizes promising answers at each hop of question.
Outcome: The proposed framework outperforms SOTA methods on four open-domain multi-hop reasoning datasets by 8.5%.
BELLE: A Bi-Level Multi-Agent Reasoning Framework for Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Existing studies on multi-hop question answering employ specific methods regardless of question types . complexity of multihop question answerrs often exceeds knowledge boundaries of LLMs .
Approach: They propose a framework that uses chain-of-thought prompting to prompt LLMs to answer multi-hop questions.
Outcome: The proposed framework outperforms baseline models in multi-hop QA scenarios.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations