arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.10865cs.AI
收藏

多智能体多臂老虎机问题中的随机可共享臂容量

Multi-agent Multi-armed Bandits with Stochastic Sharable Arm Capacities

State Key Laboratory of Cognitive Intelligence(认知智能国家重点实验室);College of Computer Science, Chongqing University(重庆大学计算机学院)

Hong Xie, Jinyu Mo, Defu Lian, Jie Wang, Enhong Chen

AI总结:

针对随机可共享臂容量的多智能体多臂老虎机问题,提出贪心算法与迭代分布式算法,实现无通信下最优臂拉取配置的共识,并验证有效性。

摘要:

受分布式选择问题的启发,我们提出了一种多玩家多臂老虎机(MAB)模型的新变体,该模型捕捉了每个臂上请求的随机到达以及将请求分配给玩家的策略。挑战在于如何设计一种分布式学习算法,使得玩家无需相互通信即可根据最优臂拉取配置(臂拉取配置规定了每个臂上的玩家数量)来选择臂。我们首先设计了一种贪心算法,该算法以多项式计算复杂度定位一个最优臂拉取配置。我们还设计了一种迭代分布式算法,使玩家在期望上以常数轮数内承诺一个最优臂拉取配置。我们采用先探索后承诺(ETC)框架来处理模型参数未知的在线设置。我们为玩家设计了一种探索策略来估计最优臂拉取配置。由于不同玩家的估计可能不同,玩家之间达成承诺具有挑战性。随后,我们设计了一种迭代分布式算法,该算法保证玩家仅需M轮即可就最优臂拉取配置达成共识。我们进行了实验以验证我们的算法。

英文摘要:

Motivated by distributed selection problems, we formulate a new variant of multi-player multi-armed bandit (MAB) model, which captures stochastic arrival of requests to each arm, as well as the policy of allocating requests to players. The challenge is how to design a distributed learning algorithm such that players select arms according to the optimal arm pulling profile (an arm pulling profile prescribes the number of players at each arm) without communicating to each other. We first design a greedy algorithm, which locates one of the optimal arm pulling profiles with a polynomial computational complexity. We also design an iterative distributed algorithm for players to commit to an optimal arm pulling profile with a constant number of rounds in expectation. We apply the explore then commit (ETC) framework to address the online setting when model parameters are unknown. We design an exploration strategy for players to estimate the optimal arm pulling profile. Since such estimates can be different across different players, it is challenging for players to commit. We then design an iterative distributed algorithm, which guarantees that players can arrive at a consensus on the optimal arm pulling profile in only M rounds. We conduct experiments to validate our algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑