arXiv:2503.11067cs.IR2025-03TPAMI

提出可控制推荐曝光的变分贝叶斯排序方法,解决数据稀疏与流行度偏差问题。

Variational Bayesian Personalized Ranking

  • 将成对学习建模为变分推断,显式处理噪声和索引不确定性
  • 实现长尾内容可控曝光,排名准确率提升且计算复杂度保持线性
  • 适合需要可解释推荐机制的系统设计者与研究者

成对学习是隐式协同过滤的基础,但常受监督稀疏、交互噪声和流行度暴露偏差影响。本文提出变分贝叶斯个性化排序(VarBPR),一种可计算的变分框架,具备严谨的暴露可控性和理论可解释性。VarBPR将成对学习重构为离散潜在索引变量的变分推断,显式建模噪声与索引不确定性,并分为变分推断与变分学习两阶段。在变分推断阶段,统一的ELBO/正则化目标整合偏好对齐、去噪与流行度去偏,导出闭式后验分布,先验编码目标暴露模式,温度/正则强度控制后验与先验的一致性,使暴露可控性成为推断的内生结果。在变分学习阶段,提出后验压缩目标,将理想ELBO的计算复杂度从多项式降至线性,其近似由显式的Jensen间隙上界保证。理论上,通过识别结构误差项并揭示优先特定暴露模式(如长尾)的机会成本,提供可解释的泛化保证,为可控推荐系统设计提供分析工具。实验表明,VarBPR在多个主流模型上均取得一致性能提升,支持可控长尾曝光,并保持BPR的线性时间复杂度。

原文摘要 · Abstract (English)

Pairwise learning underpins implicit collaborative filtering, yet its effectiveness is often hindered by sparse supervision, noisy interactions, and popularity-driven exposure bias. In this paper, we propose Variational Bayesian Personalized Ranking (VarBPR), a tractable variational framework for implicit-feedback pairwise learning that offers principled exposure controllability and theoretical interpretability. VarBPR reformulates pairwise learning as variational inference over discrete latent indexing variables, explicitly modeling noise and indexing uncertainty, and divides training into two stages: variational inference and variational learning. In the variational inference stage, we develop a variational formulation that integrates preference alignment, denoising, and popularity debiasing under a unified ELBO/regularization objective, deriving closed-form posteriors with clear control semantics: the prior encodes a target exposure pattern, while temperature/regularization strength controls posterior-prior adherence. As a result, exposure controllability becomes an endogenous and interpretable outcome of variational inference. In the variational learning stage, we propose a posterior-compression objective that reduces the ideal ELBO's computational complexity from polynomial to linear, with the approximation justified by an explicit Jensen-gap upper bound. Theoretically, we provide interpretable generalization guarantees by identifying a structural error component and revealing the opportunity cost of prioritizing certain exposure patterns (e.g., long-tail), offering a concrete analytical lens for designing controllable recommender systems. Empirically, We validate VarBPR across popular backbones; it demonstrates consistent gains in ranking accuracy, enables controlled long-tail exposure, and preserves the linear-time complexity of BPR.

推荐系统变分推断曝光控制长尾推荐

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。