IRCLMar 31

FGR-ColBERT: Identifying Fine-Grained Relevance Tokens During Retrieval

arXiv:2604.0024216.2
AI Analysis

This addresses the need for efficient fine-grained evidence in retrieval for users, though it is incremental as it modifies an existing model.

The paper tackles the problem of identifying fine-grained relevant tokens in document retrieval without computational overhead, proposing FGR-ColBERT which achieves a token-level F1 of 64.5, outperforming a much larger model while maintaining retrieval efficiency.

Document retrieval identifies relevant documents but does not provide fine-grained evidence cues, such as specific relevant spans. A possible solution is to apply an LLM after retrieval; however, this introduces significant computational overhead and limits practical deployment. We propose FGR-ColBERT, a modification of ColBERT retrieval model that integrates fine-grained relevance signals distilled from an LLM directly into the retrieval function. Experiments on MS MARCO show that FGR-ColBERT (110M) achieves a token-level F1 of 64.5, exceeding the 62.8 of Gemma 2 (27B), despite being approximately 245 times smaller. At the same time, it preserves retrieval effectiveness (99% relative Recall@50) and remains efficient, incurring only a ~1.12x latency overhead compared to the original ColBERT.

Foundations

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

Your Notes