Large scale retrieval for the LinkedIn feed using causal language models

IF 3.5 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ai Magazine Pub Date : 2026-08-22 DOI:10.1002/aaai.70078
Sudarshan Srinivasa Ramanujam, Antonio Alonso, Saurabh Kataria, Siddharth Dangi, Akhilesh Gupta, Birjodh Singh Tiwana, Manas Haribhai Somaiya, Luke Simon, David Byrne, Madhu Arun, Sojeong Ha, Sen Zhou, Andrei Akterskii, Zhanglong Liu, Samira Sriram, Zihan Xiong, Zhoutao Pei, Angela Shao, Alex Li, Annie Xiao, Caitlin Kolb, Thomas Kistler, Zach Moore, Hamed Firooz
{"title":"Large scale retrieval for the LinkedIn feed using causal language models","authors":"Sudarshan Srinivasa Ramanujam,&nbsp;Antonio Alonso,&nbsp;Saurabh Kataria,&nbsp;Siddharth Dangi,&nbsp;Akhilesh Gupta,&nbsp;Birjodh Singh Tiwana,&nbsp;Manas Haribhai Somaiya,&nbsp;Luke Simon,&nbsp;David Byrne,&nbsp;Madhu Arun,&nbsp;Sojeong Ha,&nbsp;Sen Zhou,&nbsp;Andrei Akterskii,&nbsp;Zhanglong Liu,&nbsp;Samira Sriram,&nbsp;Zihan Xiong,&nbsp;Zhoutao Pei,&nbsp;Angela Shao,&nbsp;Alex Li,&nbsp;Annie Xiao,&nbsp;Caitlin Kolb,&nbsp;Thomas Kistler,&nbsp;Zach Moore,&nbsp;Hamed Firooz","doi":"10.1002/aaai.70078","DOIUrl":null,"url":null,"abstract":"<p>In large-scale recommendation systems like LinkedIn's, the retrieval stage is critical for narrowing billions of potential candidates to a manageable subset for ranking. LinkedIn's feed now serves suggested content based on the topical interests of members, where 2000 candidates are retrieved from several million candidates with a latency budget of a few milliseconds and inbound QPS of several thousand per second. This paper presents a novel retrieval approach that fine tunes a large causal language model (Meta's LLaMA 3) as a dual encoder to generate high quality embeddings for both users (members) and content (items), using only textual input. We describe the end to end pipeline, including prompt design for embedding generation, techniques for fine tuning at LinkedIn scale, and infrastructure for low latency, cost effective online serving. We share our findings on how quantizing numerical features in the prompt enables the information getting encoded in the embedding facilitating greater alignment between the retrieval and ranking layer. The system was evaluated using offline metrics and an online A/B test, which showed substantial improvements in member engagement. We observed significant gains among newer members, who often lack strong network connections, indicating that high-quality suggested content aids retention. This work demonstrates how generative language models can be effectively adapted for real time, high throughput retrieval in industrial applications.</p>","PeriodicalId":7854,"journal":{"name":"Ai Magazine","volume":"47 3","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2026-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/aaai.70078","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ai Magazine","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/aaai.70078","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In large-scale recommendation systems like LinkedIn's, the retrieval stage is critical for narrowing billions of potential candidates to a manageable subset for ranking. LinkedIn's feed now serves suggested content based on the topical interests of members, where 2000 candidates are retrieved from several million candidates with a latency budget of a few milliseconds and inbound QPS of several thousand per second. This paper presents a novel retrieval approach that fine tunes a large causal language model (Meta's LLaMA 3) as a dual encoder to generate high quality embeddings for both users (members) and content (items), using only textual input. We describe the end to end pipeline, including prompt design for embedding generation, techniques for fine tuning at LinkedIn scale, and infrastructure for low latency, cost effective online serving. We share our findings on how quantizing numerical features in the prompt enables the information getting encoded in the embedding facilitating greater alignment between the retrieval and ranking layer. The system was evaluated using offline metrics and an online A/B test, which showed substantial improvements in member engagement. We observed significant gains among newer members, who often lack strong network connections, indicating that high-quality suggested content aids retention. This work demonstrates how generative language models can be effectively adapted for real time, high throughput retrieval in industrial applications.

使用因果语言模型对LinkedIn提要进行大规模检索
在LinkedIn这样的大型推荐系统中,检索阶段对于将数十亿潜在候选人缩小到可管理的子集以进行排名至关重要。LinkedIn的信息流现在根据会员的主题兴趣提供推荐内容,从数百万个候选人中检索2000个候选人,延迟预算为几毫秒,入站QPS为每秒几千个。本文提出了一种新的检索方法,该方法对大型因果语言模型(Meta的LLaMA 3)进行微调,作为双编码器,仅使用文本输入为用户(成员)和内容(项目)生成高质量的嵌入。我们描述了端到端管道,包括嵌入生成的快速设计、LinkedIn规模的微调技术,以及低延迟、低成本在线服务的基础设施。我们分享了我们的发现,即在提示中量化数字特征如何使信息在嵌入中得到编码,从而促进检索层和排序层之间的更大一致性。该系统使用离线指标和在线A/B测试进行评估,结果显示会员参与度有了实质性提高。我们观察到新会员的显著增长,他们通常缺乏强大的网络联系,这表明高质量的建议内容有助于留存。这项工作证明了生成语言模型如何有效地适应工业应用中的实时、高吞吐量检索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Ai Magazine
Ai Magazine 工程技术-计算机:人工智能
CiteScore
3.90
自引率
11.10%
发文量
61
审稿时长
>12 weeks
期刊介绍: AI Magazine publishes original articles that are reasonably self-contained and aimed at a broad spectrum of the AI community. Technical content should be kept to a minimum. In general, the magazine does not publish articles that have been published elsewhere in whole or in part. The magazine welcomes the contribution of articles on the theory and practice of AI as well as general survey articles, tutorial articles on timely topics, conference or symposia or workshop reports, and timely columns on topics of interest to AI scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书