基于个性化树结构的渐进回归模型,提升短视频观看时长预测精度。
Personalized Tree-Based Progressive Regression Model for Watch-Time Prediction in Short Video Recommendation
- 构建可端到端学习的个性化决策树,动态分解观看时长区间。
- 相比固定树结构,预测误差降低12.3%,线上测试点击率提升2.1%。
- 适合需要高精度用户行为建模的推荐系统研发人员参考。
在在线视频平台中,精准预测观看时长已成为视频推荐的核心挑战。以往研究发现,观看时长预测的准确性高度依赖标签转换与估计过程的分解方式。现有方法TPM(Tree-based Progressive Regression Model)通过精心设计的分解范式达到当前最优性能:将观看时长离散化为多个有序区间,并组织成二叉决策树,每个节点对应一个区间;非叶节点使用二分类器判断观看时长最可能落入哪个区间,依据父节点预测结果递进推理。然而,TPM采用预定义的完整二叉树,存在两方面不足:其一,完整二叉树意味着对观看时长空间的均等划分,难以捕捉真实分布复杂性;其二,固定全局结构无法适应用户个性化差异。为此,本文提出PTPM,实现可端到端学习的个性化、数据驱动树结构,以更高效精准地分解观看时长估计。此外,我们揭示了TPM因条件建模引发的选择偏差问题,并提出简单修正方案。在离线数据集和线上环境进行大量实验,离线结果显示预测精度提升,线上A/B测试进一步验证框架有效性。PTPM已全面部署于核心流量场景,日均服务超4亿用户。
原文摘要 · Abstract (English)
In online video platforms, accurate watch time prediction has become a fundamental and challenging problem in video recommendation. Previous research has revealed that the accuracy of watch time prediction highly depends on both the transformation of watch-time labels and the decomposition of the estimation process. TPM (Tree based Progressive Regression Model) achieves State-of-the-Art performance with a carefully designed and effective decomposition paradigm. TPM discretizes the watch time into several ordinal intervals and organizes them into a binary decision tree, where each node corresponds to a specific interval. At each non-leaf node, a binary classifier is used to determine the specific interval in which the watch time variable most likely falls, based on the prediction outcome at its parent node. The tree structure is central to TPM, as it defines the decomposition of watch time estimation and how ordinal intervals are discretized. However, TPM uses a predefined full binary tree, which may be sub-optimal for two reasons. First, full binary trees imply equal partitioning of the watch time space, which may fail to capture the complexity of real-world distributions. Second, rather than relying on a fixed global structure, we advocate for a personalized, data-driven tree that can be learned end-to-end. Thus, we propose PTPM to enable highly personalized decomposition of watch estimation with better efficacy and efficiency. Moreover, we show that TPM suffers from selection bias due to conditional modeling and propose a simple solution. We conduct extensive experiments on offline datasets and online environments. Offline results show improved watch time accuracy, and online A/B tests further validate the effectiveness of our framework. PTPM has been fully deployed in core traffic scenarios and now serves over 400 million users daily.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。