New Paper Establishes Near-Optimal First-Order Regret for Bandits with Feedback Graphs
A new arXiv paper studies first-order regret guarantees for adversarial bandits with a fixed, known directed feedback graph, addressing strongly observable graphs.
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-11-02 05:00 · arXiv cs.LG
Near-Optimal First-Order Regret for Bandits with Feedback Graphs