Research map / Bandits and online learning / Online convex optimization and games
Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
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.94)
- An Equivalence Between Static and Dynamic Regret Minimization (NeurIPS 2024 · similarity 0.93)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.93)
- On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning (ICML 2025 · similarity 0.92)
- Non-stationary Online Convex Optimization with Arbitrary Delays (ICML 2024 · similarity 0.90)
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.90)
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.