arXiv (All)
open access
Controller Identifiability: The Boundary Between Logarithmic and Square-Root Local Minimax Regret in Structured Adaptive LQR
We study when logarithmic regret is attainable in structured adaptive linear-quadratic regulation. The state and input matrices depend affinely on a common unknown parameter. We consider neighborhoods of a known nominal model that is stabilizable and observable through the output associated with the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Critical Minimax Laws and No-Learning Thresholds in Continuous-Time Adaptive Control#1117866
- Generalizable Optimal Control with Transformers: One Policy Across Diverse Systems#1036647
- Square Root Gauss-Newton iLQR#1035023
- Riemannian Density-Driven Optimal Control: Tangent-Space LQR for Second-Order Multi-Agent Systems on Curved Manifolds#1037361
- Optimality of Affine Policies in Distributionally Robust Linear-Quadratic Control with Temporally Correlated Noise#1064197
Record · ID 1132264
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive