3 ms·
You have n decisions to make - this is your policy. After you make one, if your remaining n-1 decisions also optimal, then you have optimal policy.
by kikimora 2mo ago
You have n decisions to make - this is your policy. After you make one, if your remaining n-1 decisions also optimal, then you have optimal policy.
- LoganDark 2mo agoSo, an optimal policy is basically one that does not put you into a suboptimal position?
- kikimora 2mo agoYou can say it this way. Other way to put is optimal policy makes optimal decisions on every step as if it knows the future. If you looking for shortest distance in a graph then at every vertex it picks the right step, even if the edge is longer than other available in the vertex, as if it knows the future. This is why you cannot just build an algo implementing the policy, you have to find it with dynamic programming.
- jazzypants 2mo agoThere's got to be a better way of saying this. "A policy is good if it keeps being good after the first time you use it" is the gist that I'm getting, but that's way too simplistic to actually tell you any of the value of dynamic programming.