April 2021
Intermediate to advanced
394 pages
10h 11m
English
In the previous chapter, we looked at dynamic programming where we knew the model dynamics p(s’, r| s, a), and this knowledge was used to “plan” the optimal actions. This is also known as the planning problem . In this chapter, we will shift our focus and look at learning problems , i.e., a setup where the model dynamics are not known. We will learn value and action-value functions by sampling, i.e., collecting experience by following some policy in the real world or by running the agent through a policy in simulation. There is another class of problems where we find the model-free ...
Read now
Unlock full access