用配对比较优化推荐,更准更省数据。
Personalized Recommendations via Active Utility-based Pairwise Sampling
- 基于配对比较学习用户偏好,不依赖评分或完整排序。
- 主动选择能最大提升推荐质量的提问,节省用户精力。
- 适配不同场景,适合追求精准与效率的推荐系统设计者。
推荐系统通过个性化建议提升用户体验,传统方法依赖显式评分或完整排序,但评分易受行为偏差影响,完整排序又难以获取。为此,我们提出一种通用的基于效用的框架,从简单直观的配对比较中学习偏好。该方法模型无关,可针对任意任务目标优化效用函数,使推荐目标与实际应用中的高质量结果定义对齐。核心贡献是新型效用驱动的主动采样策略,选择能最大程度提升最终推荐效用的查询问题。偏好模型基于概率性Plackett-Luce框架处理配对数据。我们在两个场景验证:一是使用矩阵分解的电影推荐任务,二是使用神经网络的大学招生候选筛选任务。实验表明,该框架在准确率、数据效率和用户中心性方面均有显著优势。
原文摘要 · Abstract (English)
Recommender systems play a critical role in enhancing user experience by providing personalized suggestions based on user preferences. Traditional approaches often rely on explicit numerical ratings or assume access to fully ranked lists of items. However, ratings frequently fail to capture true preferences due to users' behavioral biases and subjective interpretations of rating scales, while eliciting full rankings is demanding and impractical. To overcome these limitations, we propose a generalized utility-based framework that learns preferences from simple and intuitive pairwise comparisons. Our approach is model-agnostic and designed to optimize for arbitrary, task-specific utility functions, allowing the system's objective to be explicitly aligned with the definition of a high-quality outcome in any given application. A central contribution of our work is a novel utility-based active sampling strategy for preference elicitation. This method selects queries that are expected to provide the greatest improvement to the utility of the final recommended outcome. We ground our preference model in the probabilistic Plackett-Luce framework for pairwise data. To demonstrate the versatility of our approach, we present two distinct experiments: first, an implementation using matrix factorization for a classic movie recommendation task, and second, an implementation using a neural network for a complex candidate selection scenario in university admissions. Experimental results demonstrate that our framework provides a more accurate, data-efficient, and user-centric paradigm for personalized ranking.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。