Challenge: Arras et al., 2017) suggest an unsupervised strategy for the selection of justification sentences for multi-hop question answering (QA) .
Approach: They propose an unsupervised strategy for the selection of justification sentences for multi-hop question answering that maximizes the relevance of the selected sentences, minimizes overlap between selected facts, and maximizes coverage of both question and answer.
Outcome: The proposed strategy improves state-of-the-art supervised QA model on two multi-hop QA datasets: AI2’s Reasoning Challenge (ARC) and Multi-Sentence Reading Comprehension (MultiRC).

Similar Papers

Unsupervised Alignment-based Iterative Evidence Retrieval for Multi-hop Question Answering (2020.acl-main)

Copied to clipboard

Challenge: Evidence retrieval is a critical stage of question answering (QA) . Several multi-hop QA datasets have been proposed recently .
Approach: They propose an unsupervised method that uses only GloVe embeddings to soft-align questions with justification sentences and an iterative process that reformulates queries focusing on terms that are not covered by existing justifications.
Outcome: The proposed method outperforms all previous methods on the evidence selection task on two datasets: MultiRC and QASC.
Hop, Union, Generate: Explainable Multi-hop Reasoning without Rationale Supervision (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods rely on supervision for both answers and rationales, but they have limited capacities in modeling interactions between sentences, let alone reasoning across multiple documents.
Approach: They propose a principled, probabilistic approach for training explainable multi-hop question answering systems without rationale supervision.
Outcome: The proposed method is more accurate at selecting rationales than previous methods while maintaining similar accuracy in predicting answers.
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.
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.
Low-Resource Generation of Multi-hop Reasoning Questions (2020.acl-main)

Copied to clipboard

Challenge: Existing methods to generate valid and fluent questions from text are limited and insufficient for training.
Approach: They propose to generate multi-hop reasoning questions from the raw text in a low resource circumstance by deducing over multiple relations on several sentences in the text.
Outcome: The proposed model can be applied to the task of machine reading comprehension and achieve significant performance improvements.
Generative Context Pair Selection for Multi-hop Question Answering (2021.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that discriminative training results in models that exploit these underlying biases to achieve a better held-out performance, without learning the right way to reason.
Approach: They propose a generative context selection model for multi-hop QA that reasons about how the given question could have been generated given a context pair and not just independent contexts.
Outcome: The proposed model outperforms the state-of-the-art model on hotpotQA while being comparable to the state of the art answering performance on adversarial held-out set.
BRIEF: Bridging Retrieval and Inference for Multi-hop Reasoning via Compression (2025.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to augment language models with external knowledge but they are limited by static nature of pre-training data.
Approach: They propose a lightweight approach that compresses retrieved documents into highly dense textual summaries to integrate into in-context RAG.
Outcome: The proposed approach reduces latency and costs while achieving high performance in open-domain questions.
Avoiding Reasoning Shortcuts: Adversarial Evaluation, Training, and Model Development for Multi-Hop QA (P19-1)

Copied to clipboard

Challenge: In multi-hop question answering, models need to connect multiple pieces of evidence scattered in a long context to answer the question.
Approach: They propose to use a control unit that dynamically attends to the question at different reasoning hops to guide the model's multi-hop reasoning.
Outcome: The proposed model outperforms baseline models but is limited on adversarial test.
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.
Beyond the Answer: Advancing Multi-Hop QA with Fine-Grained Graph Reasoning and Evaluation (2025.acl-long)

Copied to clipboard

Challenge: Existing evaluations of multi-hop question answering systems focus on comparing final answers of reasoning method and given ground-truths.
Approach: They propose a "Planner-Executor-Reasoner" architecture that evaluates reasoning . they propose PER-DP and PER QA architectures that provide ground-truths .
Outcome: The proposed model improves the performance of multi-hop question answering systems.

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