Noise-Robust Dense Retrieval via Contrastive Alignment Post Training

Daniel Campos, ChengXiang Zhai, Alessandro Magnani
4/6/2023
cs.IRcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{campos2023noiserobust,
  title  = {Noise-Robust Dense Retrieval via Contrastive Alignment Post Training},
  author = {Daniel Campos and ChengXiang Zhai and Alessandro Magnani},
  year   = {2023},
  eprint = {2304.03401},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.03401v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.03401.svg)](https://codeofpaper.com/paper/2304.03401)

Discussion