Improved Algorithm on Online Clustering of Bandits
We generalize the setting of online clustering of bandits by allowing non-uniform distribution over user frequencies. A more efficient algorithm is proposed with simple set structures to represent clusters. We prove a regret bound for the new algorithm which is free of the minimal frequency over users. The experiments on both synthetic and real datasets consistently show the advantage of the new algorithm over existing methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringOnline ClusteringSimilar Papers 제목 키워드 기반
Online Clustering of Dueling Bandits
The contextual multi-armed bandit (MAB) is a widely used framework for problems requiring sequential decision-making under uncertainty, such as recommendation systems. In applications involving a large number of users, t…
ClusteringDecision MakingDecision Making Under UncertaintyOnline Clustering+2Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts
The contextual multi-armed bandit (MAB) problem is crucial in sequential decision-making. A line of research, known as online clustering of bandits, extends contextual MAB by grouping similar users into clusters, utilizi…
ClusteringOnline ClusteringSequential Decision MakingOnline Clustering of Contextual Cascading Bandits
We consider a new setting of online clustering of contextual cascading bandits, an online learning problem where the underlying cluster structure over users is unknown and needs to be learned from a random prefix feedbac…
ClusteringOnline ClusteringGraph Clustering Bandits for Recommendation
We investigate an efficient context-dependent clustering technique for recommender systems based on exploration-exploitation strategies through multi-armed bandits over multiple users. Our algorithm dynamically groups us…
ClusteringGraph ClusteringMulti-Armed BanditsRecommendation SystemsAnonymous Bandits for Multi-User Systems
In this work, we present and study a new framework for online learning in systems with multiple users that provide user anonymity. Specifically, we extend the notion of bandits to obey the standard $k$-anonymity constrai…
Clustering