arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.01609cs.IRcs.LGstat.ML
收藏

具有无分布可靠性保证的推荐系统

Recommendation Systems with Distribution-Free Reliability Guarantees

University of California Berkeley(加州大学伯克利分校);University of Michigan(密歇根大学)

Anastasios N. Angelopoulos, Karl Krauth, Stephen Bates, Yixin Wang, Michael I. Jordan

摘要:

在构建推荐系统时,我们试图向用户输出一组有用的项目。在引擎盖下,排名模型预测两个候选项中的哪一个更好,我们必须将这些成对比较提取到面向用户的输出中。然而,一个学习的排名模型永远不会完美,因此从表面上看它的预测并不能保证面向用户的输出是可靠的。从预先训练的排名模型构建,我们展示了如何返回一组严格保证包含大部分好项目的项目。我们的程序赋予任何排名模型与严格的有限样本控制的错误发现率(FDR),无论(未知)的数据分布。此外,我们的校准算法,使多个目标的推荐系统中的简单和原则性的整合。作为一个例子,我们展示了如何优化的建议多样性受用户指定的FDR控制水平,规避需要指定特设的权重的多样性损失对准确性损失。在整个过程中,我们专注于学习排序一组可能的建议,评估我们的方法对雅虎!学习排序和MSMarco数据集。

英文摘要:

When building recommendation systems, we seek to output a helpful set of items to the user. Under the hood, a ranking model predicts which of two candidate items is better, and we must distill these pairwise comparisons into the user-facing output. However, a learned ranking model is never perfect, so taking its predictions at face value gives no guarantee that the user-facing output is reliable. Building from a pre-trained ranking model, we show how to return a set of items that is rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate (FDR), regardless of the (unknown) data distribution. Moreover, our calibration algorithm enables the easy and principled integration of multiple objectives in recommender systems. As an example, we show how to optimize for recommendation diversity subject to a user-specified level of FDR control, circumventing the need to specify ad hoc weights of a diversity loss against an accuracy loss. Throughout, we focus on the problem of learning to rank a set of possible recommendations, evaluating our methods on the Yahoo! Learning to Rank and MSMarco datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑