Challenge: Existing approaches to perform large-scale query-passage retrieval are term-based, but they lose interaction between query-pastage pairs.
Approach: They propose to fuse query (passage) information into query representations via graph neural networks that are constructed by queries and their top retrieved passages.
Outcome: The proposed model outperforms existing models on MSMARCO, Natural Questions and TriviaQA datasets and achieves the new state-of-the-art on these datasets.

Similar Papers

Investigating Multi-layer Representations for Dense Passage Retrieval (2025.findings-emnlp)

Copied to clipboard

Challenge: Dense retrieval models adopt vectors from the last hidden layer of the document encoder to represent a document, which is in contrast to the fact that representations in different layers of a pre-trained language model contain different kinds of linguistic knowledge and behave differently during fine-tuning.
Approach: They propose to utilize representations from multiple encoder layers to make up the representation of a document, which they denote Multi-layer Representations (MLR).
Outcome: The proposed model outperforms dual encoder, ME-BERT and ColBERT in the single-vector retrieval setting and with other advanced training techniques.
Sparse, Dense, and Attentional Representations for Text Retrieval (2021.tacl-1)

Copied to clipboard

Challenge: Dual encoders perform retrieval by encoding documents and queries into dense low-dimensional vectors, scoring each document by its inner product with the query.
Approach: They propose a dual-encoder-based neural model that combines the efficiency of dual encoders with expressiveness of more costly attentional architectures.
Outcome: The proposed model outperforms strong alternatives in large-scale retrieval.
PAIR: Leveraging Passage-Centric Similarity Relation for Improving Dense Passage Retrieval (2021.findings-acl)

Copied to clipboard

Challenge: Recent studies only consider query-centric similarity relation when learning the dual-encoder retriever.
Approach: They propose a query-centric and PAssage-centric approach to capture more comprehensive similarity relations for dense passage retrieval.
Outcome: The proposed approach significantly outperforms existing models on both MSMARCO and Natural Questions datasets.
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.
Extremely efficient online query encoding for dense retrieval (2024.findings-naacl)

Copied to clipboard

Challenge: Existing dense retrieval systems use the same model architecture for encoding both passages and queries, even though queries are much shorter and simpler than passages.
Approach: They propose a small efficient RNN query encoder that can reduce latency by 12 with only a minor decrease in quality.
Outcome: The proposed solution reduces latency by up to 12 while achieving 35.5 MRR@10 score.
CAPSTONE: Curriculum Sampling for Dense Retrieval with Document Expansion (2023.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that dense retrieval models are better at obtaining query-informed representations.
Approach: They propose a dual-encoder approach that computes latent representations of query and document independently, but inference replaces the real query with a generated one.
Outcome: The proposed approach outperforms previous dense retrieval models on in-domain and out-of-domain datasets.
Large Dual Encoders Are Generalizable Retrievers (2022.emnlp-main)

Copied to clipboard

Challenge: Experimental results show that dual encoders outperform sparse and dense retrievers on the BEIR dataset significantly.
Approach: They challenge belief that bottleneck layer is too limited for out-of-domain generalization . they scale up the model while keeping bottleneck as a single dot-product with a fixed size .
Outcome: The proposed model outperforms sparse and dense retrievers on the BEIR dataset significantly.
Pseudo-Relevance for Enhancing Document Representation (2022.emnlp-main)

Copied to clipboard

Challenge: a novel approach to document retrieval can be used to encode documents as vectors . a few query-relevant terms can be pruned out to reduce index overhead .
Approach: They propose to enhance the document representation for the bi-encoder approach in dense document retrieval.
Outcome: The proposed solution reduces latency and memory footprint up to 8- and 3-fold . it is validated on MSMARCO and real-world search query logs .
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.
Empowering Dual-Encoder with Query Generator for Cross-Lingual Dense Retrieval (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to distill knowledge from cross-encoder re-ranker to dual-encoding retriever are lacking in the cross-lingual setting.
Approach: They propose to use a query generator as the teacher in the cross-lingual setting to distill knowledge to a dual-encoder retrieval model.
Outcome: The proposed method outperforms state-of-the-art methods on two benchmark 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