Q-function Recursion
Q-Function Recursion is a recursive formulation in reinforcement learning that belongs to the class of value functions, specifically distinguished by its definition of the expected cumulative reward for taking a particular action in a given state and thereafter following a fixed policy, with subsequent values computed through iterative application of the Bellman optimality or expectation operator applied to action-value pairs.
7
Publications
491
Citations
7
Authors
3
Institutions
Publications per year
2017–2026
0
Parents
7
1–5 of 7
7
2
h-index
2
h-index
1
h-index
1 publications · 58 citations
1
h-index
1
h-index
1–5 of 7
3 publications · 126 citations
3
h-index
JAIR · 1 publications · 247 citations
1
h-index
Repository · 1 publications · 39 citations
1
h-index
1 publications · 54 citations
1
h-index
1–4