RRRA: Resampling and Reranking through a Retriever Adapter
Not on the map. Why?
Abstract (arXiv)
In dense retrieval, effective training hinges on selecting high quality hard negatives while avoiding false negatives. Recent methods apply heuristics based on positive document scores to identify hard negatives, improving both performance and interpretability. However, these global, example agnostic strategies often miss instance specific false negatives. To address this, we propose a learnable adapter module that monitors Bi-Encoder representations to estimate the likelihood that a hard negative is actually a false negative. This probability is modeled dynamically and contextually, enabling fine-grained, query specific judgments. The predicted scores are used in two downstream components: (1) resampling, where negatives are reweighted during training, and (2) reranking, where top-k retrieved documents are reordered at inference. Empirical results on standard benchmarks show that our adapter-enhanced framework consistently outperforms strong Bi-Encoder baselines, underscoring the benefit of explicit false negative modeling in dense retrieval.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 35 references that are in the map. First posted on arXiv 7 Aug 2025.
Builds on
24 of 35 references.
References · 24
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,513
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
- 2020Contrastive Learning with Hard Negative Samplescited by 628
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
12 more
- 2020Hard Negative Mixing for Contrastive Learningcited by 402
- 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 214
- 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 176
- 2021Condenser: a Pre-training Architecture for Dense Retrievalcited by 162
- 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 155
- 2022Dense Text Retrieval based on Pretrained Language Models: A Surveycited by 136
- 2017Bilateral Multi-Perspective Matching for Natural Language Sentencescited by 121
- 2021Adversarial Retriever-Ranker for dense text retrievalcited by 83
- 2021PAIR: Leveraging Passage-Centric Similarity Relation for Improving Dense Passage Retrievalcited by 50
- 2022SimANS: Simple Ambiguous Negatives Sampling for Dense Text Retrievalcited by 21
- 2024TriSampler: A Better Negative Sampling Principle for Dense Retrievalcited by 10
- 2022Reduce Catastrophic Forgetting of Dense Retrieval Training with Teleportation Negativescited by 5
Built on by
Not cited yet.