Research map / Bandits and online learning / Online convex optimization and games
Learning-Augmented Online Minimization with Dual 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
- The Primal-Dual method for Learning Augmented Algorithms (NeurIPS 2020 · similarity 0.90)
- A Regression Approach to Learning-Augmented Online Algorithms (NeurIPS 2021 · similarity 0.89)
- A Learning-Augmented Approach to Online Allocation Problems (NeurIPS 2025 · similarity 0.88)
- Learning-Augmented Algorithms for Online Linear and Semidefinite Programming (NeurIPS 2022 · similarity 0.88)
- Constrained Online Convex Optimization with Memory and Predictions (AAAI 2026 · similarity 0.88)
- Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness (NeurIPS 2025 · 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.