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.

Similar Papers

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.
Unsupervised Multi-hop Question Answering by Question Generation (2021.naacl-main)

Copied to clipboard

Challenge: Existing training data for multi-hop question answering (QA) is time-consuming and resource-intensive.
Approach: They propose an unsupervised framework that generates human-like multi-hop training data from homogeneous and heterogeneously data sources.
Outcome: The proposed framework achieves 61% and 83% of the supervised learning performance for the HybridQA and HotpotQA datasets.
Few-Shot Data Synthesis for Open Domain Multi-Hop Question Answering (2024.eacl-long)

Copied to clipboard

Challenge: Recent approaches to multi-hop question answering rely on in-context learning . however, these models contain billions of parameters making them inefficient at inference time.
Approach: They propose a framework that allows for improving smaller language models with less than 10 human-annotated QA pairs by synthesizing millions of multi-hop questions and claims to fine tune language models.
Outcome: The proposed framework improves model performance on multi-hop question answering and fact verification benchmarks while being almost one-third the size in parameter count.
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.
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.
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)

Copied to clipboard

Challenge: Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages .
Approach: They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears.
Outcome: The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears.
Robustifying Multi-hop QA through Pseudo-Evidentiality Training (2021.acl-long)

Copied to clipboard

Challenge: Existing approaches to robustify multi-hop question answering models require expensive annotations.
Approach: They propose a method to supervise answers with right reasoning chains without annotations . they compare answers confidence with and without evidence sentences to generate "pseudo-evidentiality" annotations.
Outcome: The proposed model is accurate and robust in multi-hop reasoning.
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.
Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps (2020.coling-main)

Copied to clipboard

Challenge: Existing multi-hop question answering datasets do not provide a complete explanation for the reasoning process from the question to the answer.
Approach: They propose a multi-hop question answering dataset that uses structured and unstructured data to test reasoning skills.
Outcome: The proposed dataset ensures multi-hop reasoning while being challenging for multi-models.
Reinforced Multi-task Approach for Multi-hop Question Generation (2020.coling-main)

Copied to clipboard

Challenge: Empirical evaluation shows our model to outperform the single-hop question generation models on both automatic evaluation metrics such as BLEU, METEOR, and ROUGE and human evaluation metrics for quality and coverage of the generated questions.
Approach: They propose a question-aware reward function to maximize the utilization of supporting facts in the context.
Outcome: The proposed model outperforms single-hop neural question generation models on automatic evaluation metrics and human evaluation metrics for quality and coverage of the generated questions.

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