Research map / Bandits and online learning / Online convex optimization and games
Optimal Dynamic Regret in LQR 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
- Making Non-Stochastic Control (Almost) as Easy as Stochastic (NeurIPS 2020 · similarity 0.92)
- Optimal Rates for Bandit Nonstochastic Control (NeurIPS 2023 · similarity 0.90)
- Naive Exploration is Optimal for Online LQR (ICML 2020 · similarity 0.90)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 2025 · similarity 0.88)
- Handling Heterogeneous Curvatures in Bandit LQR Control (ICML 2024 · similarity 0.87)
- Infinite-Horizon Distributionally Robust Regret-Optimal Control (ICML 2024 · similarity 0.87)
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.