# Temporal difference learning

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
34,191pages on
this wiki

Temporal difference learning is a prediction method. It has been mostly used for solving the reinforcement learning problem. "TD learning is a combination of Monte Carlo ideas and dynamic programming (DP) ideas." [2] TD resembles a Monte Carlo method because it learns by sampling the environment according to some policy. TD is related to dynamic programming techniques because it approximates its current estimate based on previously learned estimates (a process known as bootstrapping). The TD learning algorithm is related to the Temporal difference model of animal learning.

As a prediction method, TD learning takes into account the fact that subsequent predictions are often correlated in some sense. In standard supervised predictive learning, one only learns from actually observed values: A prediction is made, and when the observation is available, the prediction is adjusted to better match the observation. The core idea, as elucidated in [1], of TD learning is that we adjust predictions to match other, more accurate predictions, about the feature. This procedure is a form of bootstrapping as illustrated with the following example (taken from [1]):

Suppose you wish to predict the weather for Saturday and that you have some model that predicts Saturday's weather given the weather of each day in the week. In the standard case, you would wait until Saturday and then adjust all your models. However, when it is, for example Friday, you should have a pretty good idea of what the weather would be on Saturday - and thus be able to change, say, Monday's model before Saturday arrives.

Mathematically speaking, both in a standard and a TD approach, we would try to optimise some cost function, related to the error in our predictions of the expectation of some random variable, E[z]. However, while in the standard approach we in some sense assume E[z]=z (the actual observed value), in the TD approach we use a model. For the particular case of reinforcement learning, which is the major application of TD methods, z is the total return and E[z] is given by the Bellman equation of the return.

## TD algorithm in neuroscience Edit

The TD algorithm has also received attention in the field of Neuroscience. Researchers discovered that the firing rate of dopamine neurons in the ventral tegmental area (VTA) and substantia nigra (SNc) appear to mimic the error function in the algorithm [3]. The error function reports back the difference between the estimated reward at any given state or time step and the actual reward received. The larger the error function the larger the difference between the expected and actual reward. When this is paired with a stimulus that accurately reflects a future reward the error can be used to associate the stimulus with the future reward.

Dopamine cells appear to behave in a similar manner. In one experiment measurements of dopamine cells were made while training a monkey to associate a stimulus with the reward of juice [4]. Initially the dopamine cells increased firing rates when exposed to the juice, indicating a difference in expected and actual rewards. Over time this increase in firing back propagated to the earliest reliable stimulus for the reward. Once the monkey was fully trained the dopamine cells stopped firing. This mimics closely how the error function in TD is used for reinforcement learning.

The relationship between the model and potential neurological function has produced research attempting to use TD to explain many aspects of behavioral research [5]. It has also been used to study conditions such as schizophrenia or the consequences of pharmacological manipulations of dopamine on learning [6].

## Math Edit

This banner appears on articles that are weak and whose contents should be approached with academic caution
.

Let $\lambda_t$ be the reinforcement on time step t. Let $\bar V_t$ be the correct prediction that is equal to discounted sum of all future reinforcement. The discounting is done by powers of factor of $\gamma$ such that reinforcement at distant time step is less important.

$\bar V_t = \sum_{i=0}^{\infty} \gamma^i \lambda_{t+i}$
$0 \le \gamma < 1$

This formula can be expanded

$\bar V_t = \lambda_{t} + \sum_{i=1}^{\infty} \gamma^i \lambda_{t+i}$

by changing the index of i to start from 0.

$\bar V_t = \lambda_{t} + \sum_{i=0}^{\infty} \gamma^{i+1} \lambda_{t+i+1}$
$\bar V_t = \lambda_{t} + \gamma \sum_{i=0}^{\infty} \gamma^i \lambda_{t+1+i}$
$\bar V_t = \lambda_{t} + \gamma \bar V_{t+1}$

Thus, the reinforcement is the difference between the ideal prediction and the current prediction.

$\lambda_{t} = \bar V_{t} - \gamma \bar V_{t+1}$

TD-Lambda is a learning algorithm invented by Richard Sutton based on earlier work on temporal difference learning by Arthur Samuel [2]. This algorithm was famously applied by Gerald Tesauro to create TD-Gammon, a program that can learn to play the game of backgammon nearly as good as expert human players. The lambda (λ) parameter here refers to the trace decay parameter, with 0 < λ < 1. Higher settings lead to longer lasting traces; that is, a larger proportion of credit from a reward can be given to more distal states and actions when λ is higher, with λ=1 producing parallel learning to Monte Carlo RL algorithms.