Research map / Bandits and online learning / Online convex optimization and games
A Universal Error Measure for Input Predictions Applied to Online Graph Problems
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
- Learning-Augmented Algorithms for Online Steiner Tree (AAAI 2022 · similarity 0.90)
- Learning from a Sample in Online Algorithms (NeurIPS 2022 · similarity 0.86)
- Online Prediction of Switching Graph Labelings with Cluster Specialists (NeurIPS 2019 · similarity 0.86)
- Improved Approximations for Hard Graph Problems using Predictions (ICML 2025 · similarity 0.85)
- Efficient Contextual Bandits with Uninformed Feedback Graphs (ICML 2024 · similarity 0.83)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.82)
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.