SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval (2021.naacl-main)
Copied to clipboard
| Challenge: | SPARTA is a novel neural retrieval method for open-domain question answering . it learns a sparse representation that can be efficiently implemented as an Inverted Index . |
| Approach: | They propose a method that learns a sparse representation that can be implemented as an Inverted Index. |
| Outcome: | The proposed method achieves state-of-the-art results on 4 open-domain question answering tasks and 11 retrieval question answering (ReQA) tasks. |
Similar Papers
Dense Passage Retrieval for Open-Domain Question Answering (2020.emnlp-main)
Copied to clipboard
Vladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, Wen-tau Yih
| Challenge: | Open-domain question answering relies on efficient passage retrieval to select candidate contexts. |
| Approach: | They propose a dual-encoder framework that can be implemented to retrieve passages from a small number of questions and passages. |
| Outcome: | The proposed system outperforms a strong Lucene-BM25 system in top-20 passage retrieval accuracy on multiple open-domain QA benchmarks. |
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. |
UnitedQA: A Hybrid Approach for Open Domain Question Answering (2021.acl-long)
Copied to clipboard
| Challenge: | Recent work on open-domain question answering focuses on either extractive or generative readers exclusively. |
| Approach: | They propose a hybrid approach to extractive and generative readers that leverages both models. |
| Outcome: | The proposed approach outperforms state-of-the-art models on NaturalQuestions and TriviaQA respectively. |
End-to-End Training of Neural Retrievers for Open-Domain Question Answering (2021.acl-long)
Copied to clipboard
Devendra Sachan, Mostofa Patwary, Mohammad Shoeybi, Neel Kant, Wei Ping, William L. Hamilton, Bryan Catanzaro
| 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. |
Efficient Passage Retrieval with Hashing for Open-domain Question Answering (2021.acl-short)
Copied to clipboard
| Challenge: | Open-domain question answering systems often require large memory to run because of the massive size of their passage index. |
| Approach: | They propose a memory-efficient neural retrieval model that integrates a learning-to-hash technique into the state-of-the-art Dense Passage Retriever to represent the passage index using compact binary codes. |
| Outcome: | The proposed model significantly reduces memory cost from 65GB to 2GB without loss of accuracy on two open-domain question answering benchmarks. |
Improving Retrieval Augmented Open-Domain Question-Answering with Vectorized Contexts (2024.findings-acl)
Copied to clipboard
| Challenge: | Retrieval Augmented Generation can be used to process long contexts in Open-Domain Question-Answering tasks. |
| Approach: | They propose a method to cover longer contexts in Open-Domain Question-Answering tasks by using a small encoder language model and cross-attention with origin inputs. |
| Outcome: | The proposed method can cover longer contexts while keeping the computing requirements close to the baseline. |
Generation-Augmented Retrieval for Open-Domain Question Answering (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to answer open-domain questions use sparse representations and sparsity. |
| Approach: | They propose a method which augments a query by generating relevant contexts from heuristically discovered contexts without external supervision. |
| Outcome: | The proposed approach outperforms state-of-the-art dense retrieval methods on natural questions and triviaQA datasets. |
Relevance-guided Supervision for OpenQA with ColBERT (2021.tacl-1)
Copied to clipboard
| Challenge: | Recent work has focused on learning to retrieve passages for open-domain question answering . if notions of relevance are not tailored to questions, the MRC model will not reliably see the best passages . |
| Approach: | They propose a retrieval model that uses coarse-grained vector representations of questions and passages to adapt it to OpenQA. |
| Outcome: | The proposed system improves OpenQA retrieval on Natural Questions, SQuAD, and TriviaQA. |
Task-Aware Specialization for Efficient and Robust Dense Retrieval for Open-Domain Question Answering (2023.acl-short)
Copied to clipboard
| Challenge: | Existing dense retrieval models are parameter-inefficient and underperform sparse counterparts. |
| Approach: | They propose a task-aware specialization for dEnse Retrieval architecture that enables parameter sharing by interleaving shared and specialized blocks in a single encoder. |
| Outcome: | The proposed architecture surpasses BM25 on questions and passages using 60% of the parameters as bi-encoder dense retrievers. |
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. |