arXiv:2410.18087cs.IRcs.AI2024-10被引 1

CUPID实现低延迟的一对一社交匹配,提升实时推荐效率。

CUPID: A Real-Time Session-Based Reciprocal Recommendation System for a One-on-One Social Discovery Platform

  • 分离用户行为建模与实时匹配,降低推理耗时。
  • 两阶段训练使序列模型调用次数减少数百倍,响应延迟下降76%以上。
  • 适合高并发、低延迟的社交发现场景,提升用户参与度。

本研究提出CUPID,一种专为实时一对一社交发现平台设计的会话式双向推荐系统。此类平台对低延迟要求极高,但传统会话推荐方法因需在每次推荐中建模用户序列行为,导致延迟过高。此外,由于平台具有双向互荐特性(用户互为推荐目标),常规方法在大规模数据集上训练成本过高。为此,CUPID将耗时的用户会话建模与实时匹配解耦,显著缩短推理时间;同时采用两阶段训练策略,分离嵌入层与预测层训练,使序列模型调用次数减少数百倍,大幅降低计算开销。在大规模Azar数据集上的实验表明,CUPID在真实生产环境中有效,相比非异步系统响应延迟降低超过76%,同时显著提升用户参与度。

原文摘要 · Abstract (English)

This study introduces CUPID, a novel approach to session-based reciprocal recommendation systems designed for a real-time one-on-one social discovery platform. In such platforms, low latency is critical to enhance user experiences. However, conventional session-based approaches struggle with high latency due to the demands of modeling sequential user behavior for each recommendation process. Additionally, given the reciprocal nature of the platform, where users act as items for each other, training recommendation models on large-scale datasets is computationally prohibitive using conventional methods. To address these challenges, CUPID decouples the time-intensive user session modeling from the real-time user matching process to reduce inference time. Furthermore, CUPID employs a two-phase training strategy that separates the training of embedding and prediction layers, significantly reducing the computational burden by decreasing the number of sequential model inferences by several hundredfold. Extensive experiments on large-scale Azar datasets demonstrate CUPID's effectiveness in a real-world production environment. Notably, CUPID reduces response latency by more than 76% compared to non-asynchronous systems, while significantly improving user engagement.

社交推荐实时系统低延迟

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