Glossary · Reinforcement learning
Proximal Policy Optimization
Also called PPO
A widely used reinforcement learning algorithm that improves a policy in small, safe steps by limiting how far each update can move it.
PPO (Schulman et al. 2017) is a policy-gradient method. It repeats two phases:
- Collect. Run the current stochastic policy in many copies of the environment to gather a batch of experience, a rollout.
- Update. Use that batch for several passes of gradient descent, making good actions more likely and bad ones less likely.
The clipped objective
The danger in step 2 is changing the policy too much on one batch of data. The data was collected by the old policy, so it says little about a very different new one, and one big bad update can wreck a good policy. PPO limits the change with a ratio and a clip.
The ratio compares how likely the new policy is to take an action with how likely the old one was:
PPO maximises
where is the advantage. Once an action’s probability has moved more than (usually 0.2) in the helpful direction, the clip removes any further gain, so there is no reason to push it further.
The full loss also trains the critic and usually adds an entropy bonus that keeps some exploration:
Why it’s popular
PPO is simple, works on discrete and continuous actions, and is forgiving of settings. It isn’t the most sample-efficient algorithm, but in a fast simulator with many parallel environments that matters less. Most legged-robot locomotion work trained in simulation uses it.
In this project
Every policy on this site is trained with PPO: , 8 passes over each batch in minibatches of 512, the Adam optimiser, and CAPS regularisation added to the loss in place of an entropy bonus. A further term keeps the action means inside (see action clipping). Collection and updates overlap, using decoupled PPO.