Research map / Bandits and online learning / Online convex optimization and games
Leveraging Predictions in Smoothed Online Convex Optimization via Gradient-based Algorithms
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
- Dynamic Regret in Online Convex Optimization with Indicator Switching Costs (NeurIPS 2026 · similarity 0.88)
- Exploiting Curvature in Online Convex Optimization with Delayed Feedback (ICML 2025 · similarity 0.87)
- Non-stationary Online Convex Optimization with Arbitrary Delays (ICML 2024 · similarity 0.87)
- Predictive Linear Online Tracking for Unknown Targets (ICML 2024 · similarity 0.87)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.86)
- 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.