radam.py 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  1. """RAdam Optimizer.
  2. Implementation lifted from: https://github.com/LiyuanLucasLiu/RAdam
  3. Paper: `On the Variance of the Adaptive Learning Rate and Beyond` - https://arxiv.org/abs/1908.03265
  4. NOTE: This impl has been deprecated in favour of torch.optim.RAdam and remains as a reference
  5. """
  6. import math
  7. import torch
  8. from torch.optim.optimizer import Optimizer
  9. class RAdamLegacy(Optimizer):
  10. """ PyTorch RAdam optimizer
  11. NOTE: This impl has been deprecated in favour of torch.optim.AdamW and remains as a reference
  12. """
  13. def __init__(
  14. self,
  15. params,
  16. lr=1e-3,
  17. betas=(0.9, 0.999),
  18. eps=1e-8,
  19. weight_decay=0,
  20. ):
  21. defaults = dict(
  22. lr=lr,
  23. betas=betas,
  24. eps=eps,
  25. weight_decay=weight_decay,
  26. buffer=[[None, None, None] for _ in range(10)]
  27. )
  28. super(RAdamLegacy, self).__init__(params, defaults)
  29. def __setstate__(self, state):
  30. super(RAdamLegacy, self).__setstate__(state)
  31. @torch.no_grad()
  32. def step(self, closure=None):
  33. loss = None
  34. if closure is not None:
  35. with torch.enable_grad():
  36. loss = closure()
  37. for group in self.param_groups:
  38. for p in group['params']:
  39. if p.grad is None:
  40. continue
  41. grad = p.grad.float()
  42. if grad.is_sparse:
  43. raise RuntimeError('RAdam does not support sparse gradients')
  44. p_fp32 = p.float()
  45. state = self.state[p]
  46. if len(state) == 0:
  47. state['step'] = 0
  48. state['exp_avg'] = torch.zeros_like(p_fp32)
  49. state['exp_avg_sq'] = torch.zeros_like(p_fp32)
  50. else:
  51. state['exp_avg'] = state['exp_avg'].type_as(p_fp32)
  52. state['exp_avg_sq'] = state['exp_avg_sq'].type_as(p_fp32)
  53. exp_avg, exp_avg_sq = state['exp_avg'], state['exp_avg_sq']
  54. beta1, beta2 = group['betas']
  55. exp_avg_sq.mul_(beta2).addcmul_(grad, grad, value=1 - beta2)
  56. exp_avg.mul_(beta1).add_(grad, alpha=1 - beta1)
  57. state['step'] += 1
  58. buffered = group['buffer'][int(state['step'] % 10)]
  59. if state['step'] == buffered[0]:
  60. num_sma, step_size = buffered[1], buffered[2]
  61. else:
  62. buffered[0] = state['step']
  63. beta2_t = beta2 ** state['step']
  64. num_sma_max = 2 / (1 - beta2) - 1
  65. num_sma = num_sma_max - 2 * state['step'] * beta2_t / (1 - beta2_t)
  66. buffered[1] = num_sma
  67. # more conservative since it's an approximated value
  68. if num_sma >= 5:
  69. step_size = group['lr'] * math.sqrt(
  70. (1 - beta2_t) *
  71. (num_sma - 4) / (num_sma_max - 4) *
  72. (num_sma - 2) / num_sma *
  73. num_sma_max / (num_sma_max - 2)) / (1 - beta1 ** state['step'])
  74. else:
  75. step_size = group['lr'] / (1 - beta1 ** state['step'])
  76. buffered[2] = step_size
  77. if group['weight_decay'] != 0:
  78. p_fp32.add_(p_fp32, alpha=-group['weight_decay'] * group['lr'])
  79. # more conservative since it's an approximated value
  80. if num_sma >= 5:
  81. denom = exp_avg_sq.sqrt().add_(group['eps'])
  82. p_fp32.addcdiv_(exp_avg, denom, value=-step_size)
  83. else:
  84. p_fp32.add_(exp_avg, alpha=-step_size)
  85. p.copy_(p_fp32)
  86. return loss