Near-optimal first-order regret for bandits with feedback graphs
Read the original at arxiv.org→arXiv:2610.40861v1 Announce Type: new Abstract: We study first-order regret guarantees for adversarial bandits with a fixed, known directed feedback graph. For strongly observable graphs, [ACBDK15] establishes a...
Original headline: "Near-Optimal First-Order Regret for Bandits with Feedback Graphs"
Coverage timeline
- Nov 2, 05:00 UTC arXiv cs.LG lead source Near-Optimal First-Order Regret for Bandits with Feedback Graphs