-
Notifications
You must be signed in to change notification settings - Fork 64
/
optim-lr_scheduler.R
781 lines (717 loc) · 26.1 KB
/
optim-lr_scheduler.R
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
#' @include optim.R
NULL
setdefault <- function(x, nm, default) {
if (is.null(x[[nm]])) {
x[[nm]] <- default
}
x
}
LRScheduler <- R6::R6Class(
"LRScheduler",
lock_objects = FALSE,
public = list(
initialize = function(optimizer, last_epoch = -1, verbose = FALSE) {
if (!is_optimizer(optimizer)) {
type_error("not an optimizer")
}
self$optimizer <- optimizer
if (last_epoch == -1) {
optimizer$param_groups <- lapply(
optimizer$param_groups,
function(group) {
setdefault(group, "initial_lr", group[["lr"]])
}
)
} else {
lapply(
optimizer$param_groups,
function(group) {
if (is.null(group[["initial_lr"]])) {
value_error("param 'inital_lr' not is not specified.")
}
}
)
}
self$base_lrs <- lapply(
optimizer$param_groups,
function(group) group[["initial_lr"]]
)
self$last_epoch <- last_epoch
self$verbose <- verbose
self$.step_count <- 0L
self$step()
},
state_dict = function() {
dict <- as.list(self)
dict <- dict[-which(names(dict) == "optimizer")]
# we also drop functions and environments
dict <- dict[!sapply(dict, is.function)]
dict <- dict[!sapply(dict, is.environment)]
dict
},
load_state_dict = function(state_dict) {
for (nm in names(state_dict)) {
self[[nm]] <- state_dict[[nm]]
}
},
get_last_lr = function() {
self$.last_lr
},
get_lr = function() {
not_implemented_error()
},
print_lr = function(is_verbose, group, lr) {
if (is_verbose) {
inform(sprintf("Adjusting learning rate of group %s to %.4f", group, lr))
}
},
step = function() {
self$.step_count <- self$.step_count + 1L
self$last_epoch <- self$last_epoch + 1
values <- self$get_lr()
for (i in seq_along(self$optimizer$param_groups)) {
self$optimizer$param_groups[[i]]$lr <- values[[i]]
self$print_lr(self$verbose, i, self$optimizer$param_groups[[i]]$lr)
}
self$.last_lr <- sapply(self$optimizer$param_groups, function(x) x$lr)
}
)
)
#' Creates learning rate schedulers
#'
#' @param classname optional name for the learning rate scheduler
#' @param inherit an optional learning rate scheduler to inherit from
#' @param ... named list of methods. You must implement the `get_lr()`
#' method that doesn't take any argument and returns learning rates
#' for each `param_group` in the optimizer.
#' @param parent_env passed to [R6::R6Class()].
#'
#' @export
lr_scheduler <- function(classname = NULL, inherit = LRScheduler, ...,
parent_env = parent.frame()) {
if (inherits(inherit, "lr_scheduler")) {
inherit <- attr(inherit, "scheduler")
}
e <- new.env(parent = parent_env)
e$inherit <- inherit
classes <- c(classname, "lr_scheduler")
Scheduler <- R6::R6Class(
classname = classname,
inherit = inherit,
lock_objects = FALSE,
public = list(
.classes = classes,
...
),
parent_env = e
)
init <- get_init(Scheduler)
fun <- rlang::new_function(
args = rlang::fn_fmls(init),
body = rlang::expr({
instance <- Scheduler$new(!!!rlang::fn_fmls_syms(init))
instance
})
)
attr(fun, "class") <- c(classes, "lr_scheduler_generator")
attr(fun, "scheduler") <- Scheduler
fun
}
#' Sets the learning rate of each parameter group to the initial lr
#' times a given function. When last_epoch=-1, sets initial lr as lr.
#'
#' @param optimizer (Optimizer): Wrapped optimizer.
#' @param lr_lambda (function or list): A function which computes a multiplicative
#' factor given an integer parameter epoch, or a list of such
#' functions, one for each group in optimizer.param_groups.
#' @param last_epoch (int): The index of last epoch. Default: -1.
#' @param verbose (bool): If `TRUE`, prints a message to stdout for
#' each update. Default: `FALSE`.
#'
#' @examples
#' # Assuming optimizer has two groups.
#' lambda1 <- function(epoch) epoch %/% 30
#' lambda2 <- function(epoch) 0.95^epoch
#' \dontrun{
#' scheduler <- lr_lambda(optimizer, lr_lambda = list(lambda1, lambda2))
#' for (epoch in 1:100) {
#' train(...)
#' validate(...)
#' scheduler$step()
#' }
#' }
#'
#' @export
lr_lambda <- lr_scheduler(
"lr_lambda",
initialize = function(optimizer, lr_lambda, last_epoch = -1, verbose = FALSE) {
self$optimizer <- optimizer
if (!is.list(lr_lambda)) {
self$lr_lambdas <- lapply(
seq_along(optimizer$param_groups),
function(i) lr_lambda
)
} else {
if (length(lr_lambda) != length(optimizer$param_groups)) {
i <- length(lr_lambda)
j <- length(optimizer$param_groups)
value_error(
"lr_lambda length ({i}) is different from the number of",
"optimizer$param_grpups ({j})"
)
}
self$lr_lambdas <- lr_lambda
}
super$initialize(optimizer, last_epoch, verbose)
},
get_lr = function() {
lrs <- as.numeric(self$base_lrs)
for (i in seq_along(lrs)) {
lrs[i] <- lrs[i] * self$lr_lambdas[[i]](self$last_epoch)
}
lrs
}
)
#' Multiply the learning rate of each parameter group by the factor given
#' in the specified function. When last_epoch=-1, sets initial lr as lr.
#'
#' @param optimizer (Optimizer): Wrapped optimizer.
#' @param lr_lambda (function or list): A function which computes a multiplicative
#' factor given an integer parameter epoch, or a list of such
#' functions, one for each group in optimizer.param_groups.
#' @param last_epoch (int): The index of last epoch. Default: -1.
#' @param verbose (bool): If `TRUE`, prints a message to stdout for
#' each update. Default: `FALSE`.
#'
#' @examples
#' \dontrun{
#' lmbda <- function(epoch) 0.95
#' scheduler <- lr_multiplicative(optimizer, lr_lambda = lmbda)
#' for (epoch in 1:100) {
#' train(...)
#' validate(...)
#' scheduler$step()
#' }
#' }
#'
#' @export
lr_multiplicative <- lr_scheduler(
"lr_multiplicative",
initialize = function(optimizer, lr_lambda, last_epoch = -1, verbose = FALSE) {
self$optimizer <- optimizer
if (!is.list(lr_lambda)) {
self$lr_lambdas <- lapply(
seq_along(optimizer$param_groups),
function(i) lr_lambda
)
} else {
if (length(lr_lambda) != length(optimizer$param_groups)) {
i <- length(lr_lambda)
j <- length(optimizer$param_groups)
value_error(
"lr_lambda length ({i}) is different from the number of",
"optimizer$param_grpups ({j})"
)
}
self$lr_lambdas <- lr_lambda
}
super$initialize(optimizer, last_epoch, verbose)
},
get_lr = function() {
if (self$last_epoch > 0) {
lrs <- numeric(length = length(self$optimizer$param_groups))
for (i in seq_along(self$optimizer$param_groups)) {
lrs[i] <- self$optimizer$param_groups[[i]]$lr * self$lr_lambdas[[i]](self$last_epoch)
}
} else {
lrs <- as.numeric(self$base_lrs)
}
lrs
}
)
#' Step learning rate decay
#'
#' Decays the learning rate of each parameter group by gamma every
#' step_size epochs. Notice that such decay can happen simultaneously with
#' other changes to the learning rate from outside this scheduler. When
#' last_epoch=-1, sets initial lr as lr.
#'
#'
#' @param optimizer (Optimizer): Wrapped optimizer.
#' @param step_size (int): Period of learning rate decay.
#' @param gamma (float): Multiplicative factor of learning rate decay.
#' Default: 0.1.
#' @param last_epoch (int): The index of last epoch. Default: -1.
#'
#' @examples
#' \dontrun{
#' # Assuming optimizer uses lr = 0.05 for all groups
#' # lr = 0.05 if epoch < 30
#' # lr = 0.005 if 30 <= epoch < 60
#' # lr = 0.0005 if 60 <= epoch < 90
#' # ...
#' scheduler <- lr_step(optimizer, step_size = 30, gamma = 0.1)
#' for (epoch in 1:100) {
#' train(...)
#' validate(...)
#' scheduler$step()
#' }
#' }
#'
#' @export
lr_step <- lr_scheduler(
"lr_step",
initialize = function(optimizer, step_size, gamma = 0.1, last_epoch = -1) {
self$step_size <- step_size
self$gamma <- gamma
super$initialize(optimizer, last_epoch)
},
get_lr = function() {
if ((self$last_epoch == 0) || (self$last_epoch %% self$step_size != 0)) {
return(sapply(self$optimizer$param_groups, function(x) x$lr))
}
sapply(self$optimizer$param_groups, function(x) x$lr * self$gamma)
}
)
#' Once cycle learning rate
#'
#' Sets the learning rate of each parameter group according to the
#' 1cycle learning rate policy. The 1cycle policy anneals the learning
#' rate from an initial learning rate to some maximum learning rate and then
#' from that maximum learning rate to some minimum learning rate much lower
#' than the initial learning rate.
#'
#' This policy was initially described in the paper
#' [Super-Convergence: Very Fast Training of Neural Networks Using Large Learning Rates](https://arxiv.org/abs/1708.07120).
#'
#' The 1cycle learning rate policy changes the learning rate after every batch.
#' `step` should be called after a batch has been used for training.
#' This scheduler is not chainable.
#'
#' Note also that the total number of steps in the cycle can be determined in one
#' of two ways (listed in order of precedence):
#'
#' - A value for total_steps is explicitly provided.
#' - A number of epochs (epochs) and a number of steps per epoch
#' (steps_per_epoch) are provided.
#'
#' In this case, the number of total steps is inferred by
#' total_steps = epochs * steps_per_epoch
#'
#' You must either provide a value for total_steps or provide a value for both
#' epochs and steps_per_epoch.
#'
#'
#' @param optimizer (Optimizer): Wrapped optimizer.
#' @param max_lr (float or list): Upper learning rate boundaries in the cycle
#' for each parameter group.
#' @param total_steps (int): The total number of steps in the cycle. Note that
#' if a value is not provided here, then it must be inferred by providing
#' a value for epochs and steps_per_epoch.
#' Default: NULL
#' @param epochs (int): The number of epochs to train for. This is used along
#' with steps_per_epoch in order to infer the total number of steps in the cycle
#' if a value for total_steps is not provided.
#' Default: NULL
#' @param steps_per_epoch (int): The number of steps per epoch to train for. This is
#' used along with epochs in order to infer the total number of steps in the
#' cycle if a value for total_steps is not provided.
#' Default: NULL
#' @param pct_start (float): The percentage of the cycle (in number of steps) spent
#' increasing the learning rate.
#' Default: 0.3
#' @param anneal_strategy (str): \{'cos', 'linear'\}
#' Specifies the annealing strategy: "cos" for cosine annealing, "linear" for
#' linear annealing.
#' Default: 'cos'
#' @param cycle_momentum (bool): If `TRUE`, momentum is cycled inversely
#' to learning rate between 'base_momentum' and 'max_momentum'.
#' Default: TRUE
#' @param base_momentum (float or list): Lower momentum boundaries in the cycle
#' for each parameter group. Note that momentum is cycled inversely
#' to learning rate; at the peak of a cycle, momentum is
#' 'base_momentum' and learning rate is 'max_lr'.
#' Default: 0.85
#' @param max_momentum (float or list): Upper momentum boundaries in the cycle
#' for each parameter group. Functionally,
#' it defines the cycle amplitude (max_momentum - base_momentum).
#' Note that momentum is cycled inversely
#' to learning rate; at the start of a cycle, momentum is 'max_momentum'
#' and learning rate is 'base_lr'
#' Default: 0.95
#' @param div_factor (float): Determines the initial learning rate via
#' initial_lr = max_lr/div_factor
#' Default: 25
#' @param final_div_factor (float): Determines the minimum learning rate via
#' min_lr = initial_lr/final_div_factor
#' Default: 1e4
#' @param last_epoch (int): The index of the last batch. This parameter is used when
#' resuming a training job. Since `step()` should be invoked after each
#' batch instead of after each epoch, this number represents the total
#' number of *batches* computed, not the total number of epochs computed.
#' When last_epoch=-1, the schedule is started from the beginning.
#' Default: -1
#' @param verbose (bool): If `TRUE`, prints a message to stdout for
#' each update. Default: `FALSE`.
#'
#' @examples
#' \dontrun{
#' data_loader <- dataloader(...)
#' optimizer <- optim_sgd(model$parameters, lr = 0.1, momentum = 0.9)
#' scheduler <- lr_one_cycle(optimizer,
#' max_lr = 0.01, steps_per_epoch = length(data_loader),
#' epochs = 10
#' )
#'
#' for (i in 1:epochs) {
#' coro::loop(for (batch in data_loader) {
#' train_batch(...)
#' scheduler$step()
#' })
#' }
#' }
#'
#' @export
lr_one_cycle <- lr_scheduler(
"lr_one_cycle",
initialize = function(optimizer,
max_lr,
total_steps = NULL,
epochs = NULL,
steps_per_epoch = NULL,
pct_start = 0.3,
anneal_strategy = "cos",
cycle_momentum = TRUE,
base_momentum = 0.85,
max_momentum = 0.95,
div_factor = 25.,
final_div_factor = 1e4,
last_epoch = -1,
verbose = FALSE) {
self$optimizer <- optimizer
# Validate total_steps
if (is.null(total_steps) && is.null(epochs) && is.null(steps_per_epoch)) {
value_error("You must define either total_steps OR (epochs AND steps_per_epoch)")
} else if (!is.null(total_steps)) {
if (!is.numeric(total_steps) || total_steps <= 0) {
value_error("Expected positive integer total_steps, but got {total_steps}")
}
self$total_steps <- total_steps
} else {
if (!is.numeric(epochs) || epochs <= 0) {
value_error("Expected positive integer epochs, but got {epochs}")
}
if (!is.numeric(steps_per_epoch) || steps_per_epoch <= 0) {
value_error("Expected positive integer steps_per_epoch, but got {steps_per_epoch}")
}
self$total_steps <- epochs * steps_per_epoch
}
self$step_size_up <- (pct_start * self$total_steps) - 1
self$step_size_down <- (self$total_steps - self$step_size_up) - 1
# Validate pct_start
if (!is.numeric(pct_start) || pct_start < 0 || pct_start > 1) {
value_error("Expected float between 0 and 1 pct_start, but got {pct_start}")
}
# Validate anneal_strategy
if (!anneal_strategy %in% c("cos", "linear")) {
value_error("anneal_strategy must by one of 'cos' or 'linear', instead got {anneal_strategy}")
} else if (anneal_strategy == "cos") {
self$anneal_func <- self$.annealing_cos
} else if (anneal_strategy == "linear") {
self.anneal_func <- self$.annealing_linear
}
# Initialize learning rate variables
max_lrs <- self$.format_param("max_lr", self$optimizer, max_lr)
if (last_epoch == -1) {
for (i in seq_along(self$optimizer$param_groups)) {
self$optimizer$param_groups[[i]][["initial_lr"]] <- max_lrs[[i]] / div_factor
self$optimizer$param_groups[[i]][["max_lr"]] <- max_lrs[[i]]
self$optimizer$param_groups[[i]][["min_lr"]] <- self$optimizer$param_groups[[i]][["initial_lr"]] /
final_div_factor
}
}
# Initialize momentum variables
self$cycle_momentum <- cycle_momentum
if (self$cycle_momentum) {
if ((!"momentum" %in% names(self$optimizer$defaults)) &&
!("betas" %in% names(self$optimizer$defaults))) {
value_error("optimizer must support momentum with `cycle momentum` enabled")
}
self$use_beta1 <- "betas" %in% names(self$optimizer$defaults)
max_momentums <- self$.format_param("max_momentum", optimizer, max_momentum)
base_momentums <- self$.format_param("base_momentum", optimizer, base_momentum)
if (last_epoch == -1) {
for (i in seq_along(self$optimizer$param_groups)) {
if (self$use_beta1) {
beta2 <- self$optimizer$param_groups[[i]]$betas[[2]]
self$optimizer$param_groups[[i]]$betas <- c(max_momentum[[i]], beta2)
} else {
self$optimizer$param_groups[[i]]$momentum <- max_momentum[[i]]
}
self$optimizer$param_groups[[i]]$max_momentum <- max_momentum[[i]]
self$optimizer$param_groups[[i]]$base_momentum <- base_momentums[[i]]
}
}
}
super$initialize(optimizer, last_epoch, verbose)
},
.format_param = function(name, optimizer, param) {
if (is.list(param) || length(param) > 1) {
if (length(param) != length(optimizer$param_groups)) {
value_error(
"expected {length(optimizer$param_groups)} values for {name}",
"but got {length(param)}"
)
}
return(param)
} else {
return(lapply(seq_along(optimizer$param_groups), function(x) param))
}
},
.annealing_cos = function(start, end, pct) {
cos_out <- cos(pi * pct) + 1
end + (start - end) / 2.0 * cos_out
},
.annealing_linear = function(start, end, pct) {
(end - start) * pct + start
},
get_lr = function() {
lrs <- list()
step_num <- self$last_epoch
if (step_num > self$total_steps) {
value_error(
"Tried to step {step_num+1} times. The specified number of total steps is {self$total_steps}"
)
}
for (i in seq_along(self$optimizer$param_groups)) {
if (step_num <= self$step_size_up) {
computed_lr <- self$anneal_func(
self$optimizer$param_groups[[i]][["initial_lr"]],
self$optimizer$param_groups[[i]][["max_lr"]],
step_num / self$step_size_up
)
if (self$cycle_momentum) {
computed_momentum <- self$anneal_func(
self$optimizer$param_groups[[i]][["max_momentum"]],
self$optimizer$param_groups[[i]][["base_momentum"]],
step_num / self$step_size_up
)
}
} else {
down_step_num <- step_num - self$step_size_up
computed_lr <- self$anneal_func(
self$optimizer$param_groups[[i]][["max_lr"]],
self$optimizer$param_groups[[i]][["min_lr"]],
down_step_num / self$step_size_down
)
if (self$cycle_momentum) {
computed_momentum <- self$anneal_func(
self$optimizer$param_groups[[i]][["base_momentum"]],
self$optimizer$param_groups[[i]][["max_momentum"]],
down_step_num / self$step_size_down
)
}
}
lrs[[i]] <- computed_lr
if (self$cycle_momentum) {
if (self$use_beta1) {
beta2 <- self$optimizer$param_groups[[i]][["betas"]][[2]]
self$optimizer$param_groups[[i]][["betas"]] <- c(computed_momentum, beta2)
} else {
self$optimizer$param_groups[[i]][["momentum"]] <- computed_momentum
}
}
}
as.numeric(lrs)
}
)
#' Reduce learning rate on plateau
#'
#' Reduce learning rate when a metric has stopped improving.
#' Models often benefit from reducing the learning rate by a factor
#' of 2-10 once learning stagnates. This scheduler reads a metrics
#' quantity and if no improvement is seen for a 'patience' number
#' of epochs, the learning rate is reduced.
#'
#' @param optimizer (Optimizer): Wrapped optimizer.
#' @param mode (str): One of `min`, `max`. In `min` mode, lr will be reduced
#' when the quantity monitored has stopped decreasing; in `max` mode it will be
#' reduced when the quantity monitored has stopped increasing. Default: 'min'.
#' @param factor (float): Factor by which the learning rate will be reduced.
#' new_lr <- lr * factor. Default: 0.1.
#' @param patience (int): Number of epochs with no improvement after which
#' learning rate will be reduced. For example, if `patience = 2`, then we will
#' ignore the first 2 epochs with no improvement, and will only decrease the LR
#' after the 3rd epoch if the loss still hasn't improved then. Default: 10.
#' @param threshold (float):Threshold for measuring the new optimum, to only
#' focus on significant changes. Default: 1e-4.
#' @param threshold_mode (str): One of `rel`, `abs`. In `rel` mode,
#' dynamic_threshold <- best * ( 1 + threshold ) in 'max' mode
#' or best * ( 1 - threshold ) in `min` mode. In `abs` mode,
#' dynamic_threshold <- best + threshold in `max` mode or
#' best - threshold in `min` mode. Default: 'rel'.
#' @param cooldown (int): Number of epochs to wait before resuming normal
#' operation after lr has been reduced. Default: 0.
#' @param min_lr (float or list): A scalar or a list of scalars. A lower bound
#' on the learning rate of all param groups or each group respectively. Default: 0.
#' @param eps (float): Minimal decay applied to lr. If the difference between
#' new and old lr is smaller than eps, the update is ignored. Default: 1e-8.
#' @param verbose (bool): If `TRUE`, prints a message to stdout for
#' each update. Default: `FALSE`.
#'
#' @examples
#' \dontrun{
#' optimizer <- optim_sgd(model$parameters(), lr=0.1, momentum=0.9)
#' scheduler <- lr_reduce_on_plateau(optimizer, 'min')
#' for (epoch in 1:10) {
#' train(...)
#' val_loss <- validate(...)
#' # note that step should be called after validate
#' scheduler$step(val_loss)
#' }
#' }
#' @export
lr_reduce_on_plateau <- lr_scheduler(
"lr_reduce_on_plateau",
initialize = function(optimizer, mode='min', factor=0.1, patience=10,
threshold=1e-4, threshold_mode='rel', cooldown=0,
min_lr=0, eps=1e-8, verbose=FALSE) {
if (factor>=1.0) {
value_error('Factor should be < 1.0')
}
self$factor <- factor
self$optimizer <- optimizer
if (is.list(min_lr)) {
if (length(min_lr) != length(optimizer$param_groups)) {
value_error("expected {length(optimizer$param_groups} min_lrs, got {length(min_lr)}")
}
self$min_lrs <- list(min_lr)
}
else {
self$min_lrs <- rep(list(min_lr), length(optimizer$param_groups))
}
self$patience <- patience
self$verbose <- verbose
self$cooldown <- cooldown
self$cooldown_counter <- 0
self$mode <- mode
self$threshold <- threshold
self$threshold_mode <- threshold_mode
self$best <- NULL
self$num_bad_epochs <- NULL
self$mode_worse <- NULL
self$eps <- eps
self$last_epoch <- 0
self$.init_is_better(mode=mode, threshold=threshold,
threshold_mode=threshold_mode)
self$.reset()
},
step = function(metrics) {
current <- as.numeric(metrics)
epoch <- self$last_epoch + 1
self$last_epoch <- epoch
if (self$.is_better(current, self$best)) {
self$best <- current
self$num_bad_epochs <- 0
} else {
self$num_bad_epochs <- self$num_bad_epochs + 1
}
if (self$.in_cooldown()) {
self$cooldown_counter <- self$cooldown_counter - 1
self$num_bad_epochs <- 0
}
if (self$num_bad_epochs > self$patience) {
self$.reduce_lr(epoch)
self$cooldown_counter <- self$cooldown
self$num_bad_epochs <- 0
}
self$.last_lr <- sapply(self$optimizer$param_groups, function(x) x$lr)
},
.reduce_lr = function(epoch) {
for (i in seq_along(self$optimizer$param_groups)) {
old_lr <- as.numeric(self$optimizer$param_groups[[i]]$lr)
new_lr <- max(old_lr * self$factor, self$min_lrs[[i]])
if ((old_lr - new_lr) > self$eps) {
self$optimizer$param_groups[[i]]$lr <- new_lr
if (self$verbose) {
inform(sprintf("Epoch %s: reducing learning rate of group %s to %.4e", epoch, i, new_lr))
}
}
}
},
.in_cooldown = function() {
return(self$cooldown_counter > 0)
},
.is_better = function(a, best) {
if ((self$mode == 'min') && (self$threshold_mode == 'rel')) {
rel_epsilon <- 1 - self$threshold
return(a < (best * rel_epsilon))
} else if ((self$mode == 'min') && (self$threshold_mode == 'abs')) {
return(a < (best - self$threshold))
} else if ((self$mode == 'max') && (self$threshold_mode == 'rel')) {
rel_epsilon <- self$threshold + 1
return (a > (best * rel_epsilon))
} else {
return (a > (best + self$threshold))
}
},
.init_is_better = function(mode, threshold, threshold_mode) {
if (!mode %in% list('min', 'max')) {
value_error("mode {mode} is unknown!")
}
if (!threshold_mode %in% list('rel', 'abs')) {
value_error("threshold mode {threshold_mode} is unknown!")
}
if (mode == 'min') {
self$mode_worse <- Inf
} else {
self$mode_worse <- -Inf
}
self$mode <- mode
self$threshold <- threshold
self$threshold_mode <- threshold_mode
},
.reset = function() {
self$best <- self$mode_worse
self$cooldown_counter <- 0
self$num_bad_epochs <- 0
}
)
#' Set the learning rate of each parameter group using a cosine annealing schedule
#'
#' @param T_max Maximum number of iterations
#' @param eta_min Minimum learning rate. Default: 0.
#' @param last_epoch The index of the last epoch
#'
#' @inheritParams lr_reduce_on_plateau
#' @export
lr_cosine_annealing <- lr_scheduler(
"lr_cosine_annealing",
initialize = function(optimizer, T_max, eta_min=0, last_epoch=-1, verbose=FALSE) {
self$T_max <- T_max
self$eta_min <- eta_min
super$initialize(optimizer, last_epoch, verbose)
},
get_lr = function() {
if (self$last_epoch == 0) {
return(lapply(self$optimizer$param_groups, function(x) x[["lr"]]))
} else if (self$.step_count == 1 && self$last_epoch > 0) {
lapply(self$base_lrs, function(group, base_lr) {
self$eta_min +
(base_lr - self$eta_min) *
(1 + cos(self$last_epoch * pi / self$T_max)) /
2
})
} else if ((self$last_epoch -1 - self$T_max) %% (2 * self$T_max) == 0) {
map2(self$optimizer$param_groups, self$base_lrs, function(group, base_lr) {
group[["lr"]] + (base_lr - self$eta_min) * (1 - cos(pi / self$T_max)) / 2
})
} else {
lapply(self$optimizer$param_groups, function(group) {
(1 + cos(pi * self$last_epoch / self$T_max)) /
(1 + cos(pi * (self$last_epoch - 1) / self$T_max)) *
(group[['lr']] - self$eta_min) + self$eta_min
})
}
}
)