The XTR (conteXtual Token Retrieval) algorithm is a modification to ColBERT retrieval that avoids the costly step of fully gathering and reranking the candidates' embeddings by imputing their missing similarity scores from the initial token retrieval step. The original work proposes a modified training objective as necessary for effective XTR retrieval, arguing that standard ColBERT token scoring is unsuitable for imputation. In this paper, we replicate both the XTR retrieval algorithm and its modified training objective, and extend the evaluation to knowledge-distillation (KD) training and efficient retrieval engines (PLAID and WARP). We confirm the token-level matching characteristics claimed in the original work, but fail to replicate XTR's overall effectiveness advantage over ColBERT under a controlled comparison. We further show that XTR's training modification has a concrete mechanistic consequence for modern retrieval engines: by flattening ColBERT's characteristically peaked token score distribution, XTR training yields more discriminative centroid scores and thus more efficient IVF-based retrieval under PLAID and WARP. The utility of XTR training is therefore not limited to the low-$k'$ regime originally studied, but extends to any deployment setting where IVF-based engines are used. These findings offer practitioners concrete guidance on how and when to use XTR as their multi-vector retriever.

翻译：XTR（上下文令牌检索）算法是对ColBERT检索的改进，其通过从初始令牌检索步骤中插补缺失的相似性分数，避免了完全收集和重排候选嵌入的高成本步骤。原作提出需要修改训练目标才能实现有效的XTR检索，并论证标准ColBERT令牌评分不适合用于插补。本文复现了XTR检索算法及其修改后的训练目标，并将评估扩展到知识蒸馏训练与高效检索引擎（PLAID和WARP）。我们证实了原作声称的令牌级匹配特征，但在受控比较下未能复现XTR相对于ColBERT的总体有效性优势。我们进一步表明，XTR的训练修改对现代检索引擎具有具体的机制性后果：通过平化ColBERT特征性的尖峰令牌分数分布，XTR训练能产生更具判别力的质心分数，从而在PLAID和WARP下实现更高效的基于IVF的检索。因此XTR训练的效用不仅限于最初研究的低$k'$场景，还可推广至任何使用基于IVF引擎的部署环境。这些发现为从业者提供了关于如何及何时将XTR用作多向量检索器的具体指导。