-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmodel.py
More file actions
293 lines (260 loc) · 9.83 KB
/
Copy pathmodel.py
File metadata and controls
293 lines (260 loc) · 9.83 KB
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
import torch
from torch import nn, optim
from torch.nn import functional as F
class ResBlk(nn.Module):
def __init__(self, kernels, chs):
"""
:param kernels: [1, 3, 3], as [kernel_1, kernel_2, kernel_3]
:param chs: [ch_in, 64, 64, 64], as [ch_in, ch_out1, ch_out2, ch_out3]
:return:
"""
assert len(chs)-1 == len(kernels), "mismatching between chs and kernels"
assert all(map(lambda x: x%2==1, kernels)), "odd kernel size only"
super(ResBlk, self).__init__()
layers = []
for idx in range(len(kernels)):
layers += [nn.Conv2d(chs[idx], chs[idx+1], kernels[idx], \
padding = kernels[idx]//2), \
nn.LeakyReLU(0.2, True)]
layers.pop() # remove last activation
self.net = nn.Sequential(*layers)
self.shortcut = nn.Sequential()
if chs[0] != chs[-1]: # convert from ch_int to ch_out3
self.shortcut = nn.Conv2d(chs[0], chs[-1], kernel_size=1)
self.outAct = nn.LeakyReLU(0.2, True)
def forward(self, x):
return self.outAct(self.shortcut(x) + self.net(x))
class Encoder(nn.Module):
def __init__(self, imgsz, ch, z_dim, io_ch=3):
"""
:param imgsz:
:param ch: base channels
:param z_dim: latent space dim
"""
super(Encoder, self).__init__()
self.layers = nn.ModuleList()
self.layers.append(nn.Sequential( \
nn.Conv2d(io_ch, ch, kernel_size=5, stride=1, padding=2),
nn.LeakyReLU(0.2, True),
nn.AvgPool2d(2, stride=None, padding=0)))
# [b, ch_cur, imgsz, imgsz] => [b, ch_next, mapsz, mapsz]
mapsz = imgsz // 2
ch_cur = ch
ch_next = ch_cur * 2
while mapsz > 8: # util [b, ch_, 8, 8]
# add resblk
self.layers.append(nn.Sequential( \
ResBlk([1, 3, 3], [ch_cur]+[ch_next]*3), \
nn.AvgPool2d(kernel_size=2, stride=None)))
mapsz = mapsz // 2
ch_cur = ch_next
ch_next = ch_next * 2 if ch_next < 512 else 512 # set max ch=512
# 8*8 -> 4*4
self.layers.append(nn.Sequential( \
ResBlk([3, 3], [ch_cur, ch_next, ch_next]), \
nn.AvgPool2d(kernel_size=2, stride=None)))
mapsz = mapsz // 2
# 4*4 -> 4*4
self.layers.append(nn.Sequential( \
ResBlk([3, 3], [ch_next, ch_next, ch_next])))
self.z_net = nn.Linear(ch_next*mapsz*mapsz, 2*z_dim)
# just for print
x = torch.randn(2, io_ch, imgsz, imgsz)
print('Encoder:', list(x.shape), end='=>')
with torch.no_grad():
for layer in self.layers[:-1]:
x = layer(x)
print(list(x.shape), end='=>')
x = self.layers[-1](x)
x = x.view(x.shape[0], -1)
print(list(x.shape), end='=>')
x = self.z_net(x)
print(list(x.shape), end='=>')
x = x.chunk(2, dim=1)
print(list(x[0].shape), list(x[1].shape))
#print(self.layers)
#print(self.z_net)
def forward(self, x):
"""
:param x:
:return:
"""
for layer in self.layers:
x = layer(x)
x = x.view(x.shape[0], -1)
mu, logvar = self.z_net(x).chunk(2, dim=1)
return mu, logvar
class Decoder(nn.Module):
def __init__(self, imgsz, ch, z_dim, io_ch=3):
"""
:param imgsz:
:param ch: base channels
:param z_dim: latent space dim
"""
super(Decoder, self).__init__()
self.layers = nn.ModuleList()
self.layers.insert(0, nn.Sequential( \
nn.Conv2d(ch, io_ch, kernel_size=5, stride=1, padding=2)))
self.layers.insert(0, nn.Sequential( \
nn.Upsample(scale_factor=2),
ResBlk([3, 3], [ch, ch, ch])))
mapsz = imgsz // 2
ch_cur = ch
ch_next = ch_cur * 2
while mapsz > 16: # util [b, ch_, 16, 16]
self.layers.insert(0, nn.Sequential( \
nn.Upsample(scale_factor=2),
ResBlk([1, 3, 3], [ch_next]+[ch_cur]*3)))
mapsz = mapsz // 2
ch_cur = ch_next
ch_next = ch_next * 2 if ch_next < 512 else 512 # set max ch=512
# 16*16, 8*8
for _ in range(2):
self.layers.insert(0, nn.Sequential( \
nn.Upsample(scale_factor=2),
ResBlk([3, 3], [ch_next]+[ch_cur]*2)))
mapsz = mapsz // 2
ch_cur = ch_next
ch_next = ch_next * 2 if ch_next < 512 else 512 # set max ch=512
# 4*4
self.layers.insert(0, nn.Sequential( \
ResBlk([3, 3], [ch_next]+[ch_cur]*2)))
# fc
self.z_net = nn.Sequential( \
nn.Linear(z_dim, ch_next*mapsz*mapsz),
nn.ReLU(True))
# just for print
x = torch.randn(2, z_dim)
print('Decoder:', list(x.shape), end='=>')
x = self.z_net(x)
print(list(x.shape), end='=>')
with torch.no_grad():
x = x.view(x.shape[0], -1, 4, 4)
x = self.layers[0](x)
for layer in self.layers[1:]:
print(list(x.shape), end='=>')
x = layer(x)
print(list(x.shape))
#print(self.z_net)
#print(self.layers)
def forward(self, x):
"""
:param x:
:return:
"""
x = self.z_net(x)
x = x.view(x.shape[0], -1, 4, 4)
for layer in self.layers:
x = layer(x)
return x
class IntroVAE(nn.Module):
def __init__(self, args):
super(IntroVAE, self).__init__()
imgsz = args.imgsz
z_dim = args.z_dim
# set first conv channel as 16
io_ch = 3 if args.num_classes < 0 else args.num_classes
self.encoder = Encoder(imgsz, 16, z_dim, io_ch)
self.decoder = Decoder(imgsz, 16, z_dim, io_ch)
self.alpha = args.alpha # for adversarial loss
self.beta = args.beta # for reconstruction loss
self.margin = args.margin # margin in eq. 11
self.z_dim = z_dim # z is the hidden vector while h is the output of encoder
self.optim_encoder = optim.Adam(self.encoder.parameters(), lr=args.lr)
self.optim_decoder = optim.Adam(self.decoder.parameters(), lr=args.lr)
def set_alpha_beta(self, alpha, beta):
"""
this func is for pre-training, to set alpha=0 to transfer to vilina vae.
:param alpha: for adversarial loss
:param beta: for reconstruction loss
:return:
"""
self.alpha = alpha
self.beta = beta
def reparam(self, mu, logvar):
# sample from normal dist
eps = torch.randn_like(mu)
# reparameterization trick
std = torch.exp(0.5*logvar)
z = mu + std * eps
return z
def kld(self, mu, logvar):
"""
compute the kl divergence between N(mu, std) and N(0, 1)
:return:
"""
kl = - 0.5 * (1 + logvar - mu.pow(2) - logvar.exp()).sum()/mu.shape[0]
return kl
def forward(self, x):
"""
The notation used here all come from Algorithm 1, page 6 of official paper.
can refer to Figure7 in page 15 as well.
:param x: [b, 3, 1024, 1024]
:return:
"""
# update inference model (encode)
for param in self.encoder.parameters():
param.requires_grad = True
for param in self.decoder.parameters():
param.requires_grad = False
# forward 1
mu, logvar = self.encoder(x)
z = self.reparam(mu, logvar)
xr = self.decoder(z)
mur, logvarr = self.encoder(xr.detach())
# forward 2
zp = torch.randn_like(z)
xp = self.decoder(zp)
mupp, logvarpp = self.encoder(xp.detach())
# backward
ae = (xr - x)**2
ae = 0.5*ae.view(ae.shape[0],-1).sum(dim=1).mean()
#ae = F.mse_loss(xr, x, reduction='sum')*0.5/x.shape[0]
reg = self.kld(mu, logvar)
regr = self.kld(mur, logvarr)
regpp = self.kld(mupp, logvarpp)
# 9. L^E_adv <- L_REG(Z) +
# \alpha{[m - L_REG(Z_r)]^+ + [m - L_REG(Z_pp)]^+}
if self.alpha != 0:
Eadv = reg + self.alpha*( \
F.relu(self.margin - regr) + \
F.relu(self.margin - regpp))
else:
Eadv = reg
# 10. update \phi_E with L^E_adv + \betaL_AE
self.optim_encoder.zero_grad()
(Eadv + self.beta*ae).backward()
self.optim_encoder.step()
# store
AE = ae.item()
E_real, E_rec, E_sam = reg.item(), regr.item(), regpp.item()
# update generator (decoder)
for param in self.encoder.parameters():
param.requires_grad = False
for param in self.decoder.parameters():
param.requires_grad = True
# forward 1
xr = self.decoder(z.detach())
mur, logvarr = self.encoder(xr)
# forward 2
xp = self.decoder(zp)
mupp, logvarpp = self.encoder(xp.detach())
# backward
#ae = F.mse_loss(xr, x, reduction='sum')/2
ae = (xr - x)**2
ae = 0.5*ae.view(ae.shape[0],-1).sum(dim=1).mean()
regr = self.kld(mur, logvarr)
regpp = self.kld(mupp, logvarpp)
# 12. L^G_adv <- \aplha{L_REG(Z_r)+L_REG(Z_pp)}
Gadv = 0 if self.alpha == 0 else self.alpha*(regr + regpp)
# 13 update \theta_G with L^G_adv + \betaL_AE
self.optim_decoder.zero_grad()
(Gadv + self.beta*ae).backward()
self.optim_decoder.step()
# store
G_rec, G_sam = regr.item(), regpp.item()
return xr.detach(), xp.detach(), \
AE, E_real, E_rec, E_sam, G_rec, G_sam
if __name__ == '__main__':
Encoder(128,16,256)
Decoder(128,16,256)