-
Notifications
You must be signed in to change notification settings - Fork 0
/
ppo.py
858 lines (765 loc) · 41.6 KB
/
ppo.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
# import warnings
from typing import Any, Dict, Optional, Type, Union, Iterable
from warnings import warn
import tqdm
import gc
# import torch.nn
from gym import spaces
# import numpy as np
from numpy import mean as np_mean, zeros, float32, concatenate, ndarray
from numpy import max as np_max, min as np_min
from numpy import linalg
# import torch as th
from torch import Tensor, device, min, clamp, abs, exp, no_grad, mean, where, concatenate as th_concatenate, var, max, dist
from torch.nn.utils import parameters_to_vector
from torch.linalg import vector_norm as th_norm
# from torch.nn import functional as F
from torch.nn.functional import mse_loss
from torch.nn.utils import clip_grad_norm_
from torch.cuda import empty_cache
from math import isnan
from stable_baselines3.common.buffers import PrioritizedExperienceReplay
_tensor_or_tensors = Union[Tensor, Iterable[Tensor]]
from stable_baselines3.common.on_policy_algorithm import OnPolicyAlgorithm
from stable_baselines3.common.policies import ActorCriticPolicyOptim
from stable_baselines3.common.type_aliases import GymEnv, MaybeCallback, Schedule
from stable_baselines3.common.utils import explained_variance_torch, get_schedule_fn
# from stable_baselines3.common.torch_utils import utils_cgn
class PPO_Optim(OnPolicyAlgorithm):
"""
Proximal Policy Optimization algorithm (PPO) (clip version)
Paper: https://arxiv.org/abs/1707.06347
Code: This implementation borrows code from OpenAI Spinning Up (https://github.com/openai/spinningup/)
https://github.com/ikostrikov/pytorch-a2c-ppo-acktr-gail and
and Stable Baselines (PPO2 from https://github.com/hill-a/stable-baselines)
Introduction to PPO: https://spinningup.openai.com/en/latest/algorithms/ppo.html
:param policy: The policy model to use (MlpPolicy, CnnPolicy, ...)
:param env: The environment to learn from (if registered in Gym, can be str)
:param learning_rate: The learning rate, it can be a function
of the current progress remaining (from 1 to 0)
:param n_steps: The number of steps to run for each environment per update
(i.e. rollout buffer size is n_steps * n_envs where n_envs is number of environment copies running in parallel)
NOTE: n_steps * n_envs must be greater than 1 (because of the advantage normalization)
See https://github.com/pytorch/pytorch/issues/29372
:param batch_size: batch size
:param minibatch_size: minibatch size
:param n_epochs: Number of epoch when optimizing the surrogate loss
:param gamma: Discount factor
:param gae_lambda: Factor for trade-off of bias vs variance for Generalized Advantage Estimator
:param clip_range: Clipping parameter, it can be a function of the current progress
remaining (from 1 to 0).
:param clip_range_vf: Clipping parameter for the value function,
it can be a function of the current progress remaining (from 1 to 0).
This is a parameter specific to the OpenAI implementation. If None is passed (default),
no clipping will be done on the value function.
IMPORTANT: this clipping depends on the reward scaling.
:param ent_coef: Entropy coefficient for the loss calculation
:param vf_coef: Value function coefficient for the loss calculation
:param max_grad_norm: The maximum value for the gradient clipping
:param use_sde: Whether to use generalized State Dependent Exploration (gSDE)
instead of action noise exploration (default: False)
:param sde_sample_freq: Sample a new noise matrix every n steps when using gSDE
Default: -1 (only sample at the beginning of the rollout)
:param target_kl: Limit the KL divergence between updates,
because the clipping is not enough to prevent large update
see issue #213 (cf https://github.com/hill-a/stable-baselines/issues/213)
By default, there is no limit on the kl div.
:param tensorboard_log: the log location for tensorboard (if None, no logging)
:param create_eval_env: Whether to create a second environment that will be
used for evaluating the agent periodically. (Only available when passing string for the environment)
:param policy_kwargs: additional arguments to be passed to the policy on creation
:param verbose: the verbosity level: 0 no output, 1 info, 2 debug
:param seed: Seed for the pseudo random generators
:param device: Device (cpu, cuda, ...) on which the code should be run.
Setting it to auto, the code will be run on the GPU if possible.
:param _init_setup_model: Whether or not to build the network at the creation of the instance
"""
def __init__(
self,
policy: Union[str, Type[ActorCriticPolicyOptim]],
env: Union[GymEnv, str],
learning_rate: Union[float, Schedule] = 3e-4,
n_steps: int = 2048,
n_steps_per: int = 2048,
max_epoches_per: int = 100,
batch_size: int = 64,
critic_batch_size: Optional[int] = None,
minibatch_size: Optional[int] = None,
n_epochs: int = 10,
n_epochs_critic: int = 0,
gamma: float = 0.99,
gae_lambda: float = 0.95,
clip_range: Union[float, Schedule] = 0.2,
max_clip: Optional[float] = None,
clip_range_vf: Union[None, float, Schedule] = None,
ent_coef: float = 0.0,
vf_coef: float = 0.5,
max_grad_norm: float = 0.5,
max_pol_loss: float = -0.0,
use_sde: bool = False,
sde_sample_freq: int = -1,
target_kl: Optional[float] = None,
tensorboard_log: Optional[str] = None,
create_eval_env: bool = False,
policy_kwargs: Optional[Dict[str, Any]] = None,
verbose: int = 0,
seed: Optional[int] = None,
device: Union[device, str] = "auto",
_init_setup_model: bool = True,
):
super(PPO_Optim, self).__init__(
policy,
env,
learning_rate=learning_rate,
n_steps=n_steps,
gamma=gamma,
gae_lambda=gae_lambda,
ent_coef=ent_coef,
vf_coef=vf_coef,
max_grad_norm=max_grad_norm,
use_sde=use_sde,
sde_sample_freq=sde_sample_freq,
tensorboard_log=tensorboard_log,
policy_kwargs=policy_kwargs,
verbose=verbose,
device=device,
create_eval_env=create_eval_env,
seed=seed,
_init_setup_model=False,
supported_action_spaces=(
spaces.Box,
spaces.Discrete,
spaces.MultiDiscrete,
spaces.MultiBinary,
),
batch_size=batch_size
)
# Sanity check, otherwise it will lead to noisy gradient and NaN
# because of the advantage normalization
assert (
batch_size > 1
), "`batch_size` must be greater than 1. See https://github.com/DLR-RM/stable-baselines3/issues/440"
if self.env is not None:
# Check that `n_steps * n_envs > 1` to avoid NaN
# when doing advantage normalization
buffer_size = self.env.num_envs * self.n_steps
assert (
buffer_size > 1
), f"`n_steps * n_envs` must be greater than 1. Currently n_steps={self.n_steps} and n_envs={self.env.num_envs}"
# Check that the rollout buffer size is a multiple of the mini-batch size
untruncated_batches = buffer_size // batch_size
if buffer_size % batch_size > 0:
warn(
f"You have specified a mini-batch size of {batch_size},"
f" but because the `RolloutBuffer` is of size `n_steps * n_envs = {buffer_size}`,"
f" after every {untruncated_batches} untruncated mini-batches,"
f" there will be a truncated mini-batch of size {buffer_size % batch_size}\n"
f"We recommend using a `batch_size` that is a factor of `n_steps * n_envs`.\n"
f"Info: (n_steps={self.n_steps} and n_envs={self.env.num_envs})"
)
self.batch_size = batch_size
if critic_batch_size is not None:
self.critic_batch_size = critic_batch_size
else:
self.critic_batch_size = self.batch_size
if minibatch_size is not None:
self.minibatch_size = minibatch_size
# print(f"**got minibatch size of {minibatch_size}**")
else:
self.minibatch_size = batch_size
self.n_steps_per = n_steps_per
self.max_epoches_per = max_epoches_per
self.max_clip = max_clip
self.n_epochs = n_epochs
self.n_epochs_critic = n_epochs_critic
self.clip_range = clip_range
self.clip_range_vf = clip_range_vf
self.target_kl = target_kl
# maybe?
# benchmark = True
self.last_params_store = None
self.max_pol_loss = max_pol_loss
self.PERBuffer = PrioritizedExperienceReplay(
self.n_steps_per,
self.observation_space,
self.action_space,
device=self.device,
gamma=self.gamma,
gae_lambda=self.gae_lambda,
n_envs=self.n_envs,
max_timesteps=self.max_epoches_per,
)
if _init_setup_model:
self._setup_model()
self.PERBuffer.reset()
def _setup_model(self) -> None:
super(PPO_Optim, self)._setup_model()
# Initialize schedules for policy/value clipping
self.clip_range = get_schedule_fn(self.clip_range)
if self.clip_range_vf is not None:
if isinstance(self.clip_range_vf, (float, int)):
assert self.clip_range_vf > 0, "`clip_range_vf` must be positive, " "pass `None` to deactivate vf clipping"
self.clip_range_vf = get_schedule_fn(self.clip_range_vf)
def _get_flat_gradient(self) -> float:
# flat = []
sequence_arrs = []
# res = 0
for p in self.policy.parameters():
if p.grad is not None:
# grad = p.grad.data.detach().cpu().numpy().ravel()
sequence_arrs.append(p.grad.detach().ravel())
# res += th_norm(p.grad.detach().ravel()).cpu().item()
else:
# grad = zeros(p.shape).ravel()
# sequence_arrs.append(zeros(p.shape).ravel())
pass
# flat = parameters_to_vector(model.parameters()).grad.data.detach().cpu().numpy()
# grads = parameters_to_vector(model.parameters()).grad
# flat = where(grads is not None, grads, 0).detach().cpu().numpy()
# flat = concatenate(sequence_arrs)
# return linalg.norm(flat)
return th_norm(th_concatenate(sequence_arrs)).item()
# return res
def _get_param_diff(self) -> float:
flat = []
if self.last_params_store is None:
new_params = self.policy.parameters()
for p in new_params:
diff = zeros(p.shape, dtype=float32).ravel()
flat = concatenate((flat, diff))
self.last_params_store = parameters_to_vector(self.policy.parameters()).detach().clone()
return linalg.norm(flat)
else:
new_params = parameters_to_vector(self.policy.parameters()).detach()
# diff = (new_params - self.last_params_store).cpu().numpy()
diff = new_params - self.last_params_store
# flat = concatenate((flat, diff))
self.last_params_store = new_params
# return linalg.norm(diff)
return th_norm(diff).item()
def train(self) -> None:
"""
Update policy using the currently gathered rollout buffer.
"""
# Switch to train mode (this affects batch norm / dropout)
self.policy.set_training_mode(True)
# Update optimizer learning rate
self._update_learning_rate([self.policy.value_optimizer, self.policy.policy_optimizer])
# Compute current clip range
clip_range = self.clip_range(self._current_progress_remaining)
# Optional: clip range for the value function
if self.clip_range_vf is not None:
clip_range_vf = self.clip_range_vf(self._current_progress_remaining)
entropy_losses = []
pg_losses, value_losses = [], []
clip_fractions = []
# losses = []
# losses_per = []
# gradients = []
# param_diffs = []
approx_kl_divs = []
last_kl_div = 0
last_clip_fraction = 0
# last_off_policy_penalty = 0
actual_epochs = 0
continue_training = True
progress_bar = tqdm.tqdm(desc=f"Training", total=self.n_epochs+self.n_epochs_critic, leave=False,
smoothing=0.01)
# if self.PERBuffer.buffer_size < self.batch_size:
# per_batch = self.PERBuffer.buffer_size
# else:
# per_batch = self.batch_size
precompute_val_extract = parameters_to_vector(self.policy.mlp_extractor.value_net.parameters())
precompute_val_pol = parameters_to_vector(self.policy.value_net.parameters())
precompute_val = th_concatenate((precompute_val_extract, precompute_val_pol)).cpu()
# train critic only
for epoch in range(self.n_epochs_critic):
# Do a complete pass on the rollout buffer
progress_bar.set_description(f"Training, rollout buffer get | epoch")
# batch count (minibatch count not included/counted)
batch = 0
# do PER buffer add stuff
# for rollout_data in self.rollout_buffer.get(self.batch_size):
# if epoch == 0:
# actions = rollout_data.actions
# if isinstance(self.action_space, spaces.Discrete):
# # Convert discrete action from float to long
# actions = rollout_data.actions.long().flatten()
#
# values, log_prob, entropy = self.policy.evaluate_actions(rollout_data.observations, actions)
# values = values.flatten()
# if self.clip_range_vf is None:
# # No clipping
# values_pred = values
# else:
# # Clip the different between old and new value
# # NOTE: this depends on the reward scaling
# values_pred = rollout_data.old_values + clamp(
# values - rollout_data.old_values, -clip_range_vf, clip_range_vf
# )
#
# value_est_err = abs(rollout_data.returns - values_pred)
# # if per_batch != 0:
# # self.PERBuffer.add(rollout_data.observations.detach().cpu(),
# # actions.detach().cpu(),
# # rollout_data.returns.detach().cpu(),
# # rollout_data.advantages.detach().cpu(),
# # values.detach().cpu(),
# # value_est_err.detach().cpu(),
# # log_prob.detach().cpu())
# else:
# break
# do critic update calcs
final_minibatch = True
# for rollout_data, final_minibatch in \
# self.rollout_buffer.get_minibatch(self.batch_size, self.minibatch_size):
for rollout_data in self.rollout_buffer.get(self.critic_batch_size):
# for i in range(0, self.batch_size, self.minibatch_size):
progress_bar.set_description(f"Training, value loss | epoch")
# Re-sample the noise matrix because the log_std has changed
if self.use_sde:
self.policy.reset_noise(self.critic_batch_size)
values = self.policy.predict_values(rollout_data.observations)
values = values.flatten()
if self.clip_range_vf is None:
# No clipping
values_pred = values
else:
# Clip the different between old and new value
# NOTE: this depends on the reward scaling
values_pred = rollout_data.old_values + clamp(
values - rollout_data.old_values, -clip_range_vf, clip_range_vf
)
# Value loss using the TD(gae_lambda) target
value_loss = mse_loss(rollout_data.returns, values_pred)
value_losses.append(value_loss.item())
if value_loss.isnan().any():
if self.policy.value_optimizer.param_groups[0]['lr'] != 0:
del values
self.policy.policy_optimizer.zero_grad(set_to_none=True)
self.policy.value_optimizer.zero_grad(set_to_none=True)
print(f"got value loss NaN")
# break
raise ArithmeticError('Got nan in value loss')
final_value_loss = (self.vf_coef * value_loss) / (self.critic_batch_size / self.minibatch_size)
# add PER loss to value loss
# if final_minibatch:
# for rollout_data_per in self.PERBuffer.get(per_batch):
# # Re-sample the noise matrix because the log_std has changed
# if self.use_sde:
# self.policy.reset_noise(per_batch)
#
# values = self.policy.predict_values(rollout_data_per.observations)
# values: Tensor
# values = values.flatten()
# # Normalize advantage
# # advantages = rollout_data.advantages
# # advantages = (advantages - advantages.mean()) / (advantages.std() + 1e-8)
#
# if self.clip_range_vf is None:
# # No clipping
# values_pred = values
# else:
# # Clip the different between old and new value
# # NOTE: this depends on the reward scaling
# values_pred = rollout_data_per.old_values + clamp(
# values - rollout_data_per.old_values, -clip_range_vf, clip_range_vf
# )
# value_est_err = abs(rollout_data_per.returns - values_pred)
# value_est_err_array = value_est_err.detach().cpu()
#
# self.PERBuffer.update_vals(value_est_err_array)
#
# # Value loss using the TD(gae_lambda) target
# value_loss = mse_loss(rollout_data_per.returns, values_pred)
# value_losses.append(value_loss.item())
#
# per_loss = self.vf_coef * value_loss
# losses_per.append(per_loss.item())
#
# # Optimization step
# progress_bar.set_description(f"Training, PER backwards | epoch")
# # self.policy.optimizer.zero_grad(set_to_none=True)
# # per_loss.backward()
# final_value_loss += per_loss
if isnan(last_kl_div):
raise ArithmeticError('Got nan in approx_kl_div')
if self.target_kl is not None and last_kl_div > 1.5 * self.target_kl:
continue_training = False
if self.verbose >= 1:
print(
f"Early stopping at epoch {epoch}, batch {batch} due to reaching max kl: {last_kl_div:.2f}")
break
# Optimization step
progress_bar.set_description(f"Training, backwards | epoch")
final_value_loss.backward()
# gradients.append(self._get_flat_gradient())
# this is where we calculate the actual batch (optimizer step and etc.)
if final_minibatch:
batch += 1
# print("got final_minibatch")
# Clip grad norm
# th.nn.utils.clip_grad_norm_(self.policy.parameters(), self.max_grad_norm)
if self.max_grad_norm != 0:
progress_bar.set_description(f"Training, clipping grads | epoch")
clip_grad_norm_(self.policy.value_net.parameters(), self.max_grad_norm)
clip_grad_norm_(self.policy.mlp_extractor.value_net.parameters(), self.max_grad_norm)
# utils_cgn(self.policy.mlp_extractor.value_net.parameters(), self.max_grad_norm)
progress_bar.set_description(f"Training, optimizer step | epoch")
self.policy.value_optimizer.step()
# if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# self.policy.policy_optimizer.step()
self.policy.value_optimizer.zero_grad(set_to_none=True)
# if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# self.policy.policy_optimizer.zero_grad(set_to_none=True)
# param_diffs.append(self._get_param_diff())
# del rollout_data
if not continue_training:
break
progress_bar.update(1)
# actual_epochs += 1
self._n_updates += 1
# to replicate functionality of where it was originally
# approx_kl_divs = []
postcompute_val_extract = parameters_to_vector(self.policy.mlp_extractor.value_net.parameters())
postcompute_val_pol = parameters_to_vector(self.policy.value_net.parameters())
postcompute_val = th_concatenate((postcompute_val_extract, postcompute_val_pol)).cpu()
empty_cache()
gc.collect()
precompute_act_extract = parameters_to_vector(self.policy.mlp_extractor.policy_net.parameters())
precompute_act_pol = parameters_to_vector(self.policy.action_net.parameters())
precompute_act = th_concatenate((precompute_act_extract, precompute_act_pol)).cpu()
# train for n_epochs epochs, both policy and critic
for epoch in range(self.n_epochs):
# Do a complete pass on the rollout buffer
progress_bar.set_description(f"Training, rollout buffer get | epoch")
# batch count (minibatch count not included/counted)
batch = 0
final_minibatch = True
# for rollout_data, final_minibatch in \
# self.rollout_buffer.get_minibatch(self.batch_size, self.minibatch_size):
for rollout_data in self.rollout_buffer.get(self.batch_size):
progress_bar.set_description(f"Training, PPO calc | epoch")
actions = rollout_data.actions
if isinstance(self.action_space, spaces.Discrete):
# Convert discrete action from float to long
# actions = rollout_data.actions.long().flatten()
actions = actions.int().flatten()
# Re-sample the noise matrix because the log_std has changed
if self.use_sde:
self.policy.reset_noise(self.batch_size)
log_prob, entropy = self.policy.get_entr_prob(rollout_data.observations, actions)
# values = values.flatten()
# Normalize advantage
advantages = rollout_data.advantages
advantages = (advantages - advantages.mean()) / (advantages.std() + 1e-8)
# ratio between old and new policy, should be one at the first iteration
log_prob_diff = log_prob - rollout_data.old_log_prob
ratio = exp(log_prob_diff)
# clipped surrogate loss
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# clamped_off_policy_ratio = clamp(ratio, 0, 2)
# clamped_ratio = clamp(ratio, 1 - clip_range, 1 + clip_range)
# scale based on how close to the current policy we are, 0.8 -> 0.8 and 1.2 -> 1.2
# off_policy_penalty = min(2 - clamped_off_policy_ratio, clamped_off_policy_ratio)
policy_loss_1 = advantages * ratio
policy_loss_2 = advantages * clamp(ratio, 1 - clip_range, 1 + clip_range)
policy_loss = -min(policy_loss_1, policy_loss_2).mean()
# simple kl spike prevention for now
if policy_loss > self.max_pol_loss and epoch > 0 and last_clip_fraction > 0.07:
# dbg
# pol_loss = -min(policy_loss_1, policy_loss_2)
# vals, indxs = max(pol_loss, 0)
# obs = rollout_data.observations[indxs].cpu().numpy()
#
del policy_loss
del policy_loss_1
del policy_loss_2
del ratio
del log_prob_diff
del advantages
# del values
del log_prob
del entropy
del actions
self.policy.policy_optimizer.zero_grad(set_to_none=True)
self.policy.value_optimizer.zero_grad(set_to_none=True)
print(f"got too large of a policy loss, skipping")
continue_training = False
break
if policy_loss.isnan().any():
del policy_loss
del policy_loss_1
del policy_loss_2
del ratio
del log_prob_diff
del advantages
# del values
del log_prob
del entropy
del actions
self.policy.policy_optimizer.zero_grad(set_to_none=True)
self.policy.value_optimizer.zero_grad(set_to_none=True)
print(f"got policy loss NaN")
# break
raise ArithmeticError('Got nan in policy loss')
# Logging
pg_losses.append(policy_loss.item())
# last_off_policy_penalty = mean(off_policy_penalty).float().item()
clip_fraction = mean((abs(ratio - 1) > clip_range).float()).item()
clip_fractions.append(clip_fraction)
last_clip_fraction = clip_fraction
# Calculate approximate form of reverse KL Divergence for early stopping
# see issue #417: https://github.com/DLR-RM/stable-baselines3/issues/417
# and discussion in PR #419: https://github.com/DLR-RM/stable-baselines3/pull/419
# and Schulman blog: http://joschu.net/blog/kl-approx.html
with no_grad():
# log_ratio = log_prob - rollout_data.old_log_prob
approx_kl_div = mean((ratio - 1) - log_prob_diff).cpu().numpy()
approx_kl_div_scalar = approx_kl_div.item()
approx_kl_divs.append(approx_kl_div_scalar)
last_kl_div = approx_kl_div_scalar
# check if clip fraction was too high
if self.max_clip is not None and last_clip_fraction > self.max_clip:
print(f"hit clip_fraction > max_clip: {last_clip_fraction} on epoch: {actual_epochs} and batch: {batch}")
continue_training = False
break
# if self.clip_range_vf is None:
# # No clipping
# values_pred = values
# else:
# # Clip the different between old and new value
# # NOTE: this depends on the reward scaling
# values_pred = rollout_data.old_values + clamp(
# values - rollout_data.old_values, -clip_range_vf, clip_range_vf
# )
# Value loss using the TD(gae_lambda) target
# value_loss = mse_loss(rollout_data.returns, values_pred)
# value_losses.append(value_loss.item())
# if value_loss.isnan().any():
# if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# del policy_loss
# del policy_loss_1
# del policy_loss_2
# del ratio
# del log_prob_diff
# del advantages
# del values
# del log_prob
# del entropy
# del actions
# self.policy.policy_optimizer.zero_grad(set_to_none=True)
# self.policy.value_optimizer.zero_grad(set_to_none=True)
# print(f"got value loss NaN")
# # break
# raise ArithmeticError('Got nan in value loss')
# Entropy loss favor exploration
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
if entropy is None:
# Approximate entropy when no analytical form
entropy_loss = -mean(-log_prob)
else:
entropy_loss = -mean(entropy)
entropy_losses.append(entropy_loss.item())
# if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# loss = (policy_loss + self.ent_coef * entropy_loss + self.vf_coef * value_loss) \
# / (self.batch_size / self.minibatch_size)
# else:
# loss = (self.vf_coef * value_loss) / (self.batch_size / self.minibatch_size)
# losses.append(loss.item())
# final_value_loss = (self.vf_coef * value_loss) / (self.batch_size / self.minibatch_size)
# add PER loss to value loss
# if final_minibatch:
# for rollout_data_per in self.PERBuffer.get(per_batch):
# # Re-sample the noise matrix because the log_std has changed
# if self.use_sde:
# self.policy.reset_noise(per_batch)
#
# values = self.policy.predict_values(rollout_data_per.observations)
# values: Tensor
# values = values.flatten()
# # Normalize advantage
# # advantages = rollout_data.advantages
# # advantages = (advantages - advantages.mean()) / (advantages.std() + 1e-8)
#
# if self.clip_range_vf is None:
# # No clipping
# values_pred = values
# else:
# # Clip the different between old and new value
# # NOTE: this depends on the reward scaling
# values_pred = rollout_data_per.old_values + clamp(
# values - rollout_data_per.old_values, -clip_range_vf, clip_range_vf
# )
# value_est_err = abs(rollout_data_per.returns - values_pred)
# value_est_err_array = value_est_err.detach().cpu()
#
# self.PERBuffer.update_vals(value_est_err_array)
#
# # Value loss using the TD(gae_lambda) target
# value_loss = mse_loss(rollout_data_per.returns, values_pred)
# value_losses.append(value_loss.item())
#
# per_loss = self.vf_coef * value_loss
# losses_per.append(per_loss.item())
#
# # Optimization step
# progress_bar.set_description(f"Training, PER backwards | epoch")
# # self.policy.optimizer.zero_grad(set_to_none=True)
# # per_loss.backward()
# final_value_loss += per_loss
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
final_policy_loss = (policy_loss + self.ent_coef * entropy_loss) \
/ (self.batch_size / self.minibatch_size)
# ---- old position before adding clip fraction early stop ----
# Calculate approximate form of reverse KL Divergence for early stopping
# see issue #417: https://github.com/DLR-RM/stable-baselines3/issues/417
# and discussion in PR #419: https://github.com/DLR-RM/stable-baselines3/pull/419
# and Schulman blog: http://joschu.net/blog/kl-approx.html
# with no_grad():
# log_ratio = log_prob - rollout_data.old_log_prob
# approx_kl_div = mean((exp(log_ratio) - 1) - log_ratio).cpu().numpy()
# approx_kl_divs.append(approx_kl_div)
if isnan(last_kl_div):
raise ArithmeticError('Got nan in approx_kl_div')
if self.target_kl is not None and last_kl_div > 1.5 * self.target_kl:
continue_training = False
if self.verbose >= 1:
print(f"Early stopping at epoch {epoch}, batch {batch} due to reaching max kl: {last_kl_div:.2f}")
break
# Optimization step
progress_bar.set_description(f"Training, backwards | epoch")
# self.policy.value_optimizer.zero_grad(set_to_none=True)
# if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
# self.policy.policy_optimizer.zero_grad(set_to_none=True)
# final_value_loss.backward()
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
final_policy_loss.backward()
# gradients.append(self._get_flat_gradient())
# this is where we calculate the actual batch (optimizer step and etc.)
if final_minibatch:
batch += 1
# print("got final_minibatch")
# Clip grad norm
# th.nn.utils.clip_grad_norm_(self.policy.parameters(), self.max_grad_norm)
if self.max_grad_norm != 0:
progress_bar.set_description(f"Training, clipping grads | epoch")
clip_grad_norm_(self.policy.action_net.parameters(), self.max_grad_norm)
clip_grad_norm_(self.policy.mlp_extractor.policy_net.parameters(), self.max_grad_norm)
# utils_cgn(self.policy.mlp_extractor.policy_net.parameters(), self.max_grad_norm)
progress_bar.set_description(f"Training, optimizer step | epoch")
# self.policy.value_optimizer.step()
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
self.policy.policy_optimizer.step()
# self.policy.value_optimizer.zero_grad(set_to_none=True)
if self.policy.policy_optimizer.param_groups[0]['lr'] != 0:
self.policy.policy_optimizer.zero_grad(set_to_none=True)
# param_diffs.append(self._get_param_diff())
# del rollout_data
# if per_batch != 0:
# self.PERBuffer.add_epoch(1)
if not continue_training:
break
progress_bar.update(1)
# actual_epochs += 1
self._n_updates += 1
# to replicate functionality of where it was originally
# approx_kl_divs = []
try:
progress_bar.close()
except:
pass
# self._n_updates += actual_epochs
explained_var = explained_variance_torch(self.rollout_buffer.values.flatten(),
self.rollout_buffer.returns.flatten())
postcompute_act_extract = parameters_to_vector(self.policy.mlp_extractor.policy_net.parameters())
postcompute_act_pol = parameters_to_vector(self.policy.action_net.parameters())
postcompute_act = th_concatenate((postcompute_act_extract, postcompute_act_pol)).cpu()
val_dist = dist(precompute_val, postcompute_val).item()
act_dist = dist(precompute_act, postcompute_act).item()
# Logs
if len(pg_losses) != 0:
self.logger.record("train/entropy_loss", np_mean(entropy_losses))
else:
self.logger.record("train/entropy_loss", 0)
if len(pg_losses) != 0:
self.logger.record("train/policy_gradient_loss", np_mean(pg_losses))
else:
self.logger.record("train/policy_gradient_loss", 0)
self.logger.record("train/value_loss", np_mean(value_losses))
self.logger.record("train/approx_kl", np_mean(approx_kl_divs))
self.logger.record("train/last_kl_div", last_kl_div) # new
self.logger.record("train/clip_fraction", np_mean(clip_fractions))
self.logger.record("train/last_clip_fraction", last_clip_fraction) # new
self.logger.record("train/critic_update_magnitude", val_dist)
self.logger.record("train/actor_update_magnitude", act_dist)
# self.logger.record("train/loss", loss.item())
# new
# self.logger.record("train/loss_mean", np_mean(losses))
# self.logger.record("train/loss_max", np_max(losses))
# self.logger.record("train/loss_min", np_min(losses))
self.logger.record("train/returns_var", var(self.rollout_buffer.returns.flatten()).item())
# self.logger.record("train/last_off_policy_penalty", last_off_policy_penalty)
# self.logger.record("train/gradients_mean", np_mean(gradients))
# self.logger.record("train/gradients_max", np_max(gradients))
# self.logger.record("train/gradients_min", np_min(gradients))
# self.logger.record("train/params_diff_mean", np_mean(param_diffs))
# self.logger.record("train/params_diff_max", np_max(param_diffs))
# self.logger.record("train/params_diff_min", np_min(param_diffs))
#
self.logger.record("train/explained_variance", explained_var.item())
if hasattr(self.policy, "log_std"):
self.logger.record("train/std", exp(self.policy.log_std).mean().item())
self.logger.record("train/n_updates", self._n_updates, exclude="tensorboard")
self.logger.record("config/clip_range", clip_range)
if self.clip_range_vf is not None:
self.logger.record("config/clip_range_vf", clip_range_vf)
# new
self.logger.record("config/entropy_coef", self.ent_coef)
self.logger.record("config/n_epochs", self.n_epochs)
self.logger.record("config/batch_size", self.batch_size)
self.logger.record("config/critic_batch_size", self.critic_batch_size)
self.logger.record("config/minibatch_size", self.minibatch_size)
self.logger.record("config/gamma", self.gamma)
self.logger.record("config/gae_lambda", self.gae_lambda)
self.logger.record("config/buffer_size", self.n_steps*self.n_envs)
self.logger.record("config/max_grad_norm", self.max_grad_norm)
self.logger.record("config/policy_lr", self.policy.policy_optimizer.param_groups[0]['lr'])
self.logger.record("config/value_lr", self.policy.value_optimizer.param_groups[0]['lr'])
#
# PER stuff
# if per_batch != 0:
# self.logger.record("train/per_loss_mean", np_mean(losses_per))
# self.logger.record("train/PER_buffer_size", self.PERBuffer.value_est_err.size(dim=0))
#
# self.logger.record("train/PER_err_mean", mean(self.PERBuffer.value_est_err).item())
# self.logger.record("train/PER_err_max", max(self.PERBuffer.value_est_err).item())
# self.logger.record("train/PER_err_min", min(self.PERBuffer.value_est_err).item())
#
# self.logger.record("train/PER_mean_timestep", mean(self.PERBuffer.timestep).item())
# self.logger.record("train/PER_max_timestep", max(self.PERBuffer.timestep).item())
# self.logger.record("train/PER_min_timestep", min(self.PERBuffer.timestep).item())
#
def learn(
self,
total_timesteps: int,
callback: MaybeCallback = None,
log_interval: int = 1,
eval_env: Optional[GymEnv] = None,
eval_freq: int = -1,
n_eval_episodes: int = 5,
tb_log_name: str = "PPO",
eval_log_path: Optional[str] = None,
reset_num_timesteps: bool = True,
) -> "OnPolicyAlgorithm":
return super(PPO_Optim, self).learn(
total_timesteps=total_timesteps,
callback=callback,
log_interval=log_interval,
eval_env=eval_env,
eval_freq=eval_freq,
n_eval_episodes=n_eval_episodes,
tb_log_name=tb_log_name,
eval_log_path=eval_log_path,
reset_num_timesteps=reset_num_timesteps,
)