融合点式与成对比较,高效提升新闻推荐效果
Efficient Pointwise-Pairwise Learning-to-Rank for News Recommendation
- 结合点式相关性预测与成对比较,兼顾效率与排序性能
- 在MIND和Adressa数据集上超越现有最佳方法
- 理论保证性能提升,适合大规模新闻推荐场景
新闻推荐是一项挑战性任务,需基于用户的历史交互和偏好进行个性化。近期工作利用预训练语言模型(PLMs)直接对新闻条目进行排序,主要采用三类学习排序方法:点式、成对和列表式。虽然点式方法具有线性推理复杂度,但难以捕捉项间关键的相对信息,而这些信息对排序任务更为有效;相反,成对和列表式方法虽能更好融入比较信息,却存在实际限制:成对方法或计算开销大,或缺乏理论保障;列表式方法在实践中表现不佳。本文提出一种新型框架,以可扩展方式整合PLM-based新闻推荐中的点式相关性预测与成对比较,并提供了严格的理论分析,确立了性能提升的条件。大量实验表明,该方法在MIND和Adressa新闻推荐数据集上优于当前最优方法。
原文摘要 · Abstract (English)
News recommendation is a challenging task that involves personalization based on the interaction history and preferences of each user. Recent works have leveraged the power of pretrained language models (PLMs) to directly rank news items by using inference approaches that predominately fall into three categories: pointwise, pairwise, and listwise learning-to-rank. While pointwise methods offer linear inference complexity, they fail to capture crucial comparative information between items that is more effective for ranking tasks. Conversely, pairwise and listwise approaches excel at incorporating these comparisons but suffer from practical limitations: pairwise approaches are either computationally expensive or lack theoretical guarantees, and listwise methods often perform poorly in practice. In this paper, we propose a novel framework for PLM-based news recommendation that integrates both pointwise relevance prediction and pairwise comparisons in a scalable manner. We present a rigorous theoretical analysis of our framework, establishing conditions under which our approach guarantees improved performance. Extensive experiments show that our approach outperforms the state-of-the-art methods on the MIND and Adressa news recommendation datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。