Research map / Bandits and online learning / Online convex optimization and games
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs (NeurIPS 2022 · similarity 0.95)
- Towards Best-of-All-Worlds Online Learning with Feedback Graphs (NeurIPS 2021 · similarity 0.94)
- Adversarial Combinatorial Semi-bandits with Graph Feedback (ICML 2025 · similarity 0.91)
- Stochastic contextual bandits with graph feedback: from independence number to MAS number (NeurIPS 2024 · similarity 0.90)
- Efficient Contextual Bandits with Uninformed Feedback Graphs (ICML 2024 · similarity 0.90)
- Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback (NeurIPS 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.