3 citations · 4 across the 8 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.LG2025
Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks
Jingyuan Liu, Hao Qiu, Lin Yang +1
We study the distributed multi-agent multi-armed bandit problem with heterogeneous rewards over random communication graphs. Uniquely, at each time step agents communicate over…
cs.LG2025
On the optimal regret of collaborative personalized linear bandits
Bruce Huang, Ruida Zhou, Lin F. Yang +1
Stochastic linear bandits are a fundamental model for sequential decision making, where an agent selects a vector-valued action and receives a noisy reward with expected value give…
cs.LG2025★ 3 cited
Does Feedback Help in Bandits with Arm Erasures?
Merve Karakas, Osama Hanna, Lin F. Yang +1
We study a distributed multi-armed bandit (MAB) problem over arm erasure channels, motivated by the increasing adoption of MAB algorithms over communication-constrained networks. I…