用生成式方法更全面建模用户长期兴趣,提升点击率预测效果。
Generative Long-term User Interest Modeling for Click-Through Rate Prediction

- 通过生成多个兴趣分布捕捉用户多方面实时兴趣,不依赖目标物品
- 行为检索只需常数时间查找,效率显著提升
- 适合大规模推荐系统,兼顾精度与响应速度
基于海量历史用户行为建模长期用户兴趣,可显著提升广告和推荐系统的点击率(CTR)预测性能。现有方法通常采用两阶段框架:通用搜索单元(GSU)先检索与目标物品最相关的前-k条行为,精确搜索单元(ESU)再通过定制注意力生成兴趣特征。然而,当前以目标为中心的GSU会忽略其他潜在用户兴趣,导致兴趣特征不完整且有偏差。此外,GSU中基于匹配的检索过程依赖目标物品与每条历史行为间的相似度得分,不仅随用户行为增长而变得耗时,还忽略了行为之间的交互信息。为此,我们提出生成式长期用户兴趣模型GenLI。GenLI包含兴趣生成模块(IGM)、行为检索模块(BRM)和兴趣融合模块(IFM)。IGM生成多个兴趣分布,体现用户实时兴趣的不同方面,具有目标无关性并融合行为间交互信息,确保兴趣特征的完整性和多样性;BRM通过简单查表操作选择相关行为,将加权时间复杂度降至O(1);IFM利用精细门控机制生成最终兴趣特征。得益于生成式流程,GenLI提升了用户兴趣多样性,避免了复杂的匹配检索,实现了CTR预测在准确率与效率之间的更好平衡。
原文摘要 · Abstract (English)
Modeling long-term user interests with massive historical user behaviors enhances click-through rate (CTR) prediction performance in advertising and recommendation systems. Typically, a two-stage framework is widely adopted, where a general search unit (GSU) first retrieves top-$k$ relevant behaviors towards the target item, and an exact search unit (ESU) generates interest features via tailored attention. However, current target-centered GSU would ignore other latent user interests, leading to incomplete and biased interest features. Additionally, the matching-based retrieval process in GSUs depends on the pairwise similarity score between target item and each historical behavior, which not only becomes time-consuming for online services as user behaviors continue to grow, but also overlooks the interaction information among user behaviors. To combat these problems, we propose a \textbf{Gen}erative \textbf{L}ong-term user \textbf{I}nterest model named GenLI for CTR prediction. GenLI consists of an interest generation module (IGM), a behavior retrieval module (BRM), and an interest fusion module (IFM). The IGM generates multiple interest distributions to indicate different aspects of real-time user interests, which is target-independent and incorporates interaction information among behaviors, ensuring complete and diverse interest features. The BRM selects related behaviors via a simple lookup operation, reducing the time complexity for weighting each behavior to $O(1)$. Finally, the IFM uses delicate gating mechanisms to generate interest features. Based on the generation process, GenLI improves the diversity of user interests and avoids complex matching-based behavioral retrieval, achieving a better balance between accuracy and efficiency for CTR prediction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。