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.

Similar Papers

Multi-Task Retrieval for Knowledge-Intensive Tasks (2021.acl-long)

Copied to clipboard

Challenge: Knowledge-intensive tasks require large amounts of knowledge about the world . recent neural retrieval models achieve better results by learning directly from task-specific training data.
Approach: They propose a multi-task trained neural retrieval model that can be universally trained on a wide variety of problems.
Outcome: The proposed model outperforms specialised retrievers on a few-shot setting and matches or improves state-of-the-art on multiple benchmarks.
Dense Passage Retrieval for Open-Domain Question Answering (2020.emnlp-main)

Copied to clipboard

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.
Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index (P19-1)

Copied to clipboard

Challenge: Existing open-domain question answering models require multiple documents on-demand for every input query.
Approach: They propose query-agnostic indexable representations of document phrases that can drastically speed up open-domain question answering.
Outcome: The proposed model can be trained and deployed even in a single 4-GPU server.
Dense Passage Retrieval: Is it Retrieving? (2024.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) internally store repositories of knowledge, but access to these repositoriels is imprecise.
Approach: They propose a paradigm called retrieval augmented generation to address hallucinations . they analyze the role of fine-tuning pre-trained networks to enhance alignment .
Outcome: The proposed paradigm addresses hallucinations by fine-tuning pre-trained models . the model can be decentralized, inject facts as decentralized representations .
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.
Retrieval-based Question Answering with Passage Expansion Using a Knowledge Graph (2024.lrec-main)

Copied to clipboard

Challenge: Recent advances in dense neural retrievers and language models have hindered performance, especially for less common entities and facts.
Approach: They propose a multi-modal passage retrieval model that combines entity features and textual data to improve retrieval precision for less common entities.
Outcome: The proposed model improves retrieval precision on less common entities and facts on common benchmarks.
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.
RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering (2021.naacl-main)

Copied to clipboard

Challenge: Open-domain question answering uses dense passage retrieval to find answers . however, it is difficult to effectively train a dual-encoder due to discrepancy between training and inference .
Approach: They propose an optimized training approach to improve dense passage retrieval using RocketQA . they propose cross-batch negatives, denoised hard negatives and data augmentation .
Outcome: The proposed approach outperforms state-of-the-art models on both MSMARCO and Natural Questions.
M3: A Multi-Task Mixed-Objective Learning Framework for Open-Domain Multi-Hop Dense Sentence Retrieval (2024.lrec-main)

Copied to clipboard

Challenge: Recent research shows that contrastive learning can lead to suboptimal retrieval performance.
Approach: They propose an advanced recursive Multi-hop dense sentence retrieval system built upon a novel Multi-task Mixed-objective approach for dense text representation learning.
Outcome: The proposed approach yields state-of-the-art performance on a large-scale open-domain fact verification benchmark dataset, FEVER.
Answering Open-Domain Questions of Varying Reasoning Steps from Text (2021.emnlp-main)

Copied to clipboard

Challenge: a new benchmark is developed to answer open-domain questions from text . the system uses a single multi-task transformer model to perform all the necessary subtasks .
Approach: They develop a unified system to answer directly from open-domain questions . they use a single multi-task transformer model to perform all the necessary subtasks .
Outcome: The proposed system can answer open-domain questions on any text collection without prior knowledge of reasoning complexity.

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