SWIM (Step-Wise Integrated Measure), a list-level evaluator that models user behaviors as a finite-horizon prefix session-level survival process, and efficiently estimates continuation probabilities and utilities in parallel, satisfying strict industrial latency constraints.
Abstract
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.
The proposed OneModel, a unified framework for multi-stream final ranking, maps heterogeneous behaviors into shared event sequences, learns long-context user representations with an action-oriented backbone, and introduces scenario-aware Information Modulation to balance cross-stream transfer and stream-specific specia...
Yinqi Zhang, Pei-Yu Hu, Yuntian Tang et al.· 1 citation
Gryphon-v2, a unified generate-and-rank architecture for end-to-end recommendation, and results support the practical viability of a generative retriever with a Ranking Module distilled from the Teacher Ranker as an end-to-end alternative to a production cascade.
Anna Lipkina, Daria Tikhonovich, Viktor Yanush et al.· 0 citations
The meeting of foundation models, generative artificial intelligence, privacy-preserving methods, and explainability mechanisms defines future directions without losing focus on providing real user value by means of a technology that improves human choice, but not autonomy.
S. Desai· International Journal of Com...· 0 citations
Pair-Space Generation (PSG), a reformulation that elevates the generation atom from individual items to ordered item pairs and establishes three theoretical guarantees that it is bijective with item-space generation and induces an equivalent family of sequence distributions, thus incurring no loss of expressiveness.
Chao Feng, Li Ma, Xiancheng Gao et al.· arXiv.org· 0 citations
GARDRec, a Graph-grounded Adaptive Reasoning and Decision-aware Recommendation framework for LLM-based next-item ranking, is proposed, which improves candidate-ranking performance over representative baselines and verifies the contributions of graph projection, neighborhood retrieval, explicit decision features, rankin...
Yong Wang, Hong-Liang Sun, Jin-Lan Liu et al.· 0 citations
Industrial recommender systems typically integrate multiple objectives—such as clicks, watch time, likes, and follows—to perform a holistic ranking. However, effectively fusing these diverse tasks to reflect overall user satisfaction remains a formidable challenge. Existing approaches struggle with distributional discr...
Qing Luo, Ge Chen, Huayi Shen et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.