Research map / Learning theory and algorithms / Sample complexity
On the Sample Complexity of Stabilizing LTI Systems on a Single Trajectory
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 only the unstable subspace instead of recovering the full dynamics | LTS₀ for noiseless LTI systems on a single trajectory · Learn-to-stabilize | sample complexity: O(k) samples versus linear in n | Helped |
| Use τ-hop control, injecting inputs every τ steps so stable components decay between injections | LTS₀ · Noiseless LTI systems, general case | stability | Helped |
| Use the symmetric-system specialization with τ = 1 and ω = 0 | LTS₀ for symmetric A · Noiseless LTI systems, symmetric A | sample complexity | Helped |
Closest papers by meaning
- Stabilizing LTI Systems under Partial Observability: Sample Complexity and Fundamental Limits (NeurIPS 2025 · similarity 0.91)
- A Memory Efficient Unified Algorithm for Online Learning of Linear Dynamical Systems (NeurIPS 2026 · similarity 0.88)
- Stabilizing Dynamical Systems via Policy Gradient Methods (NeurIPS 2021 · similarity 0.87)
- Finite Sample Analyses for Continuous-time Linear Systems: System Identification and Online Control (NeurIPS 2025 · similarity 0.85)
- Performative Control for Linear Dynamical Systems (NeurIPS 2024 · similarity 0.84)
- From Cursed to Competitive: Closing the ZO–FO Gap via Input-to-State Stability (NeurIPS 2026 · similarity 0.84)
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.