Challenge: Open-domain Question Answering (ODQA) systems rely on spurious features instead of genuine causal relationships to generate answers.
Approach: They propose a model that leverages the encoders of FiD to distinguish between causal relationships and spurious features and guides the decoder to generate answers informed by this discernment.
Outcome: The proposed model improves on two ODQA datasets and shows that it can identify causal relationships and identify spurious features.

Similar Papers

FiE: Building a Global Probability Space by Leveraging Early Fusion in Encoder for Open-Domain Question Answering (2022.emnlp-main)

Copied to clipboard

Challenge: generative models tend to be larger than extractive models due to the need for a decoder, run slower during inference due to auto-regressive decoded beam search, and their generated output suffers from hallucinations.
Approach: They propose to extend transformer encoders with the ability to fuse information from multiple passages to provide cross-sample attention over all tokens across samples.
Outcome: The proposed method outperforms the current state-of-the-art method by 2.5 Exact Match score on the Natural Question dataset while using only 25% of parameters and 35% of the latency during inference.
Multi-Granularity Guided Fusion-in-Decoder (2024.findings-naacl)

Copied to clipboard

Challenge: Open-domain question answering requires deriving factual responses without explicit evidence . recent approaches combine retrieval of relevant information with response generation .
Approach: They propose a model that concatenates multiple contexts in the decoding phase . they propose MGFiD, which harmonizes passage re-ranking with sentence classification .
Outcome: The proposed model outperforms existing models on Natural Questions and TriviaQA datasets . it aggregates evident sentences into an anchor vector that instructs the decoder .
KG-FiD: Infusing Knowledge Graph in Fusion-in-Decoder for Open-Domain Question Answering (2022.acl-long)

Copied to clipboard

Challenge: Open-Domain Question Answering (ODQA) models typically include a retrieving module and a reading module.
Approach: They propose a new open-domain question-answering framework that uses a knowledge-enhanced version of FiD to improve the approach.
Outcome: The proposed model improves on ODQA benchmark datasets with less than 40% computation cost.
Optimizing Retrieval-augmented Reader Models via Token Elimination (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for ODQA use a retrieval-augmented language model . a generative model can cause a significant bottleneck in decoding time .
Approach: They propose to eliminate some of the retrieved information that might not contribute essential information to the answer generation process.
Outcome: The proposed method reduces run-time by up to 62.2% with only 2% reduction in performance and improves performance.
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.
Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering (2021.eacl-main)

Copied to clipboard

Challenge: Existing approaches to extracting answer from text are expensive to train and train.
Approach: They investigate how much models benefit from retrieving text passages . they obtain state-of-the-art results on the Natural Questions and TriviaQA open benchmarks ."
Outcome: The proposed model performs better when retrieving more passages than previously thought .
Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering (2021.acl-long)

Copied to clipboard

Challenge: Existing generative models for open-domain question answering focus on generating direct answers from unstructured textual information, but a large amount of knowledge is stored in structured databases, and need to be accessed using query languages such as SQL.
Approach: They propose a hybrid framework that takes both textual and tabular evidences as input and generates either direct answers or SQL queries depending on which form could better answer the question.
Outcome: The proposed framework outperforms baseline models on OpenSQuAD datasets and can generate SQL queries on the associated databases to obtain the final answers.
LI-RAGE: Late Interaction Retrieval Augmented Generation with Explicit Signals for Open-Domain Table Question Answering (2023.acl-short)

Copied to clipboard

Challenge: Recent open-domain TableQA pipelines use a combination of retriever and reader . a table can be very large and might contain heterogeneous information across rows/columns .
Approach: They propose to combine a retriever-reader pipeline with a binary relevance token to train the retriever and reader.
Outcome: The proposed approaches improve on two open-domain TableQA datasets.
A Copy-Augmented Generative Model for Open-Domain Question Answering (2022.acl-short)

Copied to clipboard

Challenge: Existing open-domain question answering approaches follow a two-stage paradigm retriever then reader.
Approach: They propose a novel reader-based generative approach that incorporates extractive and generative readers.
Outcome: The proposed model improves on two benchmark datasets, Natural Questions and TriviaQA.
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.

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