Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences
Tianchen Zhou, Jia Liu, Chaosheng Dong, Yi Sun
Abstract
In this paper, we investigate a new multi-armed bandit (MAB) online learning model that considers real-world phenomena in many recommender systems: (i) the learning agent cannot pull the arms by itself and thus has to offer payments to users to incentivize arm-pulling indirectly; and (ii) if users with specific arm preferences are well rewarded, they induce a "self-reinforcing" effect in the sense that they will attract more users of similar arm preferences. Besides addressing the tradeoff of exploration and exploitation, another key feature of this new MAB model is to balance reward and incentivizing payment. The goal of the agent is to minimize the accumulative regret over a fixed time horizon T with a low total payment. Our contributions in this paper are twofold: (i) We propose a new MAB model with random arm selection that considers the relationship of users' self-reinforcing preferences and incentives; and (ii) We leverage the properties of a multi-color Pólya urn with nonlinear feedback models to propose two MAB policies termed "At-Least-n Explore-Then-Commit" and "UCB-List." We prove that both policies achieve O(log T ) expected regret with O(log T ) expected payment over a time horizon T . We conduct numerical simulations to demonstrate and verify the performances of these two policies and study their robustness under various settings.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7b9e5c0f-d6ed-48a6-bd08-c36147154bc3Related papers
- Incentivized Bandit Learning with Self-Reinforcing User PreferencesTianchen Zhou, Jia Liu, Chaosheng Dong, Jingyuan DengICML 2021 · 2 citations
- Bandits Meet Mechanism Design to Combat Clickbait in Online RecommendationThomas Kleine Buening, Aadirupa Saha, Christos Dimitrakakis, Haifeng XuICLR 2024 · 7 citations
- Modeling Attrition in Recommender Systems with Departing BanditsOmer Ben-Porat, Lee Cohen, Liu Leqi, Zachary C. Lipton et al.AAAI 2022 · 14 citations
- Cascading Bandits: Optimizing Recommendation Frequency in Delayed Feedback EnvironmentsDairui Wang, Junyu Cao, Yan Zhang, Wei QiNeurIPS 2023 · 2 citations
- (Almost) Free Incentivized Exploration from Decentralized Learning AgentsChengshuai Shi, Haifeng Xu, Wei Xiong, Cong ShenNeurIPS 2021 · 10 citations
