mlsanityData to 7 Oct 2026

Noise-Robust Dense Retrieval via Contrastive Alignment Post Training

arXiv 2304.03401 ↗First posted 6 Apr 2023cs.IR cs.AI cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

The success of contextual word representations and advances in neural information retrieval have made dense vector-based retrieval a standard approach for passage and document ranking. While effective and efficient, dual-encoders are brittle to variations in query distributions and noisy queries. Data augmentation can make models more robust but introduces overhead to training set generation and requires retraining and index regeneration. We present Contrastive Alignment POst Training (CAPOT), a highly efficient finetuning method that improves model robustness without requiring index regeneration, the training set optimization, or alteration. CAPOT enables robust retrieval by freezing the document encoder while the query encoder learns to align noisy queries with their unaltered root. We evaluate CAPOT noisy variants of MSMARCO, Natural Questions, and Trivia QA passage retrieval, finding CAPOT has a similar impact as data augmentation with none of its overhead.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 28 of its 45 references that are in the map. First posted on arXiv 6 Apr 2023.

Builds on

28 of 45 references.

References · 28

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  4. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,895
  5. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
  6. 2017Billion-scale similarity search with GPUscited by 2,477
  7. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  8. 2017Random Erasing Data Augmentationcited by 1,235
  9. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  10. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  11. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  12. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
16 more
  1. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
  2. 2021A Survey of Data Augmentation Approaches for NLPcited by 408
  3. 2019PAWS: Paraphrase Adversaries from Word Scramblingcited by 395
  4. 2017OpenNMT: Open-source Toolkit for Neural Machine Translationcited by 251
  5. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  6. 2018Gender Bias in Neural Natural Language Processingcited by 210
  7. 2021Efficient Passage Retrieval with Hashing for Open-domain Question Answeringcited by 53
  8. 2022Tevatron: An Efficient and Flexible Toolkit for Dense Retrievalcited by 47
  9. 2020ORCAS: 18 Million Clicked Query-Document Pairs for Analyzing Searchcited by 34
  10. 2021Evaluating the Robustness of Retrieval Pipelines with Query Variation Generatorscited by 33
  11. 2021Dealing with Typos for BERT-based Passage Retrieval and Rankingcited by 23
  12. 2022Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellingscited by 23
  13. 2022CharacterBERT and Self-Teaching for Improving the Robustness of Dense Retrievers on Queries with Typoscited by 22
  14. 2021Are Neural Ranking Models Robust?cited by 16
  15. 2019Generic Intent Representation in Web Searchcited by 12
  16. 2022On the Impact of Speech Recognition Errors in Passage Retrieval for Spoken Question Answeringcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.

5 papers.