150d0ec51b
This is the third PR of 6 commits mentioned in #274, which features refactor of Collector to fix #245. You can check #274 for more detail. Things changed in this PR: 1. refactor collector to be more cleaner, split AsyncCollector to support asyncvenv; 2. change buffer.add api to add(batch, bffer_ids); add several types of buffer (VectorReplayBuffer, PrioritizedVectorReplayBuffer, etc.) 3. add policy.exploration_noise(act, batch) -> act 4. small change in BasePolicy.compute_*_returns 5. move reward_metric from collector to trainer 6. fix np.asanyarray issue (different version's numpy will result in different output) 7. flake8 maxlength=88 8. polish docs and fix test Co-authored-by: n+e <trinkle23897@gmail.com>
130 lines
4.5 KiB
Python
130 lines
4.5 KiB
Python
import torch
|
|
import numpy as np
|
|
from typing import Any, Dict, List, Union, Optional, Callable
|
|
|
|
from tianshou.policy import BasePolicy
|
|
from tianshou.data import Batch, ReplayBuffer, to_torch_as
|
|
|
|
|
|
class PGPolicy(BasePolicy):
|
|
"""Implementation of Vanilla Policy Gradient.
|
|
|
|
:param torch.nn.Module model: a model following the rules in
|
|
:class:`~tianshou.policy.BasePolicy`. (s -> logits)
|
|
:param torch.optim.Optimizer optim: a torch.optim for optimizing the model.
|
|
:param dist_fn: distribution class for computing the action.
|
|
:type dist_fn: Callable[[], torch.distributions.Distribution]
|
|
:param float discount_factor: in [0, 1].
|
|
|
|
.. seealso::
|
|
|
|
Please refer to :class:`~tianshou.policy.BasePolicy` for more detailed
|
|
explanation.
|
|
"""
|
|
|
|
def __init__(
|
|
self,
|
|
model: Optional[torch.nn.Module],
|
|
optim: torch.optim.Optimizer,
|
|
dist_fn: Callable[[], torch.distributions.Distribution],
|
|
discount_factor: float = 0.99,
|
|
reward_normalization: bool = False,
|
|
**kwargs: Any,
|
|
) -> None:
|
|
super().__init__(**kwargs)
|
|
if model is not None:
|
|
self.model: torch.nn.Module = model
|
|
self.optim = optim
|
|
self.dist_fn = dist_fn
|
|
assert (
|
|
0.0 <= discount_factor <= 1.0
|
|
), "discount factor should be in [0, 1]"
|
|
self._gamma = discount_factor
|
|
self._rew_norm = reward_normalization
|
|
|
|
def process_fn(
|
|
self, batch: Batch, buffer: ReplayBuffer, indice: np.ndarray
|
|
) -> Batch:
|
|
r"""Compute the discounted returns for each frame.
|
|
|
|
.. math::
|
|
G_t = \sum_{i=t}^T \gamma^{i-t}r_i
|
|
|
|
where :math:`T` is the terminal time step, :math:`\gamma` is the
|
|
discount factor, :math:`\gamma \in [0, 1]`.
|
|
"""
|
|
# batch.returns = self._vanilla_returns(batch)
|
|
# batch.returns = self._vectorized_returns(batch)
|
|
return self.compute_episodic_return(
|
|
batch, buffer, indice, gamma=self._gamma,
|
|
gae_lambda=1.0, rew_norm=self._rew_norm)
|
|
|
|
def forward(
|
|
self,
|
|
batch: Batch,
|
|
state: Optional[Union[dict, Batch, np.ndarray]] = None,
|
|
**kwargs: Any,
|
|
) -> Batch:
|
|
"""Compute action over the given batch data.
|
|
|
|
:return: A :class:`~tianshou.data.Batch` which has 4 keys:
|
|
|
|
* ``act`` the action.
|
|
* ``logits`` the network's raw output.
|
|
* ``dist`` the action distribution.
|
|
* ``state`` the hidden state.
|
|
|
|
.. seealso::
|
|
|
|
Please refer to :meth:`~tianshou.policy.BasePolicy.forward` for
|
|
more detailed explanation.
|
|
"""
|
|
logits, h = self.model(batch.obs, state=state, info=batch.info)
|
|
if isinstance(logits, tuple):
|
|
dist = self.dist_fn(*logits)
|
|
else:
|
|
dist = self.dist_fn(logits) # type: ignore
|
|
act = dist.sample()
|
|
return Batch(logits=logits, act=act, state=h, dist=dist)
|
|
|
|
def learn( # type: ignore
|
|
self, batch: Batch, batch_size: int, repeat: int, **kwargs: Any
|
|
) -> Dict[str, List[float]]:
|
|
losses = []
|
|
for _ in range(repeat):
|
|
for b in batch.split(batch_size, merge_last=True):
|
|
self.optim.zero_grad()
|
|
dist = self(b).dist
|
|
a = to_torch_as(b.act, dist.logits)
|
|
r = to_torch_as(b.returns, dist.logits)
|
|
log_prob = dist.log_prob(a).reshape(len(r), -1).transpose(0, 1)
|
|
loss = -(log_prob * r).mean()
|
|
loss.backward()
|
|
self.optim.step()
|
|
losses.append(loss.item())
|
|
return {"loss": losses}
|
|
|
|
# def _vanilla_returns(self, batch):
|
|
# returns = batch.rew[:]
|
|
# last = 0
|
|
# for i in range(len(returns) - 1, -1, -1):
|
|
# if not batch.done[i]:
|
|
# returns[i] += self._gamma * last
|
|
# last = returns[i]
|
|
# return returns
|
|
|
|
# def _vectorized_returns(self, batch):
|
|
# # according to my tests, it is slower than _vanilla_returns
|
|
# # import scipy.signal
|
|
# convolve = np.convolve
|
|
# # convolve = scipy.signal.convolve
|
|
# rew = batch.rew[::-1]
|
|
# batch_size = len(rew)
|
|
# gammas = self._gamma ** np.arange(batch_size)
|
|
# c = convolve(rew, gammas)[:batch_size]
|
|
# T = np.where(batch.done[::-1])[0]
|
|
# d = np.zeros_like(rew)
|
|
# d[T] += c[T] - rew[T]
|
|
# d[T[1:]] -= d[T[:-1]] * self._gamma ** np.diff(T)
|
|
# return (c - convolve(d, gammas)[:batch_size])[::-1]
|