mlsanityData to 14 Oct 2026

Do Not Wait: Learning Re-Ranking Model Without User Feedback At Serving Time in E-Commerce

arXiv 2406.14004 ↗First posted 20 Jun 2024cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Recommender systems have been widely used in e-commerce, and re-ranking models are playing an increasingly significant role in the domain, which leverages the inter-item influence and determines the final recommendation lists. Online learning methods keep updating a deployed model with the latest available samples to capture the shifting of the underlying data distribution in e-commerce. However, they depend on the availability of real user feedback, which may be delayed by hours or even days, such as item purchases, leading to a lag in model enhancement. In this paper, we propose a novel extension of online learning methods for re-ranking modeling, which we term LAST, an acronym for Learning At Serving Time. It circumvents the requirement of user feedback by using a surrogate model to provide the instructional signal needed to steer model improvement. Upon receiving an online request, LAST finds and applies a model modification on the fly before generating a recommendation result for the request. The modification is request-specific and transient. It means the modification is tailored to and only to the current request to capture the specific context of the request. After a request, the modification is discarded, which helps to prevent error propagation and stabilizes the online learning procedure since the predictions of the surrogate model may be inaccurate. Most importantly, as a complement to feedback-based online learning methods, LAST can be seamlessly integrated into existing online learning systems to create a more adaptive and responsive recommendation experience. Comprehensive experiments, both offline and online, affirm that LAST outperforms state-of-the-art re-ranking models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 35 references that are in the map. First posted on arXiv 20 Jun 2024.

Builds on

19 of 35 references.

References · 19

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  3. 2019Introduction to Online Convex Optimizationcited by 803
  4. 2014Semi-Supervised Learning with Deep Generative Modelscited by 496
  5. 2017Deep Reinforcement Learning: An Overviewcited by 333
  6. 2024Reinforcement learningcited by 247
  7. 2017Online Deep Learning: Learning Deep Neural Networks on the Flycited by 86
  8. 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
  9. 2019SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrievalcited by 48
  10. 2018Seq2Slate: Re-ranking and Slate Optimization with RNNscited by 39
  11. 2021Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairnesscited by 36
  12. 2022CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender Systemscited by 29
7 more
  1. 2018Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networkscited by 22
  2. 2018Globally Optimized Mutual Influence Aware Ranking in E-Commerce Searchcited by 18
  3. 2023Controllable Multi-Objective Re-ranking with Policy Hypernetworkscited by 15
  4. 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
  5. 2022PEAR: Personalized Re-ranking with Contextualized Transformer for Recommendationcited by 12
  6. 2018Using Image Fairness Representations in Diversity-Based Re-ranking for Recommendationscited by 11
  7. 2019Sequential Evaluation and Generation Framework for Combinatorial Recommender Systemcited by 10

Built on by

Not cited yet.