mlsanityData to 7 Oct 2026

Test-Time Training for Zero-Resource Dense Retrieval Reranking

arXiv 2606.01070 ↗First posted 31 May 2026cs.IR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Dense retrievers excel at first-stage candidate generation but lack effective reranking in zero-resource settings. Existing approaches face a fundamental dilemma: cross-encoders deliver strong reranking quality but require costly supervised training and incur high latency, while unsupervised BM25 reranking consistently degrades dense retrieval performance on most of BEIR benchmarks. We propose DART (Dense Adaptive Reranking at Test-time), which resolves this dilemma by adapting the scoring function at inference time. For each query, the top-ranked documents serve as pseudo-positive examples and the bottom-ranked as pseudo-negative examples, providing noisy but readily available supervision to adapt a bilinear scoring matrix W via a small number of gradient updates. We further introduce a confidence-weighted margin loss and a cross-query momentum buffer that warm-starts adaptation across queries. On six BEIR benchmarks, DART achieves a mean per-dataset relative NDCG@10 gain of +2.1% over the dense retrieval baseline with under 10ms additional latency per query, demonstrating a powerful capability for zero-shot performance enhancement and cross-domain generalization.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 31 May 2026.

Builds on

25 of 37 references.

References · 25

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  4. 2017Billion-scale similarity search with GPUscited by 2,477
  5. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  6. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
  7. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
  8. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  9. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  10. 2019Passage Re-ranking with BERTcited by 629
  11. 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 556
  12. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
13 more
  1. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  2. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
  3. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  4. 2021GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrievalcited by 119
  5. 2019A Deep Look into Neural Ranking Models for Information Retrievalcited by 79
  6. 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 68
  7. 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankerscited by 42
  8. 2023UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankerscited by 37
  9. 2021Zero-Shot Dense Retrieval with Momentum Adversarial Domain Invariant Representationscited by 27
  10. 2021Pseudo Relevance Feedback with Deep Language Models and Dense Retrievers: Successes and Pitfallscited by 26
  11. 2025ASRank: Zero-Shot Re-Ranking with Answer Scent for Document Retrievalcited by 9
  12. 2023Augmenting Passage Representations with Query Generation for Enhanced Cross-Lingual Dense Retrievalcited by 5
  13. 2025Pseudo Relevance Feedback is Enough to Close the Gap Between Small and Large Dense Retrieval Modelscited by 4

Built on by

Not cited yet.