IMPACT: I MPORTANCE W EIGHTED A SYNCHRONOUS A RCHITECTURES WITH C LIPPED T ARGET N ETWORKS
A BSTRACT
The practical usage of reinforcement learning agents is often bottlenecked by the duration of training time.
To accelerate training, practitioners often turn to distributed reinforcement learning architectures to parallelize and accelerate the training process.
However, modern methods for scalable reinforcement learning (RL) often tradeoff between the throughput of samples that an RL agent can learn from (sample throughput) and the quality of learning from each sample (sample efﬁciency).
In these scalable RL architectures, as one increases sample throughput (i e. increasing parallelization in IMPALA (Espeholt et al., 2018)), sample efﬁciency drops signiﬁcantly.
To address this, we propose a new distributed reinforcement learning algorithm, IMPACT.
IMPACT extends IMPALA with three changes: a target network for stabilizing the surrogate objective, a circular buffer, and truncated importance sampling.
In discrete action-space environments, we show that IMPACT attains higher reward and, simultaneously, achieves up to 30% decrease in training wall-time than that of IMPALA.
For continuous control environments, IMPACT trains faster than existing scalable agents while preserving the sample efﬁciency of synchronous PPO
I NTRODUCTION
Proximal Policy Optimization (Schulman et al., 2017) is one of the most sample-efﬁcient on-policy algorithms.
However, it relies on a synchronous architecture for collecting experiences, which is closely tied to its trust region optimization objective.
Other architectures such as IMPALA can achieve much higher throughputs due to the asynchronous collection of samples from workers.
Yet,
IMPALA suffers from reduced sample efﬁciency since it cannot safely take multiple SGD steps per batch as PPO can.
The new agent, Imp ortance Weighted A synchronous Architectures with C lipped
T arget Networks ( IMPACT ), mitigates this inherent mismatch.
Not only is the algorithm highly sample efﬁcient, it can learn quickly, training 30 percent faster than IMPALA.
At the same time, we propose a novel method to stabilize agents in distributed asynchronous setups and, through our ablation studies, show how the agent can learn in both a time and sample efﬁcient manner.
In our paper, we show that the algorithm IMPACT realizes greater gains by striking the balance between high sample throughput and sample efﬁciency.
In our experiments, we demonstrate in the experiments that IMPACT exceeds state-of-the-art agents in training time (with same hardware) while maintaining similar sample efﬁciency with PPO’s.
The contributions of this paper are as follows:
We show that when collecting experiences asynchronously, introducing a target network allows for a stabilized surrogate objective and multiple SGD steps per batch (Section 3.1).
We show that using a circular buffer for storing asynchronously collected experiences allows for smooth trade-off between real-time performance and sample efﬁciency (Section 3.2).
We show that IMPACT, when evaluated using identical hardware and neural network models, improves both in real-time and timestep efﬁciency over both synchronous PPO and IMPALA (Section 4).
[Figure]
B ACKGROUND
Reinforcement Learning assumes a Markov Decision Process (MDP) setup deﬁned by the tuple ( S, A, p, γ, r ) where S and A represent the state and action space, γ ∈ [0 , 1] is the discount factor, and p : S ×
A × S → R and R : S ×
A → R are the transition dynamics and reward function that models an environment.
Let π ( a t | s t ) : S ×
A → [0 , 1] denote a stochastic policy mapping that returns an action distribution given state s t ∈ S .
Rolling out policy π ( a t | s t ) in the environment is equivalent to sampling a trajectory τ ∼ P ( τ ) ,
where τ := ( s 0 , a 0 , ...., a T − 1 , s T , a T ) .
We can compactly deﬁne state and state-action marginals of the trajectory distribution p π ( s t ) and p π ( s t , a t ) induced by the policy π ( a t
| s t ) .The
goal for reinforcement learning aims to maximize the following objective: J ( θ ) =
E ( s t ,a t ) ∼ p π
[ (cid:80) Tt =
γ t R ( s t , a t )] .
When θ parameterizes π ( a t | s t ) , the policy is updated according to the Policy Gradient Theorem (Sutton et al., 2000):
[Equation]
where ˆ A π θ ( s t , a t ) is an estimator of the advantage function.
The advantage estimator is usually deﬁned as the 1-step TD error, ˆ A π θ ( s t , a t ) =
r ( s t , a t ) + γ ˆ V ( s t +1 ) − ˆ V ( s t ) , where ˆ V ( s t ) is an estimation of the value function.
Policy gradients, however, suffer from high variance and large update-step sizes, oftentimes leading to sudden drops in performance.
2. D ISTRIBUTED PPO
Per iteration, Proximal Policy Optimization (PPO) optimizes policy π θ from target π θ old via the following objective function
[Equation]
where r t ( θ ) =
π θ ( a t | s t )
π θ old ( a t | s t ) and (cid:15) is the clipping hyperparameter.
In addition, many PPO implementations use GAE- λ as a low bias, low variance advantage estimator for ˆ A t (Schulman et al., 2015b).
PPO’s surrogate objective contains the importance sampling ratio r t ( θ ) , which can potentially explode if π θ old is too far from π θ .
(Han & Sung, 2017).
PPO’s surrogate loss mitigates this with the clipping function, which ensures that the agent makes reasonable steps.
Alternatively, PPO can also be seen as an adaptive trust region introduced in TRPO (Schulman et al., 2015a).
In Figure 1a, distributed PPO agents implement a synchronous data-gathering scheme.
Before data collection, workers are updated to π old and aggregate worker batches to training batch D train .
The learner performs many mini-batch gradient steps on D train .
Once the learner is done, learner weights are broadcast to all workers, who start sampling again.
2. I MPORTANCE W EIGHTED A CTOR -L EARNER A RCHITECTURES
In Figure 1b, IMPALA decouples acting and learning by having the learner threads send actions, observations, and values while the master thread computes and applies the gradients from a queue of learners experience (Espeholt et al., 2018).
This maximizes GPU utilization and allows for increased sample throughput, leading to high training speeds on easier environments such as Pong.
As the number of learners grows, worker policies begin to diverge from the learner policy, resulting in stale policy gradients.
To correct this, the IMPALA paper utilizes V-trace to correct the distributional shift:
[Equation]
where, V φ is the value network, π θ is the policy network of the master thread, µ θ
[Equation]
is the policy network of the learner thread, and c j = min (cid:16) ¯ c, π θ
[Equation]
j
[Equation]
j ) µ θ
[Equation] [Equation]
j
[Equation]
s j ) (cid:17) and ρ i = min (cid:16) ¯ ρ,
[Equation] [Equation]
s
[Equation]
) (cid:17) are clipped
IS ratios.
of size M traversed k times from C ( N, K ) 7:
If k = 0 , evaluate B on target θ (cid:48) , append target output to B 8:
Compute policy and value network gradients ∇ θ J ( θ ) = 1 M (cid:88) (
[Equation]
max
[Equation]
( s
[Equation]
Update policy and value network weights θ ← θ + α t ∇ θ J ( θ ) , w ← w − β t ∇ w L ( w ) 10:
If k = K , discard batch B from C ( N, K ) 11:
If t ≡ 0 (mod t target ) , update target network ( θ (cid:48) , w (cid:48) )
← ( θ, w ) 12:
If t ≡ 0 (mod t frequency ) , broadcast weights to workers 13: end for
Worker-i
Input: Worker sample batch size S 1: repeat 2:
B i = ∅ 3: for t = 1 , ..., S do 4:
Store ( s t , a t , r t , s t +1 ) ran by θ i in batch B i 5: end for 6:
Send B i to C ( N, K ) 7:
If broadcasted weights exist, set θ i ← θ 8: until learner ﬁnishes
IMPACT A LGORITHM
Like IMPALA, IMPACT separates sampling workers from learner workers.
Algorithm 1 and Figure 1c describe the main training loop and architecture of IMPACT.
In the beginning, each worker copies weights from the master network.
Then, each worker uses their own policy to collect trajectories
PPO
Asynchronous PPO
Invariants π worker ==
π learner
Async sampling means π worker is out of sync with π learner
Likelihood ratio π θ /π worker π θ /π worker π θ /π learner π θ /max(π target , 𝛃 π learner )
Effectiveness
In
[Table]
PPO, all
[Table]
are fully on
[Table]
, hence
[Table]
worker is the same as
[Table]
Since
[Table]
may differ
[Table]
, using this ratio results in trust region conflicts across multiple batches.
Since π
[Table]
is updated after each batch from the worker, only a single SGD step can be taken per batch.
The IMPACT objective allows for multiple SGD steps per async batch and has a stable trust region.
Introducing the target network allows for both a stable trust region and multiple SGD steps per batch of experience collected asynchronously from workers, improving sample efﬁciency.
Since workers can generate experiences asynchronously from their copy of the master policy, this also allows for good real-time efﬁciency.
and sends the data ( s t , a t , r t ) to the circular buffer.
Simultaneously, workers also asynchronously pull policy weights from the master learner.
In the meantime, the target network occasionally syncs with the master learner every t target iterations.
The master learner then repeatedly draws experience from the circular buffer.
Each sample is weighted by the importance ratio of π θ π
[Figure]
i as well as clipped with target network ratio π worker i π target .
The target network is used to provide a stable trust region (Figure 2), allowing multiple steps per batch (i.e., like PPO) even in the asynchronous setting (i.e., with the
IMPALA architecture).
In the next section, we describe the design of this improved objective.
3. M AXIMAL T ARGET -W ORKER C LIPPING
PPO gathers experience from previous iteration’s policy π θ old , and the current policy trains by importance sampling off-policy experience with respect to π θ .
In the asynchronous setting, worker i ’s policy, denoted as π worker i , generates experience for the policy network π θ .
The probability that batch B comes from worker i can be parameterized as a categorical distribution i ∼ D ( α 1 , ..., α n ) .
We include this by adding an extra expectation to the importance-sampled policy gradient objective (IS-PG)
(Jie & Abbeel, 2010):
[Equation]
Since each worker contains a different policy, the agent introduces a target network for stability (Figure 2).
Off-policy agents such as DDPG and DQN update target networks with a moving average.
For IMPACT, we periodically update the target network with the master network.
However, training with importance weighted ratio π θ π target can lead to numerical instability, as shown in Figure 3.
To prevent this, we clip the importance sampling ratio from worker policy, π worker i , to target policy, π target :
[Equation]
where β
= 1 ρ .
In the experiments, we set ρ as a hyperparameter with ρ ≥ 1 and β ≤ 1 .
To see why clipping is necessary, when master network’s action distribution changes signiﬁcantly over few training iterations, worker i’s policy, π worker i , samples data outside that of target policy, π target , leading to large likelihood ratios, π worker i π target .
The clipping function min( π worker i π target , ρ ) pulls back

     7LPHV       ( S L V RGH   HDQ  5 H Z D U G /LNHOLKRRG5DWLRV 3L7DUJHW3L:RUNHU2XUV
(a) Ratio ablation study.

     7LPHV       ( S L V RGH   HDQ  5 H Z D U G 7DUJHW1HWZRUN)UHTXHQF\$EODWLRQ QQQQQQQQQ
[Figure]
study.
[Figure]
[Figure]
[Figure]
large IS ratios to ρ .
Figure 10 in Appendix E provides additional intuition behind the target clipping objective. We show that the target network clipping is a lower bound of the IS-PG objective.
For ρ > 1 , the clipped target ratio is larger and serves to augment advantage estimator ˆ A t .
This incentivizes the agent toward good actions while avoiding bad actions.
Thus, higher values of ρ encourages the agent to learn faster at the cost of instability.
We use GAE- λ with V-trace (Han & Sung, 2019).
The V-trace GAE- λ modiﬁes the advantage function by adding clipped importance sampling terms to the summation of TD errors:
[Equation]
i − t   i − 1 (cid:89)
j = t c j 

δ i V, where c
i = min (cid:16) ¯ c, π target ( a j | s j ) π worker
i ( a j | s j ) (cid:17) (we use the convention (cid:81) t − 1 j = t c j = 1 ) and δ
i V is the importance sampled 1-step TD error introduced in V-trace.
3. C IRCULAR B UFFER
IMPACT uses a circular buffer (Figure 4) to emulate the mini-batch SGD used by standard PPO.
The circular buffer stores N batches that can be traversed at max K times.
Upon being traversed K times, a batch is discarded and replaced by a new worker batch.
For motivation, the circular buffer and the target network are analogous to mini-batching from π old experience in PPO.
When target network’s update frequency n = NK , the circular buffer is equivalent to distributed PPO’s training batch when the learner samples N minibatches for K SGD iterations.
This is in contrast to standard replay buffers, such as in ACER and APE-X, where transitions ( s t , a t , r t , s t +1 ) are either uniformly sampled or sampled based on priority, and, when the buffer is full, the oldest transitions are discarded (Wang et al., 2016; Horgan et al., 2018).
Figure 4 illustrates an empirical example where tuning K can increase training sample efﬁciency and decrease training wall-clock time.
E VALUATION
In our evaluation we seek to answer the following questions:
How does the target-clipping objective affect the performance of the agents compared to prior work?
(Section 4.1)
Batch
N=
K =
Pointer k= k
[Figure]
Old Batchk=
New Batchk= k= k=0 k= k= k= (
[Figure]
Circular Buffer.

      7RWDO7LPH          ( S L V RGH  0 HDQ  5 H Z D U G 3RQJ1R)UDPHVNLSY%XIIHU3DVVHV7LPHV  (
[Figure]
      7RWDO7LPHVWHSV    
     ( S L V RGH  0 HDQ  5 H Z D U G 3RQJ1R)UDPHVNLSY%XIIHU3DVVHV7LPHVWHSV 
[Figure]
How
does
the IMPACT circular buffer affect sample efﬁciency and training wall clock time?
(Section 4.2)
How does IMPACT compare to PPO and IMPALA baselines in terms of
sample
and real-time
performance?
(Section 4.3)
How does IMPACT scale with respect to the number of workers?
Section 4.
T ARGET C LIPPING P ERFORMANCE
We investigate the performance of the clipped-target objective relative to prior work, which includes
PPO and IS-PG based objectives.
Speciﬁcally, we consider the following ratios below:
[Equation]
For all three experiments, we truncate all three ratios with PPO’s clipping function: c ( R ) =
clip ( R, 1 − (cid:15), 1+ (cid:15) ) and train in an asynchronous setting.
Figure 4(a) reveals two important takeaways: ﬁrst, R 1 suffers from sudden drops in performance midway through training.
Next, R 2 trains stably but does not achieve good performance.
We theorize that R 1 fails due to the target and worker network mismatch.
During periods of training where the master learner undergoes drastic changes, worker action outputs vastly differ from the learner outputs, resulting in small action probabilities.
This creates large ratios in training and destabilizes training.
We hypothesize that R 2 fails due to different workers pushing and pulling the learner in multiple directions.
The learner moves forward with the most recent worker’s suggestions without developing a proper trust region, resulting in many worker’s suggestions conﬂicting with each other.
The loss function, R 3 shows that clipping is necessary and can help facilitate training.
By clipping the target-worker ratio, we make sure that the ratio does not explode and destabilize training.
Furthermore, we prevent workers from making mutually destructive suggestions by having a target network provide singular guidance.
4.1. T ARGET N ETWORK U PDATE F REQUENCY
In Section 3.2, an analogy was drawn between PPO’s mini-batching mechanism and the circular buffer.
Our primary benchmark for target update frequency is n = N · K , where N is circular buffer size and K is maximum replay coefﬁcient.
This is the case when PPO is equivalent to IMPACT.
In Figure 4(b), we test the frequency of updates with varying orders of magnitudes of n .
In general, we ﬁnd that agent performance is robust to vastly differing frequencies.
However, when n = 1 ∼ 4 ,
[Figure]
the agent does not learn.
Based on empirical results, we theorize that the agent is able to train as long as a stable trust region can be formed.
On the other hand, if update frequency is too low, the agent is stranded for many iterations in the same trust region, which impairs learning speed.
4. T IME AND S AMPLE E FFICIENCY WITH C IRCULAR B UFFER
Counter to intuition, the tradeoff between time and sample efﬁciency when K increases is not necessarily true.
In Figure 4b and 4c, we show that IMPACT realizes greater gains by striking the balance between high sample throughput and sample efﬁciency.
When K = 2 , IMPACT performs the best in both time and sample efﬁciency.
Our results reveal that wall-clock time and sample efﬁciency can be optimized based on tuning values of K in the circular buffer.
4. C OMPARISON WITH B ASELINES
We investigate how IMPACT attains greater performance in wall clock-time and sample efﬁciency compared with PPO and IMPALA across six different continuous control and discrete action tasks.
We tested the agent on three continuous environments (Figure 5): HalfCheetah, Hopper, and Humanoid on 16 CPUs and 1 GPU.
The policy networks consist of two fully-connected layers ofunits with nonlinear activation tanh.
The critic network shares the same architecture as the policy network.
For consistentency, same network architectures were employed across PPO, IMPALA, and
IMPACT.
For the discrete environments (Figure 6), Pong, SpaceInvaders, and Breakout were chosen as common benchmarks used in popular distributed RL libraries (Caspi et al., 2017; Liang et al., 2018).
Additional experiments for discrete environments are in the Appendix.
These experiments were ran on 32 CPUs and 1 GPU.
The policy network consists of three 4x4 and one 11x11 conv layer, with nonlinear activation ReLU.
The critic network shares weights with the policy network.
The input of the network is a stack of four 42x42 down-sampled images of the Atari environment.
The hyper-parameters for continuous and discrete environments are listed in the Appendix B table 1 and 2 respectively.
Figures 5 and 6 show the total average return on evaluation rollouts for IMPACT, IMPALA and
PPO.
We train each algorithm with three different random seeds on each environment for a total time
[Figure]
of three hours.
According to the experiments, IMPACT is able to train much faster than PPO and
IMPALA in both discrete and continuous domains, while preserving same or better sample efﬁciency than PPO.
Our results reveal that continuous control tasks for IMPACT are sensitive to the tuple ( N, K ) for the circular buffer.
N = 16 and K = 20 is a robust choice for continuous control.
Although higher K inhibits workers’ sample throughput, increased sample efﬁciency from replaying experiences results in an overall reduction in training wall-clock time and higher reward.
For discrete tasks, N =and K = 2 works best.
Empirically, agents learn faster from new experience than replaying old experience, showing how exploration is crucial to achieving high asymptotic performance in discrete enviornments.
4. IMPACT S CALABILITY
Figure 7 shows how IMPACT’s performance scales relative to the number of workers.
More workers means increased sample throughput, which in turn increases training throughput (the rate that learner consumes batches).
With the learner consuming more worker data per second, IMPACT can attain better performance in less time.
However, as number of workers increases, observed increases in performance begin to decline.
R ELATED W ORK
Distributed RL architectures are often used to accelerate training.
Gorila (Nair et al., 2015) and
A3C (Mnih et al., 2016) use workers to compute gradients to be sent to the learner.
A2C
(Mnih et al., 2016) and IMPALA (Espeholt et al., 2018) send experience tuples to the learner.
Distributed replay buffers, introduced in ACER (Wang et al., 2016) and Ape-X (Horgan et al., 2018), collect worker-collected experience and deﬁne an overarching heuristic for learner batch selection.
IMPACT is the ﬁrst to fully incorporate the sample-efﬁciency beneﬁts of PPO in an asynchronous setting.
Surreal PPO (Fan et al., 2018) also studies training with PPO in the asynchronous setting, but do not consider adaptation of the surrogate objective nor IS-correction.
Their use of a target network for broadcasting weights to workers is also entirely different from IMPACT’s.
Consequently, IMPACT is able to achieve better results in
[Figure]
i
[Figure]
M
[Figure]
an
R
[Figure]
w a r d
HalfCheetah-
[Figure]
[Figure]
[Figure]
Off-policy methods , including DDPG and QProp, utilize target networks to stabilize learning the Q function (Lillicrap et al., 2015; Gu et al., 2016).
This use of a target network is related but different from IMPACT, which uses the network to deﬁne a stable trust region for the PPO surrogate objective.
C ONCLUSION
In conclusion, we introduce IMPACT, which extends PPO with a stabilized surrogate objective for asynchronous optimization, enabling greater real-time performance without sacriﬁcing timestep efﬁciency. We show the importance of the IMPACT objective to stable training, and show it can outperform tuned PPO and IMPALA baselines in both real-time and timestep metrics.
A A DDITIONAL E XPERIMENTS
[Figure]
R e w a r d
BeamRiderNoFrameskip-v
IMPALAIMPACTPPO 0.
2.5 Timesteps 1e
E p i s ode
M ean
R e w a r d
GravitarNoFrameskip-v
IMPALAIMPACTPPO
[Figure]
Timesteps
B H YPER PARAMETERS FOR A LL E NVIRONMENTS B. D ISCRETE E NVIRONMENTS
H YPERPARAMETERS
IMPACT
IMPALA
PPO
Clip Parameter 0.
Entropy Coeff 0.
Grad Clipping 10.
Discount ( γ ) 0.
Lambda ( λ ) 0.
Learning Rate 1 . 0 · 10 −1 . 0 · 10 −5 .
· 10 −
Minibatch Buffer Size (N) — —
Num SGD Iterations (K) —
Sample Batch Size
Train Batch Size
SGD Minibatch Size — —
KL Coeff 0.
KL Target 0.
Value Function Coeff 1.
Target-Worker Clipping ( ρ ) 2.
B. C ONTINUOUS E NVIRONMENTS
[Table]
B. H YPERPARAMETER B UDGET
Listed below was the grid search we used for each algorithm to obtain optimal hyperparameters.
Optimal values were found via grid searching on each hyperparameter separately.
We found that
IMPACT’s optimal hyperparameter values tend to hover close to either IMPALA’s or PPO’s, which greatly mitigated IMPACT’s budget.
B.3. D ISCRETE E NVIRONMENT S EARCH H YPERPARAMETERS
[Table]
Clip Parameter [0.1, 0.2, 0.3] — [0.1, 0.2, 0.3, 0.4]
Grad Clipping [10, 20, 40] [2.5, 5, 10, 20, 40, 80] —
Learning Rate ( 10 − 4 ) [0.5, 1.0, 3.0] [
[Table]
[Table]
B.
C ONTINUOUS E NVIRONMENT S EARCH
H YPERPARAMETERS
IMPACT
IMPALA PPO
Clip Parameter [0.2, 0.3, 0.4] — [0.1, 0.2, 0.3, 0.4]
Grad Clipping [0.5, 1.0, 5.0] [0.1, 0.25, 0.5, 1.0, 5.0, 10.0] —
Learning Rate ( 10 − 4 ) [1.0, 3.0, 5.0] [0.1, 0.15, 0.3, 0.5, 0.8, 1.0, 3.0, 5.0][1.0, 3.0, 5.0]
Minibatch Buffer Size (N) [4,8,16] — —
Num SGD Iterations (K)
Train Batch Size — — [65536, 98304, 131072, 163840]
KL Target [0.01, 0.02, 0.04] — [0.01, 0.02, 0.04]
[Table]
[0.5, 1.0, 2.0] [0.5, 1.0, 2.0] [0.5, 1.0, 2.0] # of Runs
C IMPALA TO IMPACT
[Figure]
we gradually add components to IMPALA until the agent is equivalent to IMPACT’s.
Starting from IMPALA, we gradually add PPO’s objective function, circular replay buffer, and target-worker clipping.
In particular, IMPALA with PPO’s objective function and circular replay buffer is equivalent to an asynchronous-variant of PPO (APPO).
APPO fails to perform as well as synchronous distributed PPO, since PPO is an on-policy algorithm.
D IMPALA IN C ONTINUOUS E NVIRONMENTS
In Figure 6, IMPALA performs substantially worse than other agents in continuous environments.
We postulate that IMPALA suffers from low asymptotic performance here since its objective is an importance-sampled version of the Vanilla Policy Gradient (VPG) objective, which is known to suffer from high variance and large update-step sizes.
We found that for VPG, higher learning rates encourage faster learning in the beginning but performance drops to negative return later in training.
In Appendix B
[Figure]
for IMPALA
[Figure]
we heavily tuned on the learning rate, ﬁnding that small learning rates stabilize learning at the cost of low asymptotic performance.
Prior work also reveals the agents that use VPG fail to attain good performance in non-trivial continuous tasks (Achiam, 2018).
Our results with IMPALA reaches similar performance compared to other VPG-based algorithms.
The closest neighbor to IMPALA, A3C uses workers to compute gradients from the VPG objective to send to the learner thread.
A3C performs well in InvertedPendulum yet ﬂounders in continuous environments (Tassa et al., 2018).
[Figure]
Action Distributions
[Figure]
E T HE INTUITION OF THE OBJECTIVE
The following ratios represent the objective functions for different ablation studies.
In the plots (Figure 10), we set the advantage function to be one, i.e. ˆ A t = 1 .
• IS ratio:
[Figure]
• IMPACT target: min (cid:16) π worker i π target , ρ (cid:17) π θ π worker i ˆ A
[Figure]
• PPO (cid:15) -clip: min (cid:16) π θ π worker i ˆ A t , clip ( π θ π worker i , 1 − (cid:15), 1 + (cid:15) )
ˆ A t (cid:17) • IMPACT target (cid:15)
-clip: min (cid:16) min (cid:16) π worker i π target , ρ (cid:17) π
θ π worker i ˆ A t , clip (cid:16) min (cid:16) π worker i π target , ρ (cid:17)
π θ π worker i , 1 − (cid:15), 1 + (cid:15) (cid:17) ˆ A t (cid:17)
According to Figure 10, IS ratio is large when π worker i assigns low probability.
IMPACT target (cid:15) -clip is a lower bound of the PPO (cid:15) -clip.
In an distributed asynchronous setting, the trust region suffers from larger variance stemming from off-policy data.
IMPACT target (cid:15) -clip ratio mitigates this by encouraging conservative and reasonable policy-gradient steps.