.png){kind=icon}
返回
Multiagent Low-Dimensional Linear Bandits
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3179521.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study a multiagent stochastic linear bandit with side information, parameterized by an unknown vector 0(*) ? R-d. The side information consists of a finite collection of low-dimensional subspaces, one of which contains 0(*). In our setting, agents can collaborate to reduce regret by sending recommendations across a communication graph connecting them. We present a novel decentralized algorithm, where agents communicate subspace indices with each other and each agent plays a projected variant of LinUCB on the corresponding (low dimensional) subspace. By distributing the search for the optimal subspace across users and learning of the unknown vector by each agent in the corresponding low-dimensional subspace, we show that the per-agent finite-time regret is much smaller than the case when agents do not communicate. We finally complement these results through simulations.
Keyword:
Collaboration
Servers
Stochastic processes
Sparse matrices
Advertising
Postal services
Information sharing
Decentralized learning
gossip
linear bandits
networks
regret minimization
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Does Micro-Credit Empower Women through Self-Help Groups? Evidence from Punjab, Northern India.png)
SocietiesOAAI
SocietiesIF0
OAAI分享收藏
查看更多内容