Hyperlink-induced Pre-training for Passage Retrieval in Open-domain Question Answering (2022.acl-long)
Copied to clipboard
Jiawei Zhou, Xiaoguang Li, Lifeng Shang, Lan Luo, Ke Zhan, Enrui Hu, Xinyu Zhang, Hao Jiang, Zhao Cao, Fan Yu, Xin Jiang, Qun Liu, Lei Chen
| Challenge: | Existing methods to train dense passage retrieval have a large data gap between upstream and downstream relevance. |
| Approach: | They propose a method to pre-train the dense retriever with the text relevance induced by hyperlinks within Web documents. |
| Outcome: | The proposed method outperforms existing methods under different scenarios and in the open-domain question answering domain. |
Similar Papers
Query-as-context Pre-training for Dense Passage Retrieval (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to improve passage retrieval performance by using context-supervised pre-training are weakly correlated. |
| Approach: | They propose to use query-as-context pre-training to train passage-query pairs . they evaluate the pre-trained models on large-scale passage retrieval benchmarks . |
| Outcome: | The proposed technique improves performance on large-scale passage retrieval benchmarks and out-of-domain zero-shot benchmarks. |
RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering (2021.naacl-main)
Copied to clipboard
Yingqi Qu, Yuchen Ding, Jing Liu, Kai Liu, Ruiyang Ren, Wayne Xin Zhao, Daxiang Dong, Hua Wu, Haifeng Wang
| 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. |
DPTDR: Deep Prompt Tuning for Dense Passage Retrieval (2022.coling-1)
Copied to clipboard
| Challenge: | Recent studies show that prompt tuning is unfriendly for industrial deployment in dense retrieval tasks. |
| Approach: | They propose to apply prompt tuning to dense retrieval tasks to reduce deployment cost . they propose to use retrieval-oriented intermediate pretraining and unified negative mining . |
| Outcome: | The proposed method outperforms state-of-the-art models on MS-MARCO and Natural Questions. |
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. |
Domain-matched Pre-training Tasks for Dense Retrieval (2022.findings-naacl)
Copied to clipboard
Barlas Oguz, Kushal Lakhotia, Anchit Gupta, Patrick Lewis, Vladimir Karpukhin, Aleksandra Piktus, Xilun Chen, Sebastian Riedel, Scott Yih, Sonal Gupta, Yashar Mehdad
| Challenge: | Existing approaches to improve performance of pre-training tasks are needed. |
| Approach: | They propose to pre-train large bi-encoder models on a recently released set of 65 millionsynthetically generated questions and 200 million post-comment pairs from a preexisting reddit conversation dataset. |
| Outcome: | The proposed model can be pre-trained on a set of 65 millionsynthetically generated questions and 200 million post-comment pairs from a preexisting dataset of Reddit conversations. |
Progressively Pretrained Dense Corpus Index for Open-Domain Question Answering (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing open-domain question answering systems are insufficient to capture deep semantic matching that goes beyond lexical overlaps. |
| Approach: | They propose a sample-efficient method to pretrain the paragraph encoder using an existing pretraining model instead of heuristically created pseudo question-paragraph pairs. |
| Outcome: | The proposed method outperforms a strong dense retrieval baseline that uses 6 times more computation for training. |
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 . |
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. |
Relation-Guided Pre-Training for Open-Domain Question Answering (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing QA datasets are imbalanced in some types of relations, which hurts generalization performance over long-tail questions. |
| Approach: | They propose a relation-guided pre-training framework to infer latent relations from a QA dataset . they then propose RGPT-QA to conduct extractive QA to get the target answer entity . |
| Outcome: | The proposed framework improves Exact Match accuracy on natural questions, TriviaQA, and WebQuestions. |
Unsupervised Dense Retrieval with Relevance-Aware Contrastive Pre-Training (2023.findings-acl)
Copied to clipboard
| Challenge: | Dense retrievers have impressive performance, but their demand for abundant training data limits their application scenarios. |
| Approach: | They propose a method which uses unlabeled data to construct pseudo-positive examples from unlabelled data and then contrastively weighs the contrastive loss of different pairs according to the estimated relevance. |
| Outcome: | The proposed method beats the SOTA unsupervised Contriever model on BEIR and open-domain QA retrieval benchmarks and is a good few-shot learner. |