Thanks to their scalability, two-stage recommenders are used by many of today's largest online platforms, including YouTube, LinkedIn, and Pinterest. These systems produce recommendations in two steps: (i) multiple nominators, tuned for low prediction latency, preselect a small subset of candidates from the whole item pool; (ii) a slower but more accurate ranker further narrows down the nominated items, and serves to the user. Despite their popularity, the literature on two-stage recommenders is relatively scarce, and the algorithms are often treated as mere sums of their parts. Such treatment presupposes that the two-stage performance is explained by the behavior of the individual components in isolation. This is not the case: using synthetic and real-world data, we demonstrate that interactions between the ranker and the nominators substantially affect the overall performance. Motivated by these findings, we derive a generalization lower bound which shows that independent nominator training can lead to performance on par with uniformly random recommendations. We find that careful design of item pools, each assigned to a different nominator, alleviates these issues. As manual search for a good pool allocation is difficult, we propose to learn one instead using a Mixture-of-Experts based approach. This significantly improves both precision and recall at K.
翻译:由于可扩缩性,许多当今最大的在线平台,包括YouTube、LinkedIn和Pinterest等,都使用两阶段建议。这些系统分两步提出建议:(一) 多个点名员,按低预测潜值调整,预选整个项目池的一小部分候选人;(二) 更慢、更准确的排名员进一步缩小提名项目的范围,为用户服务。尽管受到欢迎,但关于两阶段建议者的文献相对较少,而且算法往往只是其部分的总和。这种处理的前提条件是,两阶段的业绩是由个别组成部分孤立地的行为来解释的。情况并非如此:使用合成数据和真实世界数据,我们证明排名员和点名员之间的相互作用严重影响了总体业绩。受这些调查结果的驱动,我们得出了一个较低的概括性约束,表明独立点名培训能够以一致的随机建议为目的进行业绩。我们发现,每个指定给不同点名员的物品库的精心设计,可以缓解这些问题。这不是个问题:使用合成数据和真实世界数据,我们用手动的方法来改进一个精准的拼凑方法。