Leveraging heterogeneous spillover in maximizing contextual bandit rewards
Not on the map. Why?
Abstract (arXiv)
Recommender systems relying on contextual multi-armed bandits continuously improve relevant item recommendations by taking into account the contextual information. The objective of bandit algorithms is to learn the best arm (e.g., best item to recommend) for each user and thus maximize the cumulative rewards from user engagement with the recommendations. The context that these algorithms typically consider are the user and item attributes. However, in the context of social networks where textitthe action of one user can influence the actions and rewards of other users, neighbors' actions are also a very important context, as they can have not only predictive power but also can impact future rewards through spillover. Moreover, influence susceptibility can vary for different people based on their preferences and the closeness of ties to other users which leads to heterogeneity in the spillover effects. Here, we present a framework that allows contextual multi-armed bandits to account for such heterogeneous spillovers when choosing the best arm for each user. Our experiments on several semi-synthetic and real-world datasets show that our framework leads to significantly higher rewards than existing state-of-the-art solutions that ignore the network information and potential spillover.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 19 of its 47 references that are in the map. First posted on arXiv 16 Oct 2023.
Builds on
19 of 47 references.
References · 19
- 2020Neural Thompson Samplingcited by 127
- 2014Online Clustering of Banditscited by 99
- 2018Characterizing and Detecting Hateful Users on Twittercited by 55
- 2016Distributed Clustering of Linear Bandits in Peer to Peer Networkscited by 50
- 2013A Gang of Banditscited by 49
- 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 44
- 2016On Context-Dependent Clustering of Banditscited by 43
- 2021EE-Net: Exploitation-Exploration Neural Networks in Contextual Banditscited by 43
- 2019Improved Algorithm on Online Clustering of Banditscited by 38
- 2019Conversational Contextual Bandit: Algorithm and Applicationcited by 35
- 2021Local Clustering in Contextual Multi-Armed Banditscited by 29
- 2014A Neural Networks Committee for the Contextual Bandit Problemcited by 23
7 more
- 2021Interference, Bias, and Variance in Two-Sided Marketplace Experimentation: Guidance for Platformscited by 22
- 2023Graph Neural Banditscited by 20
- 2020Fast Distributed Bandits for Online Recommendation Systemscited by 18
- 2020Reducing Interference Bias in Online Marketplace Pricing Experimentscited by 13
- 2020Heterogeneous Treatment and Spillover Effects under Clustered Network Interferencecited by 11
- 2021Show Me the Whole World: Towards Entire Item Space Exploration for Interactive Personalized Recommendationscited by 7
- 2023A Two-Part Machine Learning Approach to Characterizing Network Interference in A/B Testingcited by 3
Built on by
Citing papers per year: 2025: 2.
2 papers.