Research map / Bandits and online learning / Online convex optimization and games
Dying Experts: Efficient Algorithms with Optimal Regret Bounds
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
- Online Learning with Sleeping Experts and Feedback Graphs (ICML 2019 · similarity 0.91)
- When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses (NeurIPS 2025 · similarity 0.87)
- Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making (NeurIPS 2025 · similarity 0.86)
- Bandits with Abstention under Expert Advice (NeurIPS 2024 · similarity 0.86)
- Managing Self-Learning Experts under Per-Round Budget Constraints (NeurIPS 2026 · similarity 0.86)
- From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model (NeurIPS 2026 · similarity 0.86)
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.