{"title":"MOBIUS:在百度赞助商搜索中实现下一代查询-广告匹配","authors":"Miao Fan, Jiacheng Guo, Shuai Zhu, Shuo Miao, Mingming Sun, Ping Li","doi":"arxiv-2409.03449","DOIUrl":null,"url":null,"abstract":"Baidu runs the largest commercial web search engine in China, serving\nhundreds of millions of online users every day in response to a great variety\nof queries. In order to build a high-efficiency sponsored search engine, we\nused to adopt a three-layer funnel-shaped structure to screen and sort hundreds\nof ads from billions of ad candidates subject to the requirement of low\nresponse latency and the restraints of computing resources. Given a user query,\nthe top matching layer is responsible for providing semantically relevant ad\ncandidates to the next layer, while the ranking layer at the bottom concerns\nmore about business indicators (e.g., CPM, ROI, etc.) of those ads. The clear\nseparation between the matching and ranking objectives results in a lower\ncommercial return. The Mobius project has been established to address this\nserious issue. It is our first attempt to train the matching layer to consider\nCPM as an additional optimization objective besides the query-ad relevance, via\ndirectly predicting CTR (click-through rate) from billions of query-ad pairs.\nSpecifically, this paper will elaborate on how we adopt active learning to\novercome the insufficiency of click history at the matching layer when training\nour neural click networks offline, and how we use the SOTA ANN search technique\nfor retrieving ads more efficiently (Here ``ANN'' stands for approximate\nnearest neighbor search). We contribute the solutions to Mobius-V1 as the first\nversion of our next generation query-ad matching system.","PeriodicalId":501281,"journal":{"name":"arXiv - CS - Information Retrieval","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MOBIUS: Towards the Next Generation of Query-Ad Matching in Baidu's Sponsored Search\",\"authors\":\"Miao Fan, Jiacheng Guo, Shuai Zhu, Shuo Miao, Mingming Sun, Ping Li\",\"doi\":\"arxiv-2409.03449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Baidu runs the largest commercial web search engine in China, serving\\nhundreds of millions of online users every day in response to a great variety\\nof queries. In order to build a high-efficiency sponsored search engine, we\\nused to adopt a three-layer funnel-shaped structure to screen and sort hundreds\\nof ads from billions of ad candidates subject to the requirement of low\\nresponse latency and the restraints of computing resources. Given a user query,\\nthe top matching layer is responsible for providing semantically relevant ad\\ncandidates to the next layer, while the ranking layer at the bottom concerns\\nmore about business indicators (e.g., CPM, ROI, etc.) of those ads. The clear\\nseparation between the matching and ranking objectives results in a lower\\ncommercial return. The Mobius project has been established to address this\\nserious issue. It is our first attempt to train the matching layer to consider\\nCPM as an additional optimization objective besides the query-ad relevance, via\\ndirectly predicting CTR (click-through rate) from billions of query-ad pairs.\\nSpecifically, this paper will elaborate on how we adopt active learning to\\novercome the insufficiency of click history at the matching layer when training\\nour neural click networks offline, and how we use the SOTA ANN search technique\\nfor retrieving ads more efficiently (Here ``ANN'' stands for approximate\\nnearest neighbor search). We contribute the solutions to Mobius-V1 as the first\\nversion of our next generation query-ad matching system.\",\"PeriodicalId\":501281,\"journal\":{\"name\":\"arXiv - CS - Information Retrieval\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.03449\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.03449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
百度是中国最大的商业网络搜索引擎,每天为数以亿计的在线用户提供各种查询服务。为了构建一个高效的赞助商搜索引擎,我们采用了一种三层漏斗状结构,在低响应延迟的要求和计算资源的限制下,从数十亿个候选广告中筛选和排序出数百个广告。给定用户查询后,顶部的匹配层负责向下一层提供语义相关的候选广告,而底部的排序层则更多地关注这些广告的商业指标(如 CPM、ROI 等)。匹配目标和排名目标的明显分离导致了较低的商业回报。Mobius 项目就是为了解决这一严重问题而设立的。具体来说,本文将阐述我们如何采用主动学习来克服匹配层在离线训练神经点击网络时点击历史记录不足的问题,以及我们如何使用 SOTA ANN 搜索技术来更高效地检索广告(这里的 "ANN "代表近邻搜索)。我们将这些解决方案贡献给 Mobius-V1,作为下一代查询-广告匹配系统的第一个版本。
MOBIUS: Towards the Next Generation of Query-Ad Matching in Baidu's Sponsored Search
Baidu runs the largest commercial web search engine in China, serving
hundreds of millions of online users every day in response to a great variety
of queries. In order to build a high-efficiency sponsored search engine, we
used to adopt a three-layer funnel-shaped structure to screen and sort hundreds
of ads from billions of ad candidates subject to the requirement of low
response latency and the restraints of computing resources. Given a user query,
the top matching layer is responsible for providing semantically relevant ad
candidates to the next layer, while the ranking layer at the bottom concerns
more about business indicators (e.g., CPM, ROI, etc.) of those ads. The clear
separation between the matching and ranking objectives results in a lower
commercial return. The Mobius project has been established to address this
serious issue. It is our first attempt to train the matching layer to consider
CPM as an additional optimization objective besides the query-ad relevance, via
directly predicting CTR (click-through rate) from billions of query-ad pairs.
Specifically, this paper will elaborate on how we adopt active learning to
overcome the insufficiency of click history at the matching layer when training
our neural click networks offline, and how we use the SOTA ANN search technique
for retrieving ads more efficiently (Here ``ANN'' stands for approximate
nearest neighbor search). We contribute the solutions to Mobius-V1 as the first
version of our next generation query-ad matching system.