Investigating the Successes and Failures of BERT for Passage Re-Ranking
Harshith Padigela, Hamed Zamani, W. Bruce Croft

TL;DR
This paper analyzes why fine-tuned BERT significantly improves passage re-ranking performance, focusing on the MS MARCO dataset, by empirically examining hypotheses and providing insights into its successes and failures.
Contribution
It offers a detailed empirical analysis of BERT's performance in passage re-ranking, identifying factors behind its success and limitations.
Findings
BERT achieves substantial improvements in passage re-ranking.
Certain hypotheses explain BERT's success in retrieval tasks.
Analysis reveals specific failure modes of BERT in re-ranking.
Abstract
The bidirectional encoder representations from transformers (BERT) model has recently advanced the state-of-the-art in passage re-ranking. In this paper, we analyze the results produced by a fine-tuned BERT model to better understand the reasons behind such substantial improvements. To this aim, we focus on the MS MARCO passage re-ranking dataset and provide potential reasons for the successes and failures of BERT for retrieval. In more detail, we empirically study a set of hypotheses and provide additional analysis to explain the successful performance of BERT.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Data Quality and Management
MethodsLinear Layer · Residual Connection · Attention Dropout · Linear Warmup With Linear Decay · Weight Decay · Refunds@Expedia|||How do I get a full refund from Expedia? · Dense Connections · Adam · WordPiece · Softmax
