PAIR:面向 LinkedIn 高端人脉推荐的偏好对齐意图检索
PAIR: Preference-Aligned Intent Retrieval for Premium People Recommendation at LinkedIn
Zhongkai Shangguan · Yanbin Kang · Yihan Cao · Ruijie Jiang · Qiannan Yin · Chang Yue · et al.
中文摘要
基于档案相似度训练的通用嵌入常会错误排序职业网络候选人,因为其中的相关性本质上具有互补性而非对称性。例如,求职者通常会与招聘者互动,而不是与资历相近的同行。当前用户推荐系统多依赖档案相似度或共同联系人等社交信号,这些方法适用于以相似用户或既有社交圈为中心的社交网络,却难以应对 LinkedIn 等以目标为导向、强调跨角色互动的职业平台,后者需要依据互补意图,而非相似度或社交距离进行匹配。PAIR 是一种对用户意图偏好而非档案相似度建模的检索框架,借鉴 Direct Preference Optimization 的偏好学习思路,将偏好学习设为嵌入上的曝光条件多负样本对比目标。该形式无需显式参考模型,能够简化训练并高效扩展至大规模候选集。系统还聚合点击历史并进行位置编码,以捕捉时间顺序;在固定历史窗口内,可通过固定成本更新用户表示,无需重新编码历史或重复调用 LLM,即可纳入新互动并高效更新个性化结果。在 LinkedIn Premium 检索任务上,0.6B 参数模型的 MAR@100 达到 0.45。
关键要点
- 01基于档案相似度的推荐难以处理职业网络中互补、非对称的互动关系。
- 02PAIR 通过曝光条件多负样本对比目标建模意图偏好,无需显式参考模型。
- 03点击历史聚合与位置编码可捕捉时间顺序,并支持固定成本的用户表示更新。
- 04新互动可在 CPU 上低成本更新,避免服务阶段重复进行 LLM 推理。
- 05LinkedIn Premium 检索中,0.6B 参数模型取得 0.45 的 MAR@100。
解读
尚无解读。
原始英文摘要
arXiv:2610.30941v1 Announce Type: cross Abstract: General-purpose embeddings trained on profile similarity often misrank candidates in professional networks, where relevance is inherently complementary rather than symmetric. For example, job seekers usually engage with recruiters rather than peers with similar credentials. Current user recommendation systems are often built on profile similarity or social signals such as shared connections, which are effective in friend-oriented social networks where users tend to connect with similar people or within existing social circles. However, this does not hold in professional platforms like LinkedIn, where interactions are often goal-driven and cross-role interactions, requiring matching based on complementary intents rather than similarity or social proximity. In this paper, we propose Preference-Aligned Intent Retrieval, a retrieval framework that is designed to model user intent preference instead of profile similarity. Our approach is inspired by the preference-learning perspective of Direct Preference Optimization, but instantiates preference learning as an exposure-conditioned multi-negative contrastive objective over embeddings. This formulation simplifies training and scales efficiently to large candidate sets without requiring an explicit reference model. Furthermore, we incorporate user interaction history by aggregating click histories with positional encoding to capture temporal order, which enables constant-cost updates of user representations over a fixed history window, allowing new interactions to be incorporated without re-encoding history. As a result, personalization can be updated efficiently using lightweight CPU operations without repeated LLM inference during serving. We evaluate PAIR on LinkedIn's Premium retrieval task. A 0.6B parameter model achieves a MAR@100 of 0.45.