> For the complete documentation index, see [llms.txt](https://hitchhikerguide.gitbook.io/reinforcement-learning/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://hitchhikerguide.gitbook.io/reinforcement-learning/model-free-learning-estimate-the-value-function-of-an-unknown-mdp.md). # Model free Learning - Estimate the value function of an unknown MDP Topics: 1. Monte Carlo 2. Temporal-Difference Learning 3. TD(lamda) \ Assumptions: * Policy is given * Dynamics of the environment (transition probability and reward function is unknown) \ Goal is find out how good are the states under policy pi. (EVALUATION)\ Monte Carlo methods are ways of solving the reinforcement learning problem based on averaging sample returns

You only increment the counter once in each Episode - In Every time step you can keep on incrementing it


\
### Temporal-Difference Learning \ If one had to identify one idea as central and novel to reinforcement learning, it would undoubtedly be temporal-difference (TD) learning. TD learning is a combination of Monte Carlo ideas and dynamic programming (DP) ideas. Like Monte Carlo methods, TD methods can learn directly from raw experience without a model of the environment’s dynamics. Like DP, TD methods update estimates based in part on other learned estimates, without waiting for a final outcome (they bootstrap). The relationship between TD, DP, and Monte Carlo methods is a recurring theme in the theory of reinforcement learning\ \

difference between the value we got(TD target) after we took a step and what we had estimated perviously (difference of estimate before and after taking a step is the TD error)


In Monte Carlo we have to wait till the end to do the updates whereas in TD we can do it at each step



TD(λ) algorithm: