Challenge: Open-domain question answering uses evidence retrieved from large corpus to answer questions . state-of-the-art approaches require intermediate evidence annotations for training . however, such intermediate annotations are expensive and methods that rely on them cannot transfer to the more common setting .
Approach: They propose an open-domain question answering approach that alternately finds evidence from an up-to-date model and encourages the model to learn the most likely evidence.
Outcome: The proposed approach improves over weak retrievers on multi-hop and single-hop benchmarks without using evidence labels.

Similar Papers

Latent Retrieval for Weakly Supervised Open Domain Question Answering (P19-1)

Copied to clipboard

Challenge: Recent work on open domain question answering (QA) assumes strong supervision of the supporting evidence and/or assumes a blackbox information retrieval (IR) system to retrieve evidence candidates.
Approach: They propose to jointly learn the retriever and reader from question-answer string pairs and without any IR system.
Outcome: The proposed approach outperforms BM25 on open datasets with a learner and reader by 19 points in exact match.
Open Domain Question Answering over Tables via Dense Retrieval (2021.naacl-main)

Copied to clipboard

Challenge: Recent advances in open-domain QA focus on retrieving textual passages . a retriever designed to handle tabular context can improve retrieval quality .
Approach: They propose a tabular-based retrieval model that improves retrieval quality over a BERT-based retriever.
Outcome: The proposed retriever improves retrieval quality with mined hard negatives over a BERT-based retriever.
Neural Ranking with Weak Supervision for Open-Domain Question Answering : A Survey (2023.findings-eacl)

Copied to clipboard

Challenge: Neural ranking models require substantial amounts of relevance annotations, which is costly to scale.
Approach: They propose to train a NR model with weak supervision instead of annotations . they use a structured overview of standard WS signals used for training a model .
Outcome: The proposed approach reduces the cost of annotations by using weak supervision instead of a parametric model.
End-to-End Training of Neural Retrievers for Open-Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Recent work on training neural retrievers for open-domain question answering (OpenQA) has employed both supervised and unsupervised methods.
Approach: They propose an approach of unsupervised pre-training with the Inverse Cloze Task and masked salient spans followed by supervised finetuning using question-context pairs.
Outcome: The proposed approach outperforms models like REALM and RAG in retrieval accuracy and answer extraction.
Questions Are All You Need to Train a Dense Passage Retriever (2023.tacl-1)

Copied to clipboard

Challenge: Existing methods for dense retrieval require large supervised datasets with custom hard-negative mining and denoising of positive examples.
Approach: They propose a new corpus-level autoencoding approach for training dense retrieval models that does not require labeled training data.
Outcome: The proposed method matches or surpasses strong supervised performance levels on multiple QA benchmarks with no labeled training data or task-specific losses.
C-MORE: Pretraining to Answer Open-Domain Questions by Consulting Millions of References (2022.acl-short)

Copied to clipboard

Challenge: Existing approaches to pretrain open-domain question answering systems lack task-specific annotations.
Approach: They propose to pretrain a two-stage open-domain question answering system with strong transfer capabilities by using a dictionary and a large-scale corpus.
Outcome: The proposed approach leads to 2%-10% gains in top-20 accuracy and improves with reader.
You Only Need One Model for Open-domain Question Answering (2022.emnlp-main)

Copied to clipboard

Challenge: Recent approaches to Open-domain Question Answering use external knowledge bases, but have separate parameters and are weakly-coupled during training.
Approach: They propose to use a single question answering model trained end-to-end to retrieve external knowledge and rerank passages with a separate reranked model.
Outcome: The proposed model outperforms the previous state-of-the-art model by 1.0 and 0.7 exact match scores on the Natural Questions and TriviaQA open datasets.
Evidentiality-aware Retrieval for Overcoming Abstractiveness in Open-Domain Question Answering (2024.findings-eacl)

Copied to clipboard

Challenge: Existing approaches to ODQA use a simple yet effective retriever-reader framework, but this approach is not always effective in abstractive tasks.
Approach: They propose a method that leverages synthetic distractor samples to learn to discriminate evidence passages from distractors.
Outcome: The proposed method is validated on multiple abstractive open-domain question answering tasks.
Multi-Task Dense Retrieval via Model Uncertainty Fusion for Open-Domain Question Answering (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to multitask dense retrieval are not effective due to corpus inconsistency.
Approach: They propose to train individual dense passage retrievers for different open-domain question-answering tasks and aggregate their predictions during test time.
Outcome: The proposed method achieves state-of-the-art performance on 5 benchmark QA datasets, with up to 10% improvement in top-100 accuracy compared to a joint-training multi-task DPR on SQuAD.
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text (D19-1)

Copied to clipboard

Challenge: Experimentally PullNet improves over the prior state-of-the-art open domain question answering systems.
Approach: They propose a framework for learning what to retrieve and reasoning with heterogeneous information to find the best answer.
Outcome: The proposed framework improves over the prior state-of-the-art in open domain question answering . it is weakly supervised, requiring question-answer pairs but not gold inference paths .

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