PairDistill: Pairwise Relevance Distillation for Dense Retrieval (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in dense retrieval have demonstrated remarkable efficacy compared to traditional sparse retrieval methods. |
| Approach: | They propose to use pairwise relevance distillation to leverage pairwise reranking to enrich the training of dense retrieval models. |
| Outcome: | The proposed method outperforms existing methods and achieves state-of-the-art results on multiple benchmarks. |
Similar Papers
PAIR: Leveraging Passage-Centric Similarity Relation for Improving Dense Passage Retrieval (2021.findings-acl)
Copied to clipboard
Ruiyang Ren, Shangwen Lv, Yingqi Qu, Jing Liu, Wayne Xin Zhao, QiaoQiao She, Hua Wu, Haifeng Wang, Ji-Rong Wen
| 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. |
DiPair: Fast and Accurate Distillation for Trillion-Scale Text Matching and Pair Modeling (2020.findings-emnlp)
Copied to clipboard
Jiecao Chen, Liu Yang, Karthik Raman, Michael Bendersky, Jung-Jung Yeh, Yun Zhou, Marc Najork, Danyang Cai, Ehsan Emadzadeh
| Challenge: | Existing knowledge distillation models are not optimized for dealing with pairs (or tuples) of texts. |
| Approach: | They propose a framework for distilling fast and accurate models on text pair tasks using a scalable end-to-end training strategy. |
| Outcome: | Empirical studies on academic and real-world e-commerce benchmarks show the proposed framework can achieve speedups of over 350x and minimal quality drop relative to the cross-attention teacher BERT model. |
GRITHopper: Decomposition-Free Multi-Hop Dense Retrieval (2026.eacl-long)
Copied to clipboard
| Challenge: | Decomposition-based multi-hop retrieval methods rely on autoregressive steps to break down complex queries, which breaks end-to-end differentiability and is computationally expensive. |
| Approach: | They propose a multi-hop dense retrieval model that integrates causal language modeling with dense retrievals. |
| Outcome: | The proposed model outperforms existing methods on in-distribution and out-of-difference benchmarks. |
Distillation Enhanced Generative Retrieval (2024.findings-acl)
Copied to clipboard
| Challenge: | Generative retrieval is a promising new paradigm in text retrieval that generates identifier strings of relevant passages as the retrieval target. |
| Approach: | They propose a framework that leverages generative language models to enhance generative retrieval by distillation. |
| Outcome: | The proposed framework achieves state-of-the-art performance among the generative retrieval methods. |
Collective Relevance Labeling for Passage Retrieval (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to improve IR labels are incomplete and require computational overheads. |
| Approach: | They propose to distill knowledge for informed labeling without high computation overheads at evaluation time. |
| Outcome: | The proposed model outperforms state-of-the-art models while distilling the rankings better. |
EasyDistill: A Comprehensive Toolkit for Effective Knowledge Distillation of Large Language Models (2025.emnlp-demos)
Copied to clipboard
| Challenge: | In this paper, we present EasyDistill, a comprehensive toolkit designed for effective black-box and white-box knowledge distillation (KD) of large language models. |
| Approach: | They propose a toolkit for effective black-box and white-box knowledge distillation (KD) of large language models (LLMs). |
| Outcome: | The framework offers data synthesis, supervised fine-tuning, ranking optimization, and reinforcement learning techniques specifically tailored for KD scenarios. |
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. |
RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show that passage retrieval and passage reranking are important for achieving mutual improvement. |
| Approach: | They propose a unified listwise training approach for passage retrieval and passage reranking that incorporates a retrieval procedure and a hybrid data augmentation strategy. |
| Outcome: | The proposed approach improves on both MSMARCO and Natural Questions datasets. |
Enhancing the Ranking Context of Dense Retrieval through Reciprocal Nearest Neighbors (2023.emnlp-main)
Copied to clipboard
| Challenge: | Sparse annotation poses persistent challenges to training dense retrieval models . despite potential future endeavors to extend annotation, issue of false negatives persists . |
| Approach: | They propose a method that smooths out the annotation of unlabeled relevant documents . they use reciprocal nearest neighbors to estimate relevance and rerank candidates . |
| Outcome: | The proposed method reduces the issue of false negatives in contrastive learning by reducing sparsity. |
Query Distillation: BERT-based Distillation for Ensemble Ranking (2020.coling-industry)
Copied to clipboard
| Challenge: | Recent years have witnessed substantial progress in the development of neural ranking networks, but an increasingly heavy computational burden due to growing numbers of parameters and the adoption of model ensembles. |
| Approach: | They propose a two-stage distillation method that allows a smaller student model to be trained while benefiting from the better performance of the teacher model. |
| Outcome: | The proposed method shows higher-quality rankings compared to the teacher model. |