Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits
arXiv:2611.04307v1 Announce Type: new Abstract: We study online learning with directed weakly observable feedback graphs and propose a Follow-the-Perturbed-Leader (FTPL) policy that achieves best-of-both-worlds guarantee with nearly linear expected time complexity. To preserve the simple structure…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-11-04 05:00 · arXiv stat.ML
Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits