Research map / Bandits and online learning / Online convex optimization and games
Nearly Optimal Best-of-Both-Worlds Algorithms 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
- A Near-Optimal Best-of-Both-Worlds Algorithm 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.92)
- Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback (ICML 2022 · similarity 0.92)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.89)
- Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback (NeurIPS 2025 · similarity 0.88)
- A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds (NeurIPS 2024 · similarity 0.87)
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.