SWIM: Step-Wise Integrated Measure for Session-supervised List Evaluation in Generative Re-ranking

• URL: http://arxiv.org/abs/2608.25104v1
• Date: Tue, 25 Aug 2026 19:57:48 GMT
• Title: SWIM: Step-Wise Integrated Measure for Session-supervised List Evaluation in Generative Re-ranking
• Abstract summary: We propose SWIM, a list-level evaluator that models user behaviors as a finite-horizon prefix session-level survival process.<n>We show that SWIM significantly outperforms baselines in listwise reranking tasks, yielding substantial improvements in overall recommendation engagement.
• Score: 50.941707269747866
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• EchoRec: Multi-Item Prediction-Empowered Generative Recommendation via Cycle-Consistent Preference Alignment [57.08595331216049]
  Generative recommendation autoregressively generates the semantic IDs of the target item, unifying preference modeling and index retrieval within the shared token space.<n>Recent attempts have introduced Multi-Token Prediction (MTP), yet they primarily inherit its efficiency merit, leaving its potential as dense supervision unexplored.<n>We propose EchoRec, which empowers MTP with cycle-consistent holistic preference alignment across multi-horizon for generative recommendation.
  arXiv  Detail & Related papers  (2026-08-14T06:59:12Z)
• DIRECTOR: Dynamic Index-based Recommendation with Transport-Optimized Retrieval [47.419173509430834]
  Reranking is a decision problem that aims to select and order a high-utility slate from a request-specific candidate set.<n>We propose Dynamic Index-based RECommendation with Transport-d Retrieval, a transport-guided parallel reranking framework.<n>Experiments demonstrate that DIRECTOR consistently outperforms strong reranking baselines.
  arXiv  Detail & Related papers  (2026-07-29T03:03:03Z)
• POEM: Partial-Order Enhanced Real-Time Sequential Modeling for Recommendation [47.301549241806185]
  We propose a new real-time sequential modeling framework built upon intrinsic partial-order relations from the recommendation cascade.<n>POEM takes real-time multi-task ranking scores generated by upstream ranking modules as supervision to construct dynamic partial-order sequences.<n>Fully deployed on Kuaishou online traffic, POEM achieves significant online gains.
  arXiv  Detail & Related papers  (2026-06-29T08:23:04Z)
• F-GRPO: Factorized Group-Relative Policy Optimization for Unified Candidate Generation and Ranking [79.49893545611779]
  Large Language Models (LLMs) can generate a subset and order it within a single autoregressive pass.<n>This flexibility introduces a new optimization challenge: the model must search an output space while receiving utility feedback only after the full ranked list is generated.<n>This credit assignment gap makes end-to-end optimization unstable and sample-inefficient.<n>We propose a unified framework that performs both within a single autoregressive rollout and optimize them end-to-end via factorized group-relative policy optimization.
  arXiv  Detail & Related papers  (2026-05-13T04:52:33Z)
• From Local Indices to Global Identifiers: Generative Reranking for Recommender Systems via Global Action Space [50.72071213515985]
  GloRank is a generative framework that shifts reranking from selecting local indices to generating global identifiers.<n>We show that GloRank consistently outperforms state-of-the-art baselines and achieves superior robustness in cold-start scenarios.
  arXiv  Detail & Related papers  (2026-04-28T06:57:00Z)
• Listwise Preference Diffusion Optimization for User Behavior Trajectories Prediction [41.53271688465831]
  We formulate User Behavior Trajectory Prediction (UBTP) as a new task setting that explicitly models long-term user preferences.<n>We introduce Listwise Preference Diffusion Optimization (LPDO), a diffusion-based training framework that directly optimize structured preferences over entire item sequences.<n>To rigorously evaluate multi-step prediction quality, we propose the task-specific metric Sequential Match (SeqMatch), which measures exact trajectory agreement, and adopt Perplexity (PPL), which assesses probabilistic fidelity.
  arXiv  Detail & Related papers  (2025-11-01T12:16:24Z)
• From Generation to Consumption: Personalized List Value Estimation for Re-ranking [11.827600847399973]
  We propose CAVE, a personalized Consumption-Aware list Value Estimation framework.<n>CAVE formulates the list value as the expectation over sub-list values, weighted by user-specific exit probabilities at each position.<n>By jointly modeling sub-list values and user exit behavior, CAVE yields a more faithful estimate of actual list consumption value.
  arXiv  Detail & Related papers  (2025-08-04T09:43:21Z)
• Self-Calibrated Listwise Reranking with Large Language Models [137.6557607279876]
  Large language models (LLMs) have been employed in reranking tasks through a sequence-to-sequence approach. This reranking paradigm requires a sliding window strategy to iteratively handle larger candidate sets. We propose a novel self-calibrated listwise reranking method, which aims to leverage LLMs to produce global relevance scores for ranking.
  arXiv  Detail & Related papers  (2024-11-07T10:31:31Z)
• Sequential Recommendation via Stochastic Self-Attention [68.52192964559829]
  Transformer-based approaches embed items as vectors and use dot-product self-attention to measure the relationship between items. We propose a novel textbfSTOchastic textbfSelf-textbfAttention(STOSA) to overcome these issues. We devise a novel Wasserstein Self-Attention module to characterize item-item position-wise relationships in sequences.
  arXiv  Detail & Related papers  (2022-01-16T12:38:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.