# True Online TD$(\lambda)$

14 Sep 2014This post contains a summary of the paper titled “True Online TD$(\lambda)$” appearing in ICML 2014.

## Classical TD$(\lambda)$

TD$(\lambda)$ is a core model-free algorithm in reinforcement learning for estimating a value function. Let be the estimated value at time $t$ of state $S_{t}$. Often a stochastic gradient descent-like update of the following form is used where $\theta$ is the parameter of $\hat{v}$ to estimate, $U_{t}$ denotes an update target, and is the derivative of $\hat{v}$ with respect to $\theta_{t}$. By definition, the value of a state $s$ is the total expected sum of discounted future rewards starting from state $s$. In math, A sensible and unbiased estimate for this expectation is given by an observed trajectory of rewards starting from state $s$. This choice of update target is called Monte Carlo update. Note that it cannot be used online since the target depends on the future. So one has to wait until the end of an episode first. Then, come back and update each time step.

A popular update target $U_{t}$ meant to be an online version of Monte Carlo update is given by TD$(0)$ which comes from the fact that

TD(0) approximates the quantity with one realization of the term in the expectation. That is, This update can be used online as it depends only the reward of one time step ahead of current time $t$. Now of course one can follow the same trick by doing

and use $U_{t}=R_{t+1}+\gamma R_{t+2}+\gamma^{2}v(S_{t+2})$. This target is called a 2-step return. The previous TD(0) target is called 1-step return. From this, one can obviously define an $n$-step return from time $t$ as where we will assume that $\hat{v}(S_{t})=\theta^{\top}\phi(S_{t})$ for basis function $\phi$ and $\phi_{t}:=\phi(S_{t})$. This leads to the question: “Which $n$ do we use ?”. One answer is that we use all of them by geometrically weighting all $n$-returns. This combined returns are referred to as $\lambda$-return where $\lambda\in[0,1]$. If $\lambda=0$, giving back TD(0) update target. If $\lambda=1$, the $\lambda$-return is equivalent to Monto Carlo update target. Hence, $\lambda$-return provides a smooth blend between TD(0) and Monte Carlo update parametrized by $\lambda$.

## Forward and Backward TD$(\lambda)$

Updating $\theta$ with is referred to as forward-view TD$(\lambda)$ which is not online since, like Monte Carlo update, $L_{\theta}^{\lambda}$ depends on the rewards in the future. Interestingly, an equivalent way to update $\theta$ in an online way using $L_{\theta}^{\lambda}$ exists. This is called backward-view TD$(\lambda)$,

where is called eligibility traces containing footprints of recently visited states and . Instead of updating toward weighted by some quantity, here we update towards which accumulates many visited states in the past, weighted down exponentially by $\gamma\lambda$. Essentially if the agent is highly rewarded in a state $s’$, not only the preceding state $s$ leading to $s’$ that is credited, but all previous states leading to $s$ are also given credits (although exponentially less because of $\gamma\lambda$ factor). The following is a well-known result.

**Theorem.** The sum of offline updates is identical for
forward-view and backward-view TD$(\lambda)$
where $T$ is the last time step in the episode.

Although interesting, the two views are not equivalent for online updates (only approximatedly equal).

## Idea of the paper

The paper proposes a $\lambda$-return called truncated $\lambda$-return which is basically like the classical $\lambda$-return except that it is truncated at the current time step. This gives rise to a new forward-view and backward-view TD$(\lambda)$ which they call true online TD$(\lambda)$. It is called so because of the following theorem given in the paper.

**Theorem.** $\theta_{t}$ from backward update is exactly equal to
$\theta_{t,t}$ from forward update for all $t$.

The new backward-view update equations are