Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with policy-evaluation
Search options answers only
not deleted
user 36922
For questions related to the various policy evaluation (PE) algorithms, which are numerical iterative algorithms that are used to find the value function associated with a given policy, which is often denoted as the "prediction problem". PE is also considered a dynamic programming method, which is regularly discussed in reinforcement learning textbooks.
1
vote
Why can the Bellman equation be turned into an update rule?
To me, Bellman update is simply supervised learning: right hand side (bootstrap) is a sample of the left hand side (conditional expectation).. The Bellman equation simply explains that the right hand …
- 151