Ranking and Sampling in Open-Domain Question Answering (D19-1)

Copied to clipboard

Challenge: Existing approaches focus on positive paragraphs which contain the answer during training, making it disturbed by similar but irrelevant paragraphs during testing.
Approach: They propose a ranking model leveraging the paragraph-question and the paragraph relevance to compute a confidence score for each paragraph.
Outcome: Experiments on three datasets show that the proposed model advances the state of the art.

Similar Papers

Ranking Paragraphs for Improving Answer Recall in Open-Domain Question Answering (D18-1)

Copied to clipboard

Challenge: Recent work has combined open-domain question answering with machine comprehension models to find answers in a large knowledge source.
Approach: They propose a machine comprehension model that ranks paragraphs of retrieved documents for a higher answer recall with less noise.
Outcome: The proposed model improves on four open-domain QA datasets by 7.8% on average.
Retrieving Support to Rank Answers in Open-Domain Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: a novel question answering architecture retrieves content relevant to the combined pair . previous work on automatic claim verification has shown hallucinations .
Approach: They propose a question-answer architecture that prioritizes supporting evidence . it retrieves paragraphs that directly substantiate the correctness of a with respect to q .
Outcome: The proposed approach can be used by large language models to retrieve explanatory paragraphs that ground their reasoning.
RobustQA: Benchmarking the Robustness of Domain Adaptation for Open-Domain Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Existing ODQA datasets consist mainly of Wikipedia corpus, and are insufficient to study models’ generalizability across diverse domains.
Approach: They propose a benchmark to evaluate ODQA's domain robustness using Wikipedia corpus . they annotate QA pairs in retrieval datasets with rigorous quality control .
Outcome: The proposed benchmark improves model performance on annotated QA pairs in retrieval datasets with rigorous quality control.
Training a Ranking Function for Open-Domain Question Answering (N18-4)

Copied to clipboard

Challenge: Recent advances in machine reading have inspired researchers to combine Information Retrieval with machine reading to tackle open-domain QA.
Approach: They propose two neural network rankers that assign scores to different passages based on their likelihood of containing the answer to a given question.
Outcome: The proposed models achieve human level performance in open-domain QA compared to reading comprehension-style QA because it is difficult to retrieve the pieces of paragraphs that contain the answer to the question.
Denoising Distantly Supervised Open-Domain Question Answering (P18-1)

Copied to clipboard

Challenge: Existing DS-QA models ignore rich information contained in other paragraphs and are noisy . Existing systems rely on pre-identified relevant texts, which do not always exist in real-world QA scenarios.
Approach: They propose a model which uses a paragraph selector to filter out noisy paragraphs and a reader to extract the correct answer from denoised paragraphs.
Outcome: The proposed model can capture useful information from noisy data and achieve significant improvements on open domain question answering.
A Survey for Efficient Open Domain Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Open domain question answering (ODQA) is a longstanding task that can answer factoid questions without explicit evidence in natural language processing (NLP).
Approach: They propose to use open domain question answering to answer factual questions from a large knowledge corpus without explicit evidence.
Outcome: The proposed models can answer factoid questions from a large knowledge corpus without explicit evidence.
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.
Open-Domain Question Answering (2020.acl-tutorials)

Copied to clipboard

Challenge: tutorial provides a comprehensive overview of cutting-edge research in open-domain question answering (QA)
Approach: tutorial provides a comprehensive overview of cutting-edge research in open-domain question answering . focus will shift to cutting- edge models proposed for open- domain QA .
Outcome: The tutorial will cover cutting-edge research in open-domain question answering (QA) it will cover two-stage retriever-reader approaches, dense retriever and end-to-end training, and retriever free methods .
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.
Denoising Table-Text Retrieval for Open-Domain Question Answering (2024.lrec-main)

Copied to clipboard

Challenge: Existing studies in table-text open-domain question answering have problems with false-positive labels in training datasets.
Approach: They propose a denoised table-text retriever that discards false positives from training datasets . they integrate table-level ranking information into the retriever to assist in finding evidence .
Outcome: The proposed method outperforms baselines on retrieval recall and QA tasks.

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