-
Notifications
You must be signed in to change notification settings - Fork 0
/
Metric_Strength_Test.jl
496 lines (265 loc) · 11.2 KB
/
Metric_Strength_Test.jl
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
#Here we will examine what happens if we set threshold MSE's to continue the process until reached:
include("XOR_MD.jl")
include("Kernals.jl")
include("gaussian_process.jl")
#Set the random seed:
#Seed for stalzer srand(1234)
"""
We will compare the effect of randomly selecting a learning rate and sigmoid
hyperparameter vs the use of Bayesian Optimization for finding the optimial values wrt the MSE.
Suppose we have limited computing time of 100000 epochs and that we have N tries to
minimise the MSE. Let us say that the learning rate is between a and b
"""
#Initialise Layers and params ==========================================
Layer_1=uniform(0,1,2,2)
Layer_2=uniform(0,1,2,1)
epochs=1000 # was 1000 below, please change back
a=0.001 #Change to 0.001
b=1
c=0.001 #Was the same as above
d=1
N=20 #dont need to change this from the file XOR_Timings as we know it converges within 6 attemps
MSE_Threshold=0.177
#This is the MSE threshold for random to achieve
ThresholdN=10000000 (#We origionally let the random search have 10,000 attempts and at that stage we stop it)
#Curry the sigmoid functions:
#Curry the sigmoid functions:
function hyper_curry(h)
return (x->sigmoid(x,h))
end
function hyper_curry_deriv(h)
return (x->sigmoid_deriv(x,h))
end
Bayesian_Times=zeros(N)
Random_Times=[]
"""
Section 1 -- Run the random section one time to remove compiling timing error
"""
z
# Random Learning Rates First run to remove compiler error!! ========================================
Random_Learning_Rates=uniform(a,b,ThresholdN,1)
Random_Hyperparameters=uniform(c,d,ThresholdN,1)
Random_Mat=cat(2,Random_Learning_Rates,Random_Hyperparameters)
Random_MSE=ones(ThresholdN)
time_so_far=0
#Random_Mat conjoins Random_Learning_Rates and Random_Hyperparameters
# Random_Mat is a Nx2 matrix where Random_Mat[1,:] is the first entry
#with LR_1 and hyperparemeter 1.
for i=1:length(Random_Learning_Rates)
tic()
node_function=hyper_curry(Random_Mat[i,2])
node_deriv=hyper_curry_deriv(Random_Mat[i,2])
learning_rate=Random_Mat[i,1]
one_net=Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]
push!(Random_MSE,one_net)
if one_net<MSE_Threshold
println("Threshold value has been reached upon search ",i)
break
end
time_so_far+=toc()
println("==========================")
println("Completed pre-run cycle ",i, " of ",length(Random_Learning_Rates))
println("==========================")
println("Current Time of pre-run elapsed ",time_so_far)
end
# """
# Section 2-- Run the random selection but this time timing the whole process
# """
srand(1234)
Random_Learning_Rates=uniform(a,b,ThresholdN,1)
Random_Hyperparameters=uniform(c,d,ThresholdN,1)
Random_Mat=cat(2,Random_Learning_Rates,Random_Hyperparameters)
Random_MSE=[]
q=0
non_convergance=0
convergance_val=0
for i=1:length(Random_Learning_Rates)
tic()
node_function=hyper_curry(Random_Mat[i,2])
node_deriv=hyper_curry_deriv(Random_Mat[i,2])
learning_rate=Random_Mat[i,1]
one_net=Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]
push!(Random_MSE,one_net)
q+=toc()
push!(Random_Times,q)
if one_net<MSE_Threshold
println("Threshold value has been reached upon search ",i)
convergance_val=i
println("onenet = ",one_net)
break
end
if i==length(Random_Learning_Rates)
non_convergance+=1
end
println("==========================")
println("Completed cycle ",i, " of ",length(Random_Learning_Rates))
println("==========================")
println("Current time elapsed ",q)
end
if non_convergance==0
println("Random Learning Rates Training Completed with convergance upon selection ", convergance_val)
else
println("Random Learning Rates did not converge within the desired threshold value")
end
srand(123)
using PyPlot
# fig = figure("pyplot_subplot_mixed",figsize=(7,7))
ax=axes()
surf(reshape(Random_Learning_Rates[1:1:length(Random_MSE)],size(Random_MSE)),reshape(Random_Hyperparameters[1:1:length(Random_MSE)],size(Random_MSE)),Random_MSE,alpha=0.65,color="#40d5bb")
title("MSE for Randomly Selected")
xlabel("Learning Rate")
ylabel("Hyper-Parameter")
zlabel("Mean Square Error")
grid("on")
show()
# """
# Section 3 - Run Bayesian Opt one time to remove compiler problems
# """
#Initialise Layers and params ==========================================
LR_Test=linspace(a,b,50)
HP_Test=linspace(c,d,50)
#Here is the carteisan product of these written as a vector
Test=gen_points([LR_Test,HP_Test])[1]
#We first have to pick a random point to begin bayesian optimization:
#currently starts with the midpoint, possibly randomise this:
Bayesian_Points=[Test[Int(round(length(Test)/2))]]
#Here we reset the values:
# =====================================================================
#Initialise Layers and params ==========================================
LR_Test=linspace(a,b,50)
HP_Test=linspace(c,d,50)
#Here is the carteisan product of these written as a vector
Test=gen_points([LR_Test,HP_Test])[1]
#This is the break point
#We first have to pick a random point to begin bayesian optimization:
#currently starts with the midpoint, possibly randomise this:
Bayesian_Points=[Test[Int(round(length(Test)/2))]]
#Bayesian_Points is an vector of arrays where in each array first entry is LR second entry is Hyper-Parameters:
#Define hyperparemeter functions:
node_function=hyper_curry(Bayesian_Points[1][2])
node_deriv=hyper_curry_deriv(Bayesian_Points[1][2])
#Define Learning Rate:
learning_rate=Bayesian_Points[1][1]
#Run first train before Bayesian Optimization:
Bayesian_MSE=[Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]]
# =========================================================================
for k=2:N
D=[(Bayesian_Points[i],Bayesian_MSE[i]) for i=1:length(Bayesian_Points)]
mu, sigma, D=gaussian_process_chol(std_exp_square_ker,D,1e-6,Test)
# println("Gaussian Process Complete","\r")
mu=reshape(mu,length(mu));
sigma=reshape(sigma,length(sigma))
new_point=findmin(mu-sigma)[2]
#Here we will need to change the number 2 to k
Bayesian_Points=cat(1,Bayesian_Points,[Test[new_point]])
learning_rate=Bayesian_Points[k][1]
node_function=hyper_curry(Bayesian_Points[k][2])
node_deriv=hyper_curry_deriv(Bayesian_Points[k][2])
value_to_be_appended=Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]
if value_to_be_appended !=Bayesian_MSE[k-1]
Bayesian_MSE=cat(1,Bayesian_MSE,[value_to_be_appended])
println("Epoch Complete")
else
println("Found Optimum on the ", k-1, " iteration of ", N, " iterations")
Bayesian_Points=Bayesian_Points[1:length(Bayesian_Points)-1]
break
end
end
# """
# Step 4 -Run the Bayesian Code and Time
# """
srand(1234)
#We first have to pick a random point to begin bayesian optimization:
#currently starts with the midpoint, possibly randomise this:
Bayesian_Points=[Test[Int(round(length(Test)/2))]]
#Bayesian_Points is an vector of arrays where in each array first entry is LR second entry is Hyper-Parameters:
#Define hyperparemeter functions:
node_function=hyper_curry(Bayesian_Points[1][2])
node_deriv=hyper_curry_deriv(Bayesian_Points[1][2])
#Define Learning Rate:
learning_rate=Bayesian_Points[1][1]
tic()
#Run first train before Bayesian Optimization:
Bayesian_MSE=[Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]]
tq=toc()
Bayesian_Times[1]=tq
# =========================================================================
q=0 #preallocate time value at 0
for k=2:N
tic()
D=[(Bayesian_Points[i],Bayesian_MSE[i]) for i=1:length(Bayesian_Points)]
mu, sigma, D=gaussian_process_chol(std_exp_square_ker,D,1e-6,Test)
# println("Gaussian Process Complete","\r")
mu=reshape(mu,length(mu));
sigma=reshape(sigma,length(sigma))
new_point=findmin(mu-sigma)[2]
#Here we will need to change the number 2 to k
Bayesian_Points=cat(1,Bayesian_Points,[Test[new_point]])
learning_rate=Bayesian_Points[k][1]
node_function=hyper_curry(Bayesian_Points[k][2])
node_deriv=hyper_curry_deriv(Bayesian_Points[k][2])
value_to_be_appended=Train_Neural_Net_Loop(epochs,Layer_1,Layer_2,learning_rate,node_function,node_deriv)[3]
if value_to_be_appended !=Bayesian_MSE[k-1]
Bayesian_MSE=cat(1,Bayesian_MSE,[value_to_be_appended])
println("Epoch Complete")
else
println("Found Optimum on the ", k-1, " iteration of ", N, " iterations")
Bayesian_Points=Bayesian_Points[1:length(Bayesian_Points)-1]
q+=toc()
Bayesian_Times[k]=q
break
end
q+=toc()
Bayesian_Times[k]=q
end
Bayesian_Times2=Bayesian_Times[1:length(Bayesian_MSE)]
# Bayesian Plotting =========================================================
println("Final Times for Random = ",Random_Times[end])
println("Minimum MSE for Random =",minimum(Random_MSE))
println("Final time for Bayes = ",Bayesian_Times2[end])
println("Minimum MSE for Bayes =",minimum(Bayesian_MSE))
LR=[Bayesian_Points[i][1] for i=1:length(Bayesian_Points)]
HP=[Bayesian_Points[i][2] for i=1:length(Bayesian_Points)]
planex=[0,0,1,1]
planey=[0,1,0,1]
planem=[minimum(Random_MSE),minimum(Random_MSE),minimum(Random_MSE),minimum(Random_MSE)]
using PyPlot
# fig = figure("pyplot_subplot_mixed",figsize=(7,7))
# ax=axes()
surf(LR,HP,Bayesian_MSE,alpha=0.65,color="#40d5bb")
surf(planex,planey,planem,alpha=0.3,color="#aa231f")
title("MSE BO - (6 point convergance)")
xlabel("Learning Rate")
ylabel("Hyper-Parameter")
zlabel("Mean Square Error")
grid("off")
show()
if minimum(Random_MSE)<minimum(Bayesian_MSE)
println(" =========Results=========
")
println("Random selection with ",convergance_val, " attempts achieves", minimum(Random_MSE), "beating Bayesian Optimization which obtained ",minimum(Bayesian_MSE), " in 6 attempts")
else
if minimum(Random_MSE)<=MSE_Threshold
println(" =========Results=========
")
println("Bayesian Optimization achieves ", minimum(Bayesian_MSE)," with 6 attempts, beating Random Search's ",minimum(Random_MSE)," which converged after ", convergance_val ," iterations.")
else
println(" =========Results=========
")
println("Bayesian Optimization achieves ", minimum(Bayesian_MSE)," with 6 attempts, beating Random Search's ",minimum(Random_MSE)," which was did not converge, (cutoff point was",ThresholdN, " searches.)")
end
end
using PyPlot
# fig = figure("pyplot_subplot_mixed",figsize=(7,7))
# ax=axes()
plot(Bayesian_Times2,Bayesian_MSE,label="Bayesian Optimization",color="#40d5bb")
plot(Random_Times,Random_MSE,label="Random Grid Search",color="#aa231f",alpha=0.45)
title("Threshold MSE = 0.180")
xlabel("Time (s)")
ylabel("MSE")
legend(loc="upper right",fancybox="true")
grid("on")
show()
#0.190 = 2034 searches in time = 121.77159729299996 Minimum MSE for Random =0.18607611627885998
#0.180= 5685 searches in time = 454.35400524799934
#BO = seaches in time = 7562 (s) ( for prerun )