Augmenting Document Representations for Dense Retrieval with Interpolation and Perturbation (2022.acl-short)
Copied to clipboard
| Challenge: | Existing sparse retrieval models rely on term-based matching to retrieve relevant documents. |
| Approach: | They propose a framework which augments the representations of documents with interpolation and perturbation. |
| Outcome: | The proposed framework significantly outperforms baselines on the dense retrieval of both the labeled and unlabeled documents. |
Similar Papers
Improving Document Representations by Generating Pseudo Query Embeddings for Dense Retrieval (2021.acl-long)
Copied to clipboard
| Challenge: | Existing retrieval models based on dense representations show better performance than sparse representations. |
| Approach: | They propose a method to mimic the queries to each of the documents by an iterative clustering process and represent the documents using multiple pseudo queries. |
| Outcome: | The proposed model achieves state-of-the-art results on a large dataset while remaining high efficiency. |
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 . |
A Representation Sharpening Framework for Zero Shot Dense Retrieval (2026.eacl-long)
Copied to clipboard
| Challenge: | Zero-shot dense retrieval requires generic, pretrained DRs, which struggle to represent semantic differences between similar documents. |
| Approach: | They propose a training-free representation sharpening framework that augments a document’s representation with information that helps differentiate it from similar documents in the corpus. |
| Outcome: | The proposed framework is compatible with prior approaches to zero-shot dense retrieval and consistently improves their performance. |
Typo-Robust Representation Learning for Dense Retrieval (2023.acl-short)
Copied to clipboard
Panuthep Tasawong, Wuttikorn Ponwitayarat, Peerat Limkonchotiwat, Can Udomcharoenchaikit, Ekapol Chuangsuwanich, Sarana Nutanong
| Challenge: | Dense retrieval is a fundamental building block of information retrieval applications. |
| Approach: | They propose a method that aligns misspelled queries with their pristine counterparts to improve contrast between each query and its surrounding queries. |
| Outcome: | The proposed method outperforms the competitors in all cases with misspelled queries. |
Improving Embedding-based Large-scale Retrieval via Label Enhancement (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for large-scale retrieval are trained with 0-1 hard labels that indicate whether a query is relevant to a document, ignoring rich information of the relevance degree. |
| Approach: | They propose to introduce label enhancement for the first time to characterize query-document relevance degree by embedding label distribution into contextual embeddables. |
| Outcome: | The proposed method significantly outperforms existing retrieval models and its counterparts equipped with two alternative methods on English and Chinese large-scale retrieval tasks. |
Precise Zero-Shot Dense Retrieval without Relevance Labels (2023.acl-long)
Copied to clipboard
| Challenge: | Existing dense retrieval systems that use semantic embedding similarities can be effective across tasks and languages. |
| Approach: | They propose to pivot through Hypothetical Document Embeddings (HyDE) given a query, HyDE first zero-shot prompts an instruction-following language model to generate a hypothetical document. |
| Outcome: | The proposed method significantly outperforms the state-of-the-art unsupervised dense retriever Contriever and shows strong performance comparable to fine-tuned retrievers across tasks and languages. |
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. |
Multi-View Document Representation Learning for Open-Domain Dense Retrieval (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dense retrieval are hard to match with multiple views. |
| Approach: | They propose a multi-view document representation learning framework to generate multiple embeddings through viewers to represent documents and enforce them to align with different queries. |
| Outcome: | The proposed method outperforms recent works and achieves state-of-the-art results. |
PQR: Improving Dense Retrieval via Potential Query Modeling (2025.acl-long)
Copied to clipboard
| Challenge: | Existing training data is sparse, with each document associated with one or a few labeled queries. |
| Approach: | They propose a training-free potential query retrieval framework to address this problem . they use a Gaussian mixture distribution to model all potential queries for a document . |
| Outcome: | The proposed method is able to capture comprehensive semantic information from a document with multiple queries. |
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. |