2 papers
cs.LG2026
A Near-optimal, Scalable and Parallelizable Framework for Stochastic Bandits Robust to Adversarial Corruptions and Beyond
Zicheng Hu, Cheng Chen
We investigate various stochastic bandit problems in the presence of adversarial corruptions. A seminal work for this problem is the BARBAR~\cite{gupta2019better} algorithm, which…
cs.LG2025
Robust Decentralized Multi-armed Bandits: From Corruption-Resilience to Byzantine-Resilience
Zicheng Hu, Yuchen Wang, Cheng Chen
Decentralized cooperative multi-agent multi-armed bandits (DeCMA2B) considers how multiple agents collaborate in a decentralized multi-armed bandit setting. Though this problem has…