Do Not Wait: Learning Re-Ranking Model Without User Feedback At Serving Time in E-Commerce
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.
Authors
- Jun Xu (ORCID: https://orcid.org/0000-0001-7170-111X)
- Sirui Chen (ORCID: https://orcid.org/0000-0001-7740-508X)
- Xiao Zhang (ORCID: https://orcid.org/0000-0001-7397-5632)
- Zhiyu Li (ORCID: https://orcid.org/0000-0002-8187-4177)
- Quan Lin (ORCID: https://orcid.org/0009-0002-7149-5525)
- Yuan Wang (ORCID: https://orcid.org/0000-0002-3630-9179)
- Changshuo Zhang (ORCID: https://orcid.org/0009-0001-8481-9421)
Institutions
- Alibaba Group (China) (CN)
- Renmin University of China (CN)
Publication Details
- Published
- 2024-10-08
- DOI
- https://doi.org/10.1145/3640457.3688165
- Citations
- 3
- Primary Topic
- Advanced Bandit Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 1.47
Funders
- National Natural Science Foundation of China
- Renmin University of China
- National Science and Technology Major Project
- Fundamental Research Funds for the Central Universities