~/lenguyen$
CV
Chapter 4: Dynamic Programming

Chapter 4: Dynamic Programming

Last reviewedIn progress1 min read
Danger

This article was written with the assistance of Codex, my friend (Codex) will review the grammar and structure of this post. The content will be mine 100%.

The term dynamic programming (DP) refers to a collection of algorithms that can be used to compute optimal policies given a perfect model of the environment (we know exactly how to compute the dynamics p(s,rs,a)p(s', r \mid s, a))

Important

The key idea of DP, and of reinforcement learning generally, is the use of value functions to organize and structure the search for good policies. We evaluate how good a policy π\pi is based on its value function vπv_{\pi}.

/help