#

Generalized Advantage Estimation (GAE)

This is a PyTorch implementation of paper Generalized Advantage Estimation.

You can find an experiment that uses it here.

15import numpy as np

#

18class GAE:

#

19    def __init__(self, n_workers: int, worker_steps: int, gamma: float, lambda_: float):
20        self.lambda_ = lambda_
21        self.gamma = gamma
22        self.worker_steps = worker_steps
23        self.n_workers = n_workers

#

Calculate advantages

\hat{A_{t}^{(1)}} \hat{A_{t}^{(2)}} ... \hat{A_{t}^{(\infty)}} = r_{t} + γ V (s_{t + 1}) - V (s) = r_{t} + γ r_{t + 1} + γ^{2} V (s_{t + 2}) - V (s) = r_{t} + γ r_{t + 1} + γ^{2} r_{t + 2} + ... - V (s)

$\hat{A_{t}^{(1)}}$ is high bias, low variance, whilst $\hat{A_{t}^{(\infty)}}$ is unbiased, high variance.

We take a weighted average of $\hat{A_{t}^{(k)}}$ to balance bias and variance. This is called Generalized Advantage Estimation. $\hat{A_{t}} = \hat{A_{t}^{G A E}} = \frac{\sum _{k} w _{k} A _{t}^{(k)} ^}{\sum _{k} w _{k}}$ We set $w_{k} = λ^{k - 1}$ , this gives clean calculation for $\hat{A_{t}}$

δ_{t} \hat{A_{t}} = r_{t} + γ V (s_{t + 1}) - V (s_{t}) = δ_{t} + γλ δ_{t + 1} + ... + (γλ)^{T - t + 1} δ_{T - 1} = δ_{t} + γλ \hat{A_{t + 1}}

25    def __call__(self, done: np.ndarray, rewards: np.ndarray, values: np.ndarray) -> np.ndarray:

#

advantages table

59        advantages = np.zeros((self.n_workers, self.worker_steps), dtype=np.float32)
60        last_advantage = 0

#

$V (s_{t + 1})$

63        last_value = values[:, -1]
64
65        for t in reversed(range(self.worker_steps)):

#

mask if episode completed after step $t$

67            mask = 1.0 - done[:, t]
68            last_value = last_value * mask
69            last_advantage = last_advantage * mask

#

$δ_{t}$

71            delta = rewards[:, t] + self.gamma * last_value - values[:, t]

#

$\hat{A_{t}} = δ_{t} + γλ \hat{A_{t + 1}}$

74            last_advantage = delta + self.gamma * self.lambda_ * last_advantage

#

77            advantages[:, t] = last_advantage
78
79            last_value = values[:, t]

#

$\hat{A_{t}}$

82        return advantages