提出SWIM评估生成重排列表,更贴合用户连续浏览行为。
SWIM: Step-Wise Integrated Measure for Session-supervised List Evaluation in Generative Re-ranking

- 将用户行为建模为有限时域的会话生存过程,分步评估列表贡献。
- 在短视频场景中提升推荐参与度,相比基线显著改善整体表现。
- 适合工业级推荐系统,兼顾高精度与实时性要求。
现代工业推荐系统越来越多采用生成器-评估器(G-E)框架进行重排。生成器从上游检索和排序模块筛选的候选池中生成项目列表,评估器对这些列表打分并选择得分最高的一个用于最终曝光。然而,在序列化平台(如短视频应用)中,用户持续消费内容,无视人为设定的列表边界。传统评估器通过聚合点级评分来打分,隐含假设曝光独立,无法捕捉关键的会话级动态,如上下文依赖、用户续看意愿以及重复内容带来的边际效用递减。为此,我们提出SWIM(Step-Wise Integrated Measure),一种列表级评估方法,将用户行为建模为有限时域的前缀会话级生存过程。SWIM通过分解为递归生存分布和到达位置条件奖励,估计当前列表对会话目标的前缀条件贡献。利用因果掩码Transformer,SWIM可并行高效估算续看概率与效用,满足严格的工业延迟要求。大量实验表明,SWIM在列表级重排任务中显著优于基线,大幅提升了整体推荐参与度。
原文摘要 · Abstract (English)
Modern industrial recommender systems have increasingly adopted the Generator-Evaluator (G-E) framework for the re-ranking stage. Within this paradigm, the generator produces candidate item lists from a pool filtered by upstream retrieval and ranking modules, while the evaluator scores these lists and selects the highest-scoring one for final exposure per request. However, on sequential platforms (e.g., short-video apps), users consume items continuously, ignoring artificial list boundaries. Conventional evaluators score lists by aggregating point-wise values, implicitly assuming exposure independence. This fails to capture critical session-level dynamics, such as contextual dependencies, user continuation, and diminishing marginal utility from repetitive content. To bridge this gap, we propose SWIM (Step-Wise Integrated Measure), a list-level evaluator that models user behaviors as a finite-horizon prefix session-level survival process. SWIM estimates the prefix-conditioned contribution of the current list to the session-level objective by factorizing it into a recursive survival distribution and reached-position conditional rewards. Leveraging a causally-masked Transformer, SWIM efficiently estimates continuation probabilities and utilities in parallel, satisfying strict industrial latency constraints. Extensive experiments demonstrate that SWIM significantly outperforms baselines in listwise reranking tasks, yielding substantial improvements in overall recommendation engagement.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。