AI & ML
Beyond Independent Predictions: Learning the Browsing Journey for Sequence-Level Re-ranking
arXiv cs.IR0 views
arXiv:2611.07591v1 Announce Type: new Abstract: Re-ranking aims to present users with an ordered list that maximizes sequence-level utility. Industrial deployments widely adopt the Generator--Evaluator framework, where the generator proposes candidate sequences, and the evaluator scores them to select the best one for display. The fidelity of the evaluator's utility estimates thus directly governs recommendation quality. However, existing evaluators predominantly follow the \textbf{Independent Behavior Modeling (IBM)} paradigm, which simplifies the continuous user \emph{browsing journey} into independent per-item predictions (e.g., CTR). This oversimplification ignores two physical realities: (i) a click can occur only after the item has been reached and impressed, and (ii) items compete for finite user attention. As a result, IBM produces systematically biased evaluations and suboptimal sequence selection. To address this, we propose a \textbf{Joint Behavior Modeling (JBM)} perspective that explicitly models the \emph{display} $\rightarrow$ \emph{impression} $\rightarrow$ \emph{click} process to capture causal and competitive dependencies within a sequence. Building on JBM, we develop the \textbf{Impression-Click Evaluator (ICE)}, a plug-and-play framework that (i) predicts a browsing-depth distribution to estimate per-position impression probabilities, (ii) leverages predicted impressions to suppress spurious context from unexposed items during click modeling, and (iii) introduces a click distribution matching objective to capture intra-sequence dependencies. Extensive offline experiments across diverse backbones, together with a 14-day online A/B test in the Taobao App (+0.70\% clicks, +3.67\% revenue) and full-traffic deployment, validate the effectiveness and robustness of our approach.
Source:https://arxiv.org/abs/2611.07591PreviousWhat Gets Hacked in a Collaborative Reward for LLM Recommenders: The Part That Does Not Depend on the UserNextMEMOIR: A Training-Free Memory Lifecycle for Long-Horizon LLM Agents
Related posts
A tractable transition function for the Wright-Fisher diffusion with selection via gamma duality
0arXiv stat.CO
A Generalized Bayesian Approach to Clustering with Dimension Reduction
0arXiv stat.CO
Locally Adaptive Conformal Prediction for Polynomial Chaos Expansions
0arXiv stat.CO
Circular interval-valued regression with application to wind direction: A cylindrical approach
0arXiv stat.CO
Advection-aligned block Vecchia inference for spatio-temporal Gaussian processes
0arXiv stat.CO
I built a daily GitHub AI leaderboard — 3 things nobody tells you about star counts
0dev.to GitHub