Research map / Bandits and online learning / Online convex optimization and games
Online Learning with Sleeping Experts and 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace UCB-style baselines with UCB-ABS (feedback graph + sleeping experts for abstention) | online learning with abstention · eight UCI/CIFAR abstention datasets | averaged abstention loss | Helped |
| Use UCB-ABS instead of FS (full-information comparator) | online learning with abstention · eye, HIGGS, skin, covtype | averaged abstention loss | Mixed |
Closest papers by meaning
- Dying Experts: Efficient Algorithms with Optimal Regret Bounds (NeurIPS 2019 · similarity 0.91)
- Regret Minimization With a Crowd of Awakening Experts (ICML 2026 · similarity 0.89)
- Online Learning with Transductive Regret (NeurIPS 2017 · similarity 0.88)
- Efficient Contextual Bandits with Uninformed Feedback Graphs (ICML 2024 · similarity 0.85)
- 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.85)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.85)
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.