On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems (Q5169662): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161950876 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:14, 19 March 2024
scientific article; zbMATH DE number 6316326
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems |
scientific article; zbMATH DE number 6316326 |
Statements
On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems (English)
0 references
11 July 2014
0 references
Markov decision processes
0 references
Q-learning
0 references
stochastic approximation
0 references
dynamic programming
0 references
reinforcement learning
0 references
