The key to personalized news recommendation is to match the user's interests with the candidate news precisely and efficiently. Most existing approaches embed user interests into a representation vector then recommend by comparing it with the candidate news vector. In such a workflow, fine-grained matching signals may be lost. Recent studies try to cover that by modeling fine-grained interactions between the candidate news and each browsed news article of the user. Despite the effectiveness improvement, these models suffer from much higher computation costs online. Consequently, it remains a tough issue to take advantage of effective interactions in an efficient way. To address this problem, we proposed an end-to-end Selective Fine-grained Interaction framework (SFI) with a learning-to-select mechanism. Instead of feeding all historical news into interaction, SFI can quickly select informative historical news w.r.t. the candidate and exclude others from following computations. We empower the selection to be both sparse and automatic, which guarantees efficiency and effectiveness respectively. Extensive experiments on the publicly available dataset MIND validates the superiority of SFI over the state-of-the-art methods: with only five historical news selected, it can significantly improve the AUC by 2.17% over the state-of-the-art interaction-based models; at the same time, it is four times faster.
翻译:个人化新闻建议的关键是使用户的兴趣与候选新闻准确而高效地匹配。 大多数现有方法将用户利益嵌入代表矢量,然后通过将用户利益与候选新闻矢量进行比较提出建议。 在这样的工作流程中,细微的匹配信号可能会丢失。 最近的研究试图通过模拟候选人新闻与浏览的用户每篇文章之间的细微互动来覆盖这一点。尽管效果有所改善,但这些模型在网上的计算成本上却要高得多。因此,要高效率地利用有效的互动,这仍然是一个棘手的问题。为了解决这一问题,我们建议了一个端到端的精选精选互动框架(SFI),并有一个学习选择机制。在这种工作流程中,将所有历史新闻输入到互动中,SFI可以快速选择信息性的历史新闻 w.r.t. 候选人,并将其他人排除在计算之外。我们授权这些选择既少又自动,这分别保证效率和效益。在公开的数据集上进行广泛的实验,以验证SFI优于状态。 为了解决这个问题,我们提议了一个端到端的精选精选的节互动框架(SFI) 框架(SFI) 与一个学习到选择的功能机制。只有5个历史节比速度更快的版本。