Phasic Policy Gradient (PPG)

Overview

PPG is a DRL algorithm that separates policy and value function training by introducing an auxiliary phase. The training proceeds by running PPO during the policy phase, saving all the experience in a replay buffer. Then the replay buffer is used to train the value function. This makes the algorithm considerably slower than PPO, but improves sample efficiency on Procgen benchmark.

Original paper:

• Phasic Policy Gradient

Reference resources:

• Code for the paper "Phasic Policy Gradient" - by original authors from OpenAI

The original code has multiple code level details that are not mentioned in the paper. We found these changes to be important for reproducing the results claimed by the paper.

Implemented Variants

Variants Implemented	Description
ppg_procgen.py, docs	For classic control tasks like CartPole-v1.

Below are our single-file implementations of PPG:

ppg_procgen.py

ppg_procgen.py works with the Procgen benchmark, which uses 64x64 RGB image observations, and discrete actions

Usage

poetry install -E procgen
python cleanrl/ppg_procgen.py --help
python cleanrl/ppg_procgen.py --env-id "bigfish"

Explanation of the logged metrics

Running python cleanrl/ppg_procgen.py will automatically record various metrics such as actor or value losses in Tensorboard. Below is the documentation for these metrics:

Same as PPO:

• charts/episodic_return: episodic return of the game
• charts/episodic_length: episodic length of the game
• charts/SPS: number of steps per second (this is initially high but drops off after the auxiliary phase)
• charts/learning_rate: the current learning rate (annealing is not done by default)
• losses/value_loss: the mean value loss across all data points
• losses/policy_loss: the mean policy loss across all data points
• losses/entropy: the mean entropy value across all data points
• losses/old_approx_kl: the approximate Kullback–Leibler divergence, measured by (-logratio).mean(), which corresponds to the k1 estimator in John Schulman’s blog post on approximating KL
• losses/approx_kl: better alternative to olad_approx_kl measured by (logratio.exp() - 1) - logratio, which corresponds to the k3 estimator in approximating KL
• losses/clipfrac: the fraction of the training data that triggered the clipped objective
• losses/explained_variance: the explained variance for the value function

PPG specific:

• losses/aux/kl_loss: the mean value of the KL divergence when distilling the latest policy during the auxiliary phase.
• losses/aux/aux_value_loss: the mean value loss on the auxiliary value head
• losses/aux/real_value_loss: the mean value loss on the detached value head used to calculate the GAE returns during policy phase

Implementation details

ppg_procgen.py includes the level implementation details that are different from PPO:

1. Full rollout sampling during auxiliary phase - ( phasic_policy_gradient/ppg.py#L173) - Instead of randomly sampling observations over the entire auxiliary buffer, PPG samples full rullouts from the buffer (Sets of 256 steps). This full rollout sampling is only done during the auxiliary phase. Note that the rollouts will still be at random starting points because PPO truncates the rollouts per env. This change gives a decent performance boost.

2. Batch level advantage normalization - PPG normalizes the full batch of advantage values before PPO updates instead of advantage normalization on each minibatch. ( phasic_policy_gradient/ppo.py#L70)

3. Normalized network initialization - ( phasic_policy_gradient/impala_cnn.py#L64) - PPG uses normalized initialization for all layers, with different scales.

   • Original PPO used orthogonal initialization of only the Policy head and Value heads with scale of 0.01 and 1. respectively.
   • For PPG
     • All weights are initialized with the default torch initialization (Kaiming Uniform)
     • Each layer’s weights are divided by the L2 norm of the weights such that the weights of input_channels axis are individually normalized (axis 1 for linear layers and 1,2,3 for convolutional layers). Then the weights are multiplied by a scale factor.
     • Scale factors for different layers
       • Value head, Policy head, Auxiliary value head - 0.1
       • Fully connected layer after last conv later - 1.4
       • Convolutional layers - Approximately 0.638
4. The Adam Optimizer's Epsilon Parameter -( phasic_policy_gradient/ppg.py#L239) - Set to torch default of 1e-8 instead of 1e-5 which is used in PPO.

Here are some additional notes:

• All the default hyperparameters from the original PPG implementation are used. Except setting 64 for the number of environments.
• The original PPG paper does not report results on easy environments, hence more hyperparameter tuning can give better results.
• Skipping every alternate auxiliary phase gives similar performance on easy environments while saving compute.
• Normalized network initialization scheme seems to matter a lot, but using layernorm with orthogonal initialization also works.
• Using mixed precision for auxiliary phase also works well to save compute, but using on policy phase makes training unstable.

Also, ppg_procgen.py differs from the original openai/phasic-policy-gradient implementation in the following ways.

• The original PPG code supports LSTM whereas the CleanRL code does not.
• The original PPG code uses separate optimizers for policy and auxiliary phase, but we do not implement this as we found it to not make too much difference.
• The original PPG code utilizes multiple GPUs but our implementation does not

Experiment results

To run benchmark experiments, see benchmark/ppg.sh. Specifically, execute the following command:

Below are the average episodic returns for ppg_procgen.py, and comparison with ppg_procgen.py on 25M timesteps.

Environment	ppg_procgen.py	ppo_procgen.py	openai/phasic-policy-gradient (easy)
Starpilot (easy)	35.19 ± 13.07	33.15 ± 11.99	42.01 ± 9.59
Bossfight (easy)	10.34 ± 2.27	9.48 ± 2.42	10.71 ± 2.05
Bigfish (easy)	27.25 ± 7.55	22.21 ± 7.42	15.94 ± 10.80

Info

Note that we have run the procgen experiments using the easy distribution for reducing the computational cost.

Learning curves:

Tracked experiments and game play videos: