The reviewed record of science sign in
Pith

arxiv: 2502.17036 · v2 · pith:3O45VO5O · submitted 2025-02-24 · cs.CL · cs.AI

Language Model Re-rankers are Fooled by Lexical Similarities

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3O45VO5Orecord.jsonopen to challenge →

classification cs.CL cs.AI
keywords re-rankersbm25lexicalmethodsdatasetsdifferentdruidlanguage
0
0 comments X
read the original abstract

Language model (LM) re-rankers are used to refine retrieval results for retrieval-augmented generation (RAG). They are more expensive than lexical matching methods like BM25 but assumed to better process semantic information and the relations between the query and the retrieved answers. To understand whether LM re-rankers always live up to this assumption, we evaluate 6 different LM re-rankers on the NQ, LitQA2 and DRUID datasets. Our results show that LM re-rankers struggle to outperform a simple BM25 baseline on DRUID. Leveraging a novel separation metric based on BM25 scores, we explain and identify re-ranker errors stemming from lexical dissimilarities. We also investigate different methods to improve LM re-ranker performance and find these methods mainly useful for NQ. Taken together, our work identifies and explains weaknesses of LM re-rankers and points to the need for more adversarial and realistic datasets for their evaluation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.