Claims O(M^(1-1/alpha) log T) and O(M log T) regret bounds for multi-agent bandits under heavy-tailed rewards and sparse heavy-tailed communication graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Multi-agent Multi-armed Bandit with Fully Heavy-tailed Dynamics
Claims O(M^(1-1/alpha) log T) and O(M log T) regret bounds for multi-agent bandits under heavy-tailed rewards and sparse heavy-tailed communication graphs.