Sample complexity of the linear quadratic regulator: a reinforcement learning lens
From MaRDI portal
Cites work
- Adaptive control of linear time invariant systems: the ``Bet on the best principle
- Adaptive estimation of a quadratic functional by model selection.
- Adaptive Linear Quadratic Gaussian Control: The Cost-Biased Approach Revisited
- An introduction to matrix concentration inequalities
- Convergence and Sample Complexity of Gradient Methods for the Model-Free Linear–Quadratic Regulator Problem
- Derivative-free methods for policy optimization: guarantees for linear quadratic systems
- Estimation of the mean of a multivariate normal distribution
- scientific article; zbMATH DE number 3181381 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 3256013 (Why is no real title available?)
- Identification and adaptive control for systems with unknown orders, delay, and coefficients
- Least squares estimates in stochastic regression models with applications to identification and control of dynamic systems
- On a conjecture by LeVeque and Trefethen related to the Kreiss matrix theorem
- On the resolvent condition in the Kreiss matrix theorem
- On the sample complexity of the linear quadratic regulator
- Optimal Adaptive Control and Consistent Parameter Estimates for ARMAX Model with Quadratic Cost
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Stability Analysis of Discrete-Time Infinite-Horizon Optimal Control With Discounted Cost
This page was built for publication: Sample complexity of the linear quadratic regulator: a reinforcement learning lens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887401)
