arXiv Analytics

Sign in

arXiv:2302.01377 [cs.LG]AbstractReferencesReviewsResources

Learning with Exposure Constraints in Recommendation Systems

Omer Ben-Porat, Rotem Torkan

Published 2023-02-02Version 1

Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers' point of view. Content providers, e.g., vloggers and bloggers, contribute fresh content and rely on user engagement to create revenue and finance their operations. In this work, we propose a contextual multi-armed bandit setting to model the dependency of content providers on exposure. In our model, the system receives a user context in every round and has to select one of the arms. Every arm is a content provider who must receive a minimum number of pulls every fixed time period (e.g., a month) to remain viable in later rounds; otherwise, the arm departs and is no longer available. The system aims to maximize the users' (content consumers) welfare. To that end, it should learn which arms are vital and ensure they remain viable by subsidizing arm pulls if needed. We develop algorithms with sub-linear regret, as well as a lower bound that demonstrates that our algorithms are optimal up to logarithmic factors.

Comments: Published in The Web Conference 2023 (WWW 23)
Categories: cs.LG, cs.AI
Related articles: Most relevant | Search more
arXiv:1810.06313 [cs.LG] (Published 2018-10-15)
Regret vs. Bandwidth Trade-off for Recommendation Systems
arXiv:1811.12591 [cs.LG] (Published 2018-11-30)
Active Learning in Recommendation Systems with Multi-level User Preferences
arXiv:2205.07268 [cs.LG] (Published 2022-05-15)
Textual Explanations and Critiques in Recommendation Systems