arXiv:2409.09795cs.IR2024-09被引 1

让模型一次算多个短文本相关性,又快又准。

CROSS-JEM: Accurate and Efficient Cross-encoders for Short-text Ranking Tasks

  • 用共享上下文和重叠词元,批量处理多个短文本。
  • 准确率达顶尖水平,推理速度提升4倍以上。
  • 适合需要快速返回大量结果的搜索推荐场景。

基于查询与项目的相关性对项目进行排序是搜索与推荐的核心问题。基于Transformer的交叉编码器虽为当前最优方法,但对每个查询-项目对独立打分,忽略了其他相关项目的联合上下文信息,导致排名精度不足且计算成本高。为此,我们提出跨编码器联合高效建模(CROSS-JEM),一种新型排序方法,使Transformer模型能够联合评分多个项目,最大化参数利用率。CROSS-JEM利用(a)短文本项目中常见的冗余与词元重叠,实现多项目联合评分;(b)一种新训练目标,建模排名概率分布。实验表明,CROSS-JEM在标准公开数据集及私有数据集上均达到顶尖准确率,相比标准交叉编码器,推理延迟降低超4倍。贡献包括:(i)揭示了实际应用中需对每查询评分数千项目与现有交叉编码器能力之间的差距;(ii)提出CROSS-JEM实现查询下多项目联合高效评分;(iii)验证其在多种数据集上的卓越性能。CROSS-JEM为设计满足严格生产约束(如项目数量、延迟)的早期注意力型排序模型开辟新方向。

原文摘要 · Abstract (English)

Ranking a set of items based on their relevance to a given query is a core problem in search and recommendation. Transformer-based ranking models are the state-of-the-art approaches for such tasks, but they score each query-item independently, ignoring the joint context of other relevant items. This leads to sub-optimal ranking accuracy and high computational costs. In response, we propose Cross-encoders with Joint Efficient Modeling (CROSS-JEM), a novel ranking approach that enables transformer-based models to jointly score multiple items for a query, maximizing parameter utilization. CROSS-JEM leverages (a) redundancies and token overlaps to jointly score multiple items, that are typically short-text phrases arising in search and recommendations, and (b) a novel training objective that models ranking probabilities. CROSS-JEM achieves state-of-the-art accuracy and over 4x lower ranking latency over standard cross-encoders. Our contributions are threefold: (i) we highlight the gap between the ranking application's need for scoring thousands of items per query and the limited capabilities of current cross-encoders; (ii) we introduce CROSS-JEM for joint efficient scoring of multiple items per query; and (iii) we demonstrate state-of-the-art accuracy on standard public datasets and a proprietary dataset. CROSS-JEM opens up new directions for designing tailored early-attention-based ranking models that incorporate strict production constraints such as item multiplicity and latency.

排序交叉编码器效率优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。