Research map / Bandits and online learning / Online convex optimization and games
Learning-Augmented Online Covering 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
- Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions (NeurIPS 2022 · similarity 0.89)
- The Primal-Dual method for Learning Augmented Algorithms (NeurIPS 2020 · similarity 0.88)
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.88)
- Discrete-Smoothness in Online Algorithms with Predictions (NeurIPS 2023 · similarity 0.87)
- Learning-Augmented Algorithms for Online Linear and Semidefinite Programming (NeurIPS 2022 · similarity 0.87)
- Learning-Augmented Algorithms for the Bahncard Problem (NeurIPS 2024 · similarity 0.84)
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.