lr_scheduler.py 3.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
  1. import numpy as np
  2. class LambdaWarmUpCosineScheduler:
  3. """
  4. note: use with a base_lr of 1.0
  5. """
  6. def __init__(self, warm_up_steps, lr_min, lr_max, lr_start, max_decay_steps, verbosity_interval=0):
  7. self.lr_warm_up_steps = warm_up_steps
  8. self.lr_start = lr_start
  9. self.lr_min = lr_min
  10. self.lr_max = lr_max
  11. self.lr_max_decay_steps = max_decay_steps
  12. self.last_lr = 0.
  13. self.verbosity_interval = verbosity_interval
  14. def schedule(self, n, **kwargs):
  15. if self.verbosity_interval > 0:
  16. if n % self.verbosity_interval == 0: print(f"current step: {n}, recent lr-multiplier: {self.last_lr}")
  17. if n < self.lr_warm_up_steps:
  18. lr = (self.lr_max - self.lr_start) / self.lr_warm_up_steps * n + self.lr_start
  19. self.last_lr = lr
  20. return lr
  21. else:
  22. t = (n - self.lr_warm_up_steps) / (self.lr_max_decay_steps - self.lr_warm_up_steps)
  23. t = min(t, 1.0)
  24. lr = self.lr_min + 0.5 * (self.lr_max - self.lr_min) * (
  25. 1 + np.cos(t * np.pi))
  26. self.last_lr = lr
  27. return lr
  28. def __call__(self, n, **kwargs):
  29. return self.schedule(n,**kwargs)
  30. class LambdaWarmUpCosineScheduler2:
  31. """
  32. supports repeated iterations, configurable via lists
  33. note: use with a base_lr of 1.0.
  34. """
  35. def __init__(self, warm_up_steps, f_min, f_max, f_start, cycle_lengths, verbosity_interval=0):
  36. assert len(warm_up_steps) == len(f_min) == len(f_max) == len(f_start) == len(cycle_lengths)
  37. self.lr_warm_up_steps = warm_up_steps
  38. self.f_start = f_start
  39. self.f_min = f_min
  40. self.f_max = f_max
  41. self.cycle_lengths = cycle_lengths
  42. self.cum_cycles = np.cumsum([0] + list(self.cycle_lengths))
  43. self.last_f = 0.
  44. self.verbosity_interval = verbosity_interval
  45. def find_in_interval(self, n):
  46. interval = 0
  47. for cl in self.cum_cycles[1:]:
  48. if n <= cl:
  49. return interval
  50. interval += 1
  51. def schedule(self, n, **kwargs):
  52. cycle = self.find_in_interval(n)
  53. n = n - self.cum_cycles[cycle]
  54. if self.verbosity_interval > 0:
  55. if n % self.verbosity_interval == 0: print(f"current step: {n}, recent lr-multiplier: {self.last_f}, "
  56. f"current cycle {cycle}")
  57. if n < self.lr_warm_up_steps[cycle]:
  58. f = (self.f_max[cycle] - self.f_start[cycle]) / self.lr_warm_up_steps[cycle] * n + self.f_start[cycle]
  59. self.last_f = f
  60. return f
  61. else:
  62. t = (n - self.lr_warm_up_steps[cycle]) / (self.cycle_lengths[cycle] - self.lr_warm_up_steps[cycle])
  63. t = min(t, 1.0)
  64. f = self.f_min[cycle] + 0.5 * (self.f_max[cycle] - self.f_min[cycle]) * (
  65. 1 + np.cos(t * np.pi))
  66. self.last_f = f
  67. return f
  68. def __call__(self, n, **kwargs):
  69. return self.schedule(n, **kwargs)
  70. class LambdaLinearScheduler(LambdaWarmUpCosineScheduler2):
  71. def schedule(self, n, **kwargs):
  72. cycle = self.find_in_interval(n)
  73. n = n - self.cum_cycles[cycle]
  74. if self.verbosity_interval > 0:
  75. if n % self.verbosity_interval == 0: print(f"current step: {n}, recent lr-multiplier: {self.last_f}, "
  76. f"current cycle {cycle}")
  77. if n < self.lr_warm_up_steps[cycle]:
  78. f = (self.f_max[cycle] - self.f_start[cycle]) / self.lr_warm_up_steps[cycle] * n + self.f_start[cycle]
  79. self.last_f = f
  80. return f
  81. else:
  82. f = self.f_min[cycle] + (self.f_max[cycle] - self.f_min[cycle]) * (self.cycle_lengths[cycle] - n) / (self.cycle_lengths[cycle])
  83. self.last_f = f
  84. return f