paper-with-me

홈 › Papers

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

2024-06-20 · YuAn Wang, Zhiyu Li, Changshuo Zhang, Sirui Chen, Xiao Zhang, Jun Xu, Quan Lin

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.

📄 PDF Abstract BibTeX arXiv:2406.14004

Code (0)

등록된 구현이 없습니다.

Tasks

Recommendation SystemsRe-Ranking

Similar Papers 제목 키워드 기반

FairGAN: GANs-based Fairness-aware Learning for Recommendations with Implicit Feedback

2022-04-25 · Proceedings of the ACM Web Conference 2022 4 · Jie Li, Yongli Ren, Ke Deng

Ranking algorithms in recommender systems influence people to make decisions. Conventional ranking algorithms based on implicit feedback data aim to maximize the utility to users by capturing users’ preferences over item…

Exposure FairnessFairnessRecommendation Systems

TailorMind: Towards Preference-Aligned Multimodal Content Generation

2026-06-22 · Hengji Zhou, Ye Liu, Yufeng Liu, Si Wu 외 arxiv

Personalized content systems depend on available UGC and struggle when suitable content is absent, delayed, or costly to create. Although multimodal generators can synthesize content on demand, how to translate behaviora…

Collaborative Filteringmultimodal generation

Privacy-Preserving Fair Item Ranking

2023-03-06 · Jia Ao Sun, Sikha Pentyala, Martine De Cock, Golnoosh Farnadi

Users worldwide access massive amounts of curated data in the form of rankings on a daily basis. The societal impact of this ease of access has been studied and work has been done to propose and enforce various notions o…

FairnessPrivacy Preserving

Beyond Positive History: Re-ranking with List-level Hybrid Feedback

2024-10-28 · Muyan Weng, Yunjia Xi, Weiwen Liu, Bo Chen 외

As the last stage of recommender systems, re-ranking generates a re-ordered list that aligns with the user's preference. However, previous works generally focus on item-level positive feedback as history (e.g., only clic…

Contrastive LearningRecommendation SystemsRe-Ranking

A Deep Recurrent Survival Model for Unbiased Ranking

2020-04-30 · Jiarui Jin, Yuchen Fang, Wei-Nan Zhang, Kan Ren 외

Position bias is a critical problem in information retrieval when dealing with implicit yet biased user feedback data. Unbiased ranking methods typically rely on causality models and debias the user feedback through inve…

Information RetrievalmodelPositionRetrieval+1