Know a great AI tool or AI news source? Submit it to AiByts
2 min read

Near-Optimal First-Order Regret for Bandits with Feedback Graphs

We study first-order regret guarantees for adversarial bandits with a fixed, known directed feedback graph. For strongly observable graphs, [ACBDK15] establishes a minimax regret of $\widetilde{\Theta}(\sqrt{\alpha T})$, where $\alpha$ denotes the independence number of the graph and $T$ denotes…

By Mengxiao Zhang, Yuheng Zhang, Haipeng Luo, Paul MineiroarXiv cs.LG

Read the full story

Originally published by arXiv cs.LG on Nov 2, 2026.

Read on arXiv cs.LG(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.