-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathop_adam_lop_sgdn.py
117 lines (93 loc) · 5.13 KB
/
op_adam_lop_sgdn.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
import math
import torch
from torch.optim.optimizer import Optimizer
class op_Adam_lop_Sgdn(Optimizer):
"""Implements Adam algorithm.
It has been proposed in `Adam: A Method for Stochastic Optimization`_.
Arguments:
params (iterable): iterable of parameters to optimize or dicts defining
parameter groups
lr (float, optional): learning rate (default: 1e-3)
betas (Tuple[float, float], optional): coefficients used for computing
running averages of gradient and its square (default: (0.9, 0.999))
eps (float, optional): term added to the denominator to improve
numerical stability (default: 1e-8)
weight_decay (float, optional): weight decay (L2 penalty) (default: 0)
hypergrad_lr (float, optional): hypergradient learning rate for the online
tuning of the learning rate, introduced in the paper
`Online Learning Rate Adaptation with Hypergradient Descent`_
.. _Adam\: A Method for Stochastic Optimization:
https://arxiv.org/abs/1412.6980
.. _Online Learning Rate Adaptation with Hypergradient Descent:
https://openreview.net/forum?id=BkrsAzWAb
"""
def __init__(self, params, lr=1e-3, betas=(0.9, 0.999), eps=1e-8, momentum_h=0.9, dampening_h=0, nesterov_h=True,
weight_decay=0, hypergrad_lr=1e-8):
defaults = dict(lr=lr, betas=betas, eps=eps, momentum_h=momentum_h, dampening_h=dampening_h, nesterov_h=nesterov_h,
weight_decay=weight_decay, hypergrad_lr=hypergrad_lr)
super(op_Adam_lop_Sgdn, self).__init__(params, defaults)
def step(self, closure=None):
"""Performs a single optimization step.
Arguments:
closure (callable, optional): A closure that reevaluates the model
and returns the loss.
"""
loss = None
if closure is not None:
loss = closure()
for group in self.param_groups:
for p in group['params']:
if p.grad is None:
continue
grad = p.grad.data
if grad.is_sparse:
raise RuntimeError('op_Adam_lop_Sgdn does not support sparse gradients, please consider SparseAdam instead')
state = self.state[p]
# State initialization
if len(state) == 0:
state['step'] = 0
# Exponential moving average of gradient values
state['exp_avg'] = torch.zeros_like(p.data)
# Exponential moving average of squared gradient values
state['exp_avg_sq'] = torch.zeros_like(p.data)
# Accumulated momentum for the hypergradient
state['momentum_buffer_h'] = grad.new_tensor(0)
exp_avg, exp_avg_sq = state['exp_avg'], state['exp_avg_sq']
beta1, beta2 = group['betas']
state['step'] += 1
if group['weight_decay'] != 0:
grad = grad.add(group['weight_decay'], p.data)
if state['step'] > 1:
prev_bias_correction1 = 1 - beta1 ** (state['step'] - 1)
prev_bias_correction2 = 1 - beta2 ** (state['step'] - 1)
# Hypergradient for Adam optimizer:
h = torch.dot(grad.view(-1), torch.div(exp_avg, exp_avg_sq.sqrt().add_(group['eps'])).view(-1)) * math.sqrt(prev_bias_correction2) / prev_bias_correction1
h = -h
''' Hypergradient Descent with momentum (HD momentum) coefficients
Parameters
-----------
momentum_h : momentum coefficient for the hypergradient
dampening_h : dampening coefficient for the hypergradient
nesterov_h : bool, if true : use nesterov momentum for the l.r update, else use sgd + momemtum
'''
momentum_h = group['momentum_h']
dampening_h = group['dampening_h']
nesterov_h = group['nesterov_h']
# Hypergradient descent with momentum (HD momentum) for the learning rate
if momentum_h:
buf_h = state['momentum_buffer_h']
buf_h.mul_(momentum_h).add_(1 - dampening_h, h)
if nesterov_h:
h.add_(momentum_h, buf_h)
else:
h = buf_h
group['lr'] -= group['hypergrad_lr'] * h
# Decay the first and second moment running average coefficient
exp_avg.mul_(beta1).add_(1 - beta1, grad)
exp_avg_sq.mul_(beta2).addcmul_(1 - beta2, grad, grad)
denom = exp_avg_sq.sqrt().add_(group['eps'])
bias_correction1 = 1 - beta1 ** state['step']
bias_correction2 = 1 - beta2 ** state['step']
step_size = group['lr'] * math.sqrt(bias_correction2) / bias_correction1
p.data.addcdiv_(-step_size, exp_avg, denom)
return loss