Research map / Bandits and online learning / Online convex optimization and games
Logarithmic Regret Bound in Partially Observable Linear Dynamical Systems
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 Control of Unknown Time-Varying Dynamical Systems (NeurIPS 2021 · similarity 0.90)
- Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with $\sqrt$T Regret (ICML 2021 · similarity 0.90)
- Naive Exploration is Optimal for Online LQR (ICML 2020 · similarity 0.89)
- Finite Sample Analyses for Continuous-time Linear Systems: System Identification and Online Control (NeurIPS 2025 · similarity 0.89)
- Online Control with Adversarial Disturbance for Continuous-time Linear Systems (NeurIPS 2024 · similarity 0.87)
- Regret Bounds for Episodic Risk-Sensitive Linear Quadratic Regulator (ICLR 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.