Research map / Bandits and online learning / Online convex optimization and games
Naive Exploration is Optimal for Online LQR
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use of continual epsilon-greedy certainty equivalence with doubling epochs (Algorithm 1) | online LQR · stabilizable LQR instances | regret dimension dependence | Helped |
| Doubling-epoch re-estimation exploiting persistent noise, versus no re-estimation | certainty equivalent control · online LQR | regret d_x^2 log T term | No clear effect |
| Self-bounding ODE perturbation bound removes controllability requirement | certainty equivalent controller analysis · stabilizable LQR instances | applicability of regret bound | Helped |
Closest papers by meaning
- Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator (NeurIPS 2018 · similarity 0.92)
- Online Control of Unknown Time-Varying Dynamical Systems (NeurIPS 2021 · similarity 0.92)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 2025 · similarity 0.92)
- Making Non-Stochastic Control (Almost) as Easy as Stochastic (NeurIPS 2020 · similarity 0.91)
- Finite Time Logarithmic Regret Bounds for Self-Tuning Regulation (ICML 2024 · similarity 0.89)
- Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound (NeurIPS 2025 · similarity 0.88)
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.