Research map / Bandits and online learning / Online convex optimization and games
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
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
- Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis (NeurIPS 2019 · similarity 0.92)
- Online Linear Quadratic Control (ICML 2018 · similarity 0.91)
- Logarithmic Regret for Online Control (NeurIPS 2019 · similarity 0.91)
- Geometric Exploration for Online Control (NeurIPS 2020 · similarity 0.91)
- Making Non-Stochastic Control (Almost) as Easy as Stochastic (NeurIPS 2020 · similarity 0.91)
- Optimal Algorithms for Online Convex Optimization with Adversarial Constraints (NeurIPS 2024 · similarity 0.89)
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.