Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem
Model-free reinforcement learning attempts to find an optimal control action for an unknown dynamical system by directly searching over the parameter space of controllers. The convergence behavior and statistical properties of these approaches are often poorly understood because of the nonconvex nature of the underlying optimization problems and the lack of exact gradient computation... (read more)
PDFTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
Methods used in the Paper
| METHOD | TYPE | |
|---|---|---|
Random Search
|
Hyperparameter Search |