IRCLLGJan 13, 2019

Passage Re-ranking with BERT

arXiv:1901.04085v51414 citationsHas Code
AI Analysis

This work improves retrieval accuracy for search and question-answering systems, but it is incremental as it applies an existing method to a specific domain.

The paper tackles passage re-ranking by implementing BERT for query-based tasks, achieving state-of-the-art results on TREC-CAR and MS MARCO with a 27% relative improvement in MRR@10.

Recently, neural models pretrained on a language modeling task, such as ELMo (Peters et al., 2017), OpenAI GPT (Radford et al., 2018), and BERT (Devlin et al., 2018), have achieved impressive results on various natural language processing tasks such as question-answering and natural language inference. In this paper, we describe a simple re-implementation of BERT for query-based passage re-ranking. Our system is the state of the art on the TREC-CAR dataset and the top entry in the leaderboard of the MS MARCO passage retrieval task, outperforming the previous state of the art by 27% (relative) in MRR@10. The code to reproduce our results is available at https://github.com/nyu-dl/dl4marco-bert

Code Implementations6 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes