通过学习用户在不同意图下的帕累托偏好,实现跨用户的推荐排序知识迁移。
PreferRec: Learning and Transferring Pareto Preferences for Multi-objective Re-ranking
- 在意图层面建模用户对准确率、多样性等目标的内在权衡关系。
- 利用共享优化模式实现跨用户偏好知识高效迁移,减少重复学习。
- 适合需要个性化且计算高效的多目标推荐系统场景。
多目标重排序已成为现代多阶段推荐系统的关键组件,需在准确性、多样性与公平性等冲突目标间取得平衡。现有方法通常在项目层面使用静态或人工设定的偏好权重来优化综合目标,忽略了用户在意图层面天然存在帕累托最优偏好,即个性化的目标权衡而非固定权重组合。此外,多数方法将每位用户的重排序视为独立问题,反复从头学习偏好,导致计算成本高,且忽视了用户间在目标权衡结构上的相似性。受同质多目标优化空间中帕累托最优模式可转移的启发,我们提出PreferRec,一种显式建模并跨用户迁移帕累托偏好的新框架。该框架包含三个紧密耦合组件:偏好感知帕累托学习旨在从重排序群体中捕捉用户在不同上下文下的内在目标权衡;知识引导迁移通过提炼同质优化空间中的共享优化模式,实现高效跨用户知识传递;转移的知识用于指导解的选择与个性化重排序,在保持用户特异性的同时,引导优化过程聚焦于帕累托前沿的高质量区域。
原文摘要 · Abstract (English)
Multi-objective re-ranking has become a critical component of modern multi-stage recommender systems, as it tasked to balance multiple conflicting objectives such as accuracy, diversity, and fairness. Existing multi-objective re-ranking methods typically optimize aggregate objectives at the item level using static or handcrafted preference weights. This design overlooks that users inherently exhibit Pareto-optimal preferences at the intent level, reflecting personalized trade-offs among objectives rather than fixed weight combinations. Moreover, most approaches treat re-ranking task for each user as an isolated problem, and repeatedly learn the preferences from scratch. Such a paradigm not only incurs high computational cost, but also ignores the fact that users often share similar preference trade-off structures across objectives. Inspired by the existence of homogeneous multi-objective optimization spaces where Pareto-optimal patterns are transferable, we propose PreferRec, a novel framework that explicitly models and transfers Pareto preferences across users. Specifically, PreferRec is built upon three tightly coupled components: Preference-Aware Pareto Learning aims to capture user intrinsic trade-offs among multiple conflicting objectives at the intent level. By learning Pareto preference representations from re-ranking populations, this component explicitly models how users prioritize different objectives under diverse contexts. Knowledge-Guided Transfer facilitates efficient cross-user knowledge transfer by distilling shared optimization patterns across homogeneous optimization spaces. The transferred knowledge is then used to guide solution selection and personalized re-ranking, biasing the optimization process toward high-quality regions of the Pareto front while preserving user-specific preference characteristics.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。