Sublinear regret for a class of continuous-time linear-quadratic reinforcement learning problems (Q6925757)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8097595
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear regret for a class of continuous-time linear-quadratic reinforcement learning problems |
scientific article; zbMATH DE number 8097595 |
Statements
Sublinear regret for a class of continuous-time linear-quadratic reinforcement learning problems (English)
0 references
25 September 2025
0 references
continuous-time reinforcement learning
0 references
stochastic linear-quadratic control
0 references
model-free policy gradient
0 references
regret bounds
0 references
exploration scheduling
0 references
reinforcement learning algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
