TL;DR
Ada-Ranker introduces an adaptive ranking paradigm for sequential recommendation systems that dynamically adjusts to changing data distributions, improving performance over traditional static models.
Contribution
The paper proposes Ada-Ranker, a novel training and inference framework that enables rankers to adapt to current data distributions during online serving.
Findings
Improves ranking accuracy by adapting to data distribution shifts.
Demonstrates better performance than static models in dynamic environments.
Provides a new paradigm for real-time adaptive recommendation.
Abstract
A large-scale recommender system usually consists of recall and ranking modules. The goal of ranking modules (aka rankers) is to elaborately discriminate users' preference on item candidates proposed by recall modules. With the success of deep learning techniques in various domains, we have witnessed the mainstream rankers evolve from traditional models to deep neural models. However, the way that we design and use rankers remains unchanged: offline training the model, freezing the parameters, and deploying it for online serving. Actually, the candidate items are determined by specific user requests, in which underlying distributions (e.g., the proportion of items for different categories, the proportion of popular or new items) are highly different from one another in a production environment. The classical parameter-frozen inference manner cannot adapt to dynamic serving…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
