Multi-Agent Learning with Heterogeneous Linear Contextual Bandits
As trained intelligent systems become increasingly pervasive, multiagent learning has emerged as a popular framework for studying complex interactions between autonomous agents. Yet, a formal understanding of how and when learners in heterogeneous environments benefit from sharing their respective experiences is far from complete. In this paper, we seek answers to these questions in the context of linear contextual bandits. We present a novel distributed learning algorithm based on the upper confidence bound (UCB) algorithm, which we refer to as H-LINUCB, wherein agents cooperatively minimize the group regret under the coordination of a central server. In the setting where the level of heterogeneity or dissimilarity across the environments is known to the agents, we show that H-LINUCB is provably optimal in regimes where the tasks are highly similar or highly dissimilar.Submission Number: 7883
Code (1)
Similar Papers 제목 키워드 기반
Federated Linear Contextual Bandits with Heterogeneous Clients
The demand for collaborative and private bandit learning across multiple agents is surging due to the growing quantity of data generated from distributed systems. Federated bandit learning has emerged as a promising fram…
AllFederated LearningMulti-Armed BanditsOptimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
Large and complex datasets are often collected from several, possibly heterogeneous sources. Multitask learning methods improve efficiency by leveraging commonalities across datasets while accounting for possible differe…
Multi-Armed BanditsregressionA Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
We study federated contextual linear bandits, where $M$ agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We consider the asynchronous setting, where a…
Distributed Multi-Task Learning for Stochastic Bandits with Context Distribution and Stage-wise Constraints
We present conservative distributed multi-task learning in stochastic linear contextual bandits with heterogeneous agents. This extends conservative linear bandits to a distributed setting where M agents tackle different…
Multi-Armed BanditsMulti-Task LearningStock Market PredictionFederated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
We study the problem of federated contextual combinatorial cascading bandits, where $|\mathcal{U}|$ agents collaborate under the coordination of a central server to provide tailored recommendations to the $|\mathcal{U}|$…