Research map / Bandits and online learning / Online convex optimization and games
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality
Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
Read the paperCheck your idea against 137,217 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
- Learning on the Edge: Online Learning with Stochastic Feedback Graphs (NeurIPS 2022 · similarity 0.93)
- Online Learning with Dependent Stochastic Feedback Graphs (ICML 2020 · similarity 0.93)
- A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs (NeurIPS 2022 · similarity 0.93)
- Towards Best-of-All-Worlds Online Learning with Feedback Graphs (NeurIPS 2021 · similarity 0.92)
- Stochastic contextual bandits with graph feedback: from independence number to MAS number (NeurIPS 2024 · similarity 0.89)
- 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.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.
