Research map / Bandits and online learning / Online convex optimization and games
Logarithmic Regret for Learning Linear Quadratic Regulators Efficiently
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 |
|---|---|---|---|
| Learn A⋆ while B⋆ is known | LQR · LQR with known B⋆ and unknown A⋆ | expected regret: O(√T) -> O(log² T) | Helped |
| Learn B⋆ with known A⋆ and require K⋆K⋆ᵀ ⪰ μ⋆I | LQR · LQR with known A⋆ and non-degenerate K⋆ | expected regret: O(√T) -> O(log² T) | Helped |
| Allow the optimal policy to be degenerate when B⋆ is unknown | LQR with known A⋆ · Scalar LQR | expected regret: Ω(σ² √T) | Hurt |
Closest papers by meaning
- Learning Linear-Quadratic Regulators Efficiently with only $\sqrtT$ Regret (ICML 2019 · similarity 0.95)
- Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with $\sqrt$T Regret (ICML 2021 · similarity 0.92)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 2025 · similarity 0.90)
- Finite Time Logarithmic Regret Bounds for Self-Tuning Regulation (ICML 2024 · similarity 0.88)
- Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound (NeurIPS 2025 · similarity 0.87)
- Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control (AAAI 2025 · 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.