1 citations · 1 across the 3 of their papers we have counts for
4 papers
Regret-Minimization Algorithms for Multi-Agent Cooperative Learning Systems
Jialin Yi
A Multi-Agent Cooperative Learning (MACL) system is an artificial intelligence (AI) system where multiple learning agents work together to complete a common task. Recent empirical…
Doubly Adversarial Federated Bandits
Jialin Yi, Milan Vojnović
We study a new non-stochastic federated multi-armed bandit problem with multiple agents collaborating via a communication network. The losses of the arms are assigned by an oblivio…
On Regret-optimal Cooperative Nonstochastic Multi-armed Bandits
Jialin Yi, Milan Vojnović
We consider the nonstochastic multi-agent multi-armed bandit problem with agents collaborating via a communication network with delays. We show a lower bound for individual regret…
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…