Research map / Bandits and online learning / Online convex optimization and games
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions
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
- Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms (NeurIPS 2020 · similarity 0.92)
- Parsimonious Learning-Augmented Caching (ICML 2022 · similarity 0.91)
- Learning-Augmented Algorithms with Explicit Predictors (NeurIPS 2024 · similarity 0.89)
- Algorithms for Caching and MTS with reduced number of predictions (ICLR 2024 · similarity 0.88)
- Online Algorithms with Uncertainty-Quantified Predictions (ICML 2024 · similarity 0.88)
- Learning Augmented Exact Exponential Algorithms (NeurIPS 2026 · 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.