-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathnnode2bvp.py
More file actions
1209 lines (991 loc) · 39.1 KB
/
nnode2bvp.py
File metadata and controls
1209 lines (991 loc) · 39.1 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
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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""
NNODE1IVP - Class to solve 2nd-order ordinary differential equation initial
value problems using a neural network
This module provides the functionality to solve 1st-order ordinary differential
equation initial value problems using a neural network.
Example:
Create an empty NNODE2BVP object.
net = NNODE2BVP()
Create an NNODE2BVP object for a ODE2BVP object.
net = NNODE2BVP(ode2bvp_obj)
Attributes:
Methods:
Todo:
"""
from math import sqrt
import numpy as np
from scipy.optimize import minimize
from kdelta import kdelta
from ode2bvp import ODE2BVP
import sigma
from slffnn import SLFFNN
# Default values for method parameters
DEFAULT_DEBUG = False
DEFAULT_ETA = 0.01
DEFAULT_MAXEPOCHS = 1000
DEFAULT_NHID = 10
DEFAULT_TRAINALG = 'delta'
DEFAULT_UMAX = 1
DEFAULT_UMIN = -1
DEFAULT_VERBOSE = False
DEFAULT_VMAX = 1
DEFAULT_VMIN = -1
DEFAULT_WMAX = 1
DEFAULT_WMIN = -1
DEFAULT_OPTS = {
'debug': DEFAULT_DEBUG,
'eta': DEFAULT_ETA,
'maxepochs': DEFAULT_MAXEPOCHS,
'nhid': DEFAULT_NHID,
'umax': DEFAULT_UMAX,
'umin': DEFAULT_UMIN,
'verbose': DEFAULT_VERBOSE,
'vmax': DEFAULT_VMAX,
'vmin': DEFAULT_VMIN,
'wmax': DEFAULT_WMAX,
'wmin': DEFAULT_WMIN
}
# Vectorize sigma functions for speed.
s_v = np.vectorize(sigma.s)
s1_v = np.vectorize(sigma.s1)
s2_v = np.vectorize(sigma.s2)
s3_v = np.vectorize(sigma.s3)
class NNODE2BVP(SLFFNN):
"""Solve a 2nd-order ODE BVP with a single-layer feedforward neural network."""
# Public methods
def __init__(self, eq, nhid=DEFAULT_NHID):
super().__init__()
# Save the differential equation object.
self.eq = eq
# Initialize all network parameters to 0.
self.w = np.zeros(nhid)
self.u = np.zeros(nhid)
self.v = np.zeros(nhid)
# Clear the result structure for minimize() calls.
self.res = None
# Initialize iteration counter.
self.nit = 0
# Pre-vectorize (_v suffix) functions for efficiency.
self.Gf_v = np.vectorize(self.eq.Gf)
self.dG_dYf_v = np.vectorize(self.eq.dG_dYf)
self.dG_ddYdxf_v = np.vectorize(self.eq.dG_ddYdxf)
self.dG_dd2Ydx2f_v = np.vectorize(self.eq.dG_dd2Ydx2f)
self.Ytf_v = np.vectorize(self.__Ytf)
self.dYt_dxf_v = np.vectorize(self.__dYt_dxf)
self.d2Yt_dx2f_v = np.vectorize(self.__d2Yt_dx2f)
def __str__(self):
s = ''
s += "%s\n" % self.eq.name
s += "w = %s\n" % self.w
s += "u = %s\n" % self.u
s += "v = %s\n" % self.v
return s.rstrip()
def train(self, x, trainalg=DEFAULT_TRAINALG, opts=DEFAULT_OPTS):
"""Train the network to solve a 2nd-order ODE BVP. """
my_opts = dict(DEFAULT_OPTS)
my_opts.update(opts)
if trainalg == 'delta':
self.__train_delta(x, my_opts)
elif trainalg in ('Nelder-Mead', 'Powell', 'CG', 'BFGS', 'Newton-CG'):
self.__train_minimize(x, trainalg, my_opts)
else:
print('ERROR: Invalid training algorithm (%s)!' % trainalg)
exit(1)
def run(self, x):
"""Compute the trained solution."""
w = self.w
u = self.u
v = self.v
z = np.outer(x, w) + u
s = s_v(z)
N = s.dot(v)
Yt = self.Ytf_v(x, N)
return Yt
def run_debug(self, x):
"""Compute the trained solution (debug version)."""
n = len(x)
H = len(self.v)
w = self.w
u = self.u
v = self.v
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = w[k]*x[i] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += s[i, k]*v[k]
Yt = np.zeros(n)
for i in range(n):
Yt[i] = self.__Ytf(x[i], N[i])
return Yt
def run_derivative(self, x):
"""Compute the trained derivative."""
w = self.w
u = self.u
v = self.v
z = np.outer(x, w) + u
s = s_v(z)
s1 = s1_v(s)
N = s.dot(v)
dN_dx = s1.dot(v*w)
dYt_dx = self.__dYt_dxf(x, N, dN_dx)
return dYt_dx
def run_derivative_debug(self, x):
"""Compute the trained derivative (debug version)."""
n = len(x)
H = len(self.v)
w = self.w
u = self.u
v = self.v
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = w[k]*x[i] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
s1 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s1[i, k] = sigma.s1(s[i, k])
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += s[i, k]*v[k]
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += v[k]*s1[i, k]*w[k]
dYt_dx = np.zeros(n)
for i in range(n):
dYt_dx[i] = self.__dYt_dxf(x[i], N[i], dN_dx[i], d2N_dx2[i])
return dYt_dx
def run_derivative2(self, x):
"""Compute the trained 2nd derivative."""
w = self.w
u = self.u
v = self.v
z = np.outer(x, w) + u
s = s_v(z)
s1 = s1_v(s)
s2 = s2_v(s)
N = s.dot(v)
dN_dx = s1.dot(v*w)
d2N_dx2 = s2.dot(v*w**2)
d2Yt_dx2 = self.__d2Yt_dx2f(x, N, dN_dx, d2N_dx2)
return d2Yt_dx2
def run_derivative2_debug(self, x):
"""Compute the trained 2nd derivative (debug version)."""
n = len(x)
H = len(self.v)
w = self.w
u = self.u
v = self.v
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = w[k]*x[i] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
s1 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s1[i, k] = sigma.s1(s[i, k])
s2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s2[i, k] = sigma.s2(s[i, k])
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += s[i, k]*v[k]
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += v[k]*s1[i, k]*w[k]
d2N_dx2 = np.zeros(n)
for i in range(n):
for k in range(H):
d2N_dx2[i] += v[k]*s2[i, k]*w[k]**2
d2Yt_dx2 = np.zeros(n)
for i in range(n):
d2Yt_dx2[i] = self.__d2Yt_dx2f(x[i], N[i], dN_dx[i], d2N_dx2[i])
return d2Yt_dx2
# Internal methods below this point
def __Ytf(self, x, N):
"""Trial function"""
return self.eq.bc0*(1 - x) + self.eq.bc1*x + x*(1 - x)*N
def __dYt_dxf(self, x, N, dN_dx):
"""First derivative of trial function"""
return -self.eq.bc0 + self.eq.bc1 + x*(1 - x)*dN_dx + (1 - 2*x)*N
def __d2Yt_dx2f(self, x, N, dN_dx, d2N_dx2):
"""2nd derivative of trial function"""
return x*(1 - x)*d2N_dx2 + 2*(1 - 2*x)*dN_dx - 2*N
def __train_delta(self, x, opts=DEFAULT_OPTS):
"""Train the network using the delta method. """
my_opts = dict(DEFAULT_OPTS)
my_opts.update(opts)
# Sanity-check arguments.
assert len(x) > 0
assert opts['maxepochs'] > 0
assert opts['eta'] > 0
assert opts['vmin'] < opts['vmax']
assert opts['wmin'] < opts['wmax']
assert opts['umin'] < opts['umax']
# Determine the number of training points, and change notation for
# convenience.
n = len(x) # Number of training points
H = len(self.v)
debug = my_opts['debug']
verbose = my_opts['verbose']
eta = my_opts['eta'] # Learning rate
maxepochs = my_opts['maxepochs'] # Number of training epochs
wmin = my_opts['wmin'] # Network parameter limits
wmax = my_opts['wmax']
umin = my_opts['umin']
umax = my_opts['umax']
vmin = my_opts['vmin']
vmax = my_opts['vmax']
# Create the hidden node weights, biases, and output node weights.
w = np.random.uniform(wmin, wmax, H)
u = np.random.uniform(umin, umax, H)
v = np.random.uniform(vmin, vmax, H)
# Initial parameter deltas are 0.
dE_dw = np.zeros(H)
dE_du = np.zeros(H)
dE_dv = np.zeros(H)
# Train the network.
for epoch in range(my_opts['maxepochs']):
if verbose:
print('Starting epoch %d.' % epoch)
# Compute the new values of the network parameters.
w -= eta*dE_dw
u -= eta*dE_du
v -= eta*dE_dv
# Compute the input, the sigmoid function, and its derivatives, for
# each hidden node and training point.
# x is nx1, w, u are 1xH
# z, s, s1, s2, s3 are nxH
z = np.outer(x, w) + u
s = s_v(z)
s1 = s1_v(s)
s2 = s2_v(s)
s3 = s3_v(s)
# Compute the network output and its derivatives, for each
# training point.
# s, v are Hx1
# N is scalar
N = s.dot(v)
dN_dx = s1.dot(v*w)
d2N_dx2 = s2.dot(v*w**2)
dN_dw = s1*np.outer(x, v)
dN_du = s1*v
dN_dv = np.copy(s)
d2N_dwdx = v*(s1 + s2*np.outer(x, w))
d2N_dudx = v*s2*w
d2N_dvdx = s1*w
d3N_dwdx2 = v*(2*s2*w + s3*np.outer(x, w**2))
d3N_dudx2 = v*s3*w**2
d3N_dvdx2 = s2*w**2
# Compute the value of the trial solution, its coefficients,
# and derivatives, for each training point.
Yt = self.Ytf_v(x, N)
dYt_dx = self.dYt_dxf_v(x, N, dN_dx)
d2Yt_dx2 = self.__d2Yt_dx2f(x, N, dN_dx, d2N_dx2)
# Temporary broadcast versions of P, dP_dx, d2P_dx2.
P_b = np.broadcast_to(x*(1 - x), (H, n)).T
dP_dx_b = np.broadcast_to(1 - 2*x, (H, n)).T
d2P_dx2_b = np.broadcast_to(-2, (H, n)).T
dYt_dw = P_b*dN_dw
dYt_du = P_b*dN_du
dYt_dv = P_b*dN_dv
d2Yt_dwdx = P_b*d2N_dwdx + dP_dx_b*dN_dw
d2Yt_dudx = P_b*d2N_dudx + dP_dx_b*dN_du
d2Yt_dvdx = P_b*d2N_dvdx + dP_dx_b*dN_dv
d3Yt_dwdx2 = P_b*d3N_dwdx2 + 2*dP_dx_b*d2N_dwdx + d2P_dx2_b*dN_dw
d3Yt_dudx2 = P_b*d3N_dudx2 + 2*dP_dx_b*d2N_dudx + d2P_dx2_b*dN_du
d3Yt_dvdx2 = P_b*d3N_dvdx2 + 2*dP_dx_b*d2N_dvdx + d2P_dx2_b*dN_dv
# Compute the value of the original differential equation for
# each training point, and its derivatives.
G = self.Gf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_dYt = self.dG_dYf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_ddYtdx = self.dG_ddYdxf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_dd2Ytdx2 = self.dG_dd2Ydx2f_v(x, Yt, dYt_dx, d2Yt_dx2)
# Temporary broadcast versions of dG_dyt and dG_dytdx.
dG_dYt_b = np.broadcast_to(dG_dYt, (H, n)).T
dG_ddYtdx_b = np.broadcast_to(dG_ddYtdx, (H, n)).T
dG_dd2Ytdx2_b = np.broadcast_to(dG_dd2Ytdx2, (H, n)).T
dG_dw = dG_dYt_b*dYt_dw + dG_ddYtdx_b*d2Yt_dwdx + dG_dd2Ytdx2_b*d3Yt_dwdx2
dG_du = dG_dYt_b*dYt_du + dG_ddYtdx_b*d2Yt_dudx + dG_dd2Ytdx2_b*d3Yt_dudx2
dG_dv = dG_dYt_b*dYt_dv + dG_ddYtdx_b*d2Yt_dvdx + dG_dd2Ytdx2_b*d3Yt_dvdx2
# Compute the error function for this epoch.
E = np.sum(G**2)
# Compute the partial derivatives of the error with respect to the
# network parameters.
# Temporary boradcast version of G.
G_b = np.broadcast_to(G, (H, n)).T
dE_dw = 2*np.sum(G_b*dG_dw, axis=0)
dE_du = 2*np.sum(G_b*dG_du, axis=0)
dE_dv = 2*np.sum(G_b*dG_dv, axis=0)
# Compute RMS error for this epoch.
rmse = sqrt(E/n)
if opts['verbose']:
print(epoch, rmse)
# Save the optimized parameters.
self.w = w
self.u = u
self.v = v
def __train_delta_debug(self, x, opts=DEFAULT_OPTS):
"""Train using the delta method (debug version). """
my_opts = dict(DEFAULT_OPTS)
my_opts.update(opts)
# Sanity-check arguments.
assert len(x) > 0
assert opts['maxepochs'] > 0
assert opts['eta'] > 0
assert opts['vmin'] < opts['vmax']
assert opts['wmin'] < opts['wmax']
assert opts['umin'] < opts['umax']
# Determine the number of training points, and change notation for
# convenience.
n = len(x) # Number of training points
H = len(self.v)
debug = my_opts['debug']
verbose = my_opts['verbose']
eta = my_opts['eta'] # Learning rate
maxepochs = my_opts['maxepochs'] # Number of training epochs
wmin = my_opts['wmin'] # Network parameter limits
wmax = my_opts['wmax']
umin = my_opts['umin']
umax = my_opts['umax']
vmin = my_opts['vmin']
vmax = my_opts['vmax']
# Create the hidden node weights, biases, and output node weights.
w = np.random.uniform(wmin, wmax, H)
u = np.random.uniform(umin, umax, H)
v = np.random.uniform(vmin, vmax, H)
# Initial parameter deltas are 0.
dE_dw = np.zeros(H)
dE_du = np.zeros(H)
dE_dv = np.zeros(H)
# Train the network.
for epoch in range(maxepochs):
if verbose:
print('Starting epoch %d.' % epoch)
# Compute the new values of the network parameters.
for k in range(H):
w[k] -= eta*dE_dw[k]
for k in range(H):
u[k] -= eta*dE_du[k]
for k in range(H):
v[k] -= eta*dE_dv[k]
# Compute the input, the sigmoid function, and its derivatives, for
# each hidden node and each training point.
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = w[k]*x[i] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
s1 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s1[i, k] = sigma.s1(s[i, k])
s2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s2[i, k] = sigma.s2(s[i, k])
s3 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s3[i, k] = sigma.s3(s[i, k])
# Compute the network output and its derivatives, for each
# training point.
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += v[k]*s[i, k]
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += v[k]*s1[i, k]*w[k]
d2N_dx2 = np.zeros(n)
for i in range(n):
for k in range(H):
d2N_dx2[i] += v[k]*s2[i, k]*w[k]**2
dN_dw = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_dw[i, k] = v[k]*s1[i, k]*x[i]
dN_du = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_du[i, k] = v[k]*s1[i, k]
dN_dv = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_dv[i, k] = s[i, k]
d2N_dwdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dwdx[i, k] = v[k]*(s1[i, k] + s2[i, k]*w[k]*x[i])
d2N_dudx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dudx[i, k] = v[k]*s2[i, k]*w[k]
d2N_dvdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dvdx[i, k] = s1[i, k]*w[k]
d3N_dwdx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3N_dwdx2[i, k] = v[k]*(2*s2[i, k]*w[k] + s3[i, k]*w[k]**2*x[i])
d3N_dudx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3N_dudx2[i, k] = v[k]*s3[i, k]*w[k]**2
d3N_dvdx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3N_dvdx2[i, k] = s2[i, k]*w[k]**2
# Compute the value of the trial solution and its derivatives,
# for each training point.
Yt = np.zeros(n)
for i in range(n):
Yt[i] = self.__Ytf(x[i], N[i])
dYt_dx = np.zeros(n)
for i in range(n):
dYt_dx[i] = self.__dYt_dxf(x[i], N[i], dN_dx[i])
d2Yt_dx2 = np.zeros(n)
for i in range(n):
d2Yt_dx2[i] = self.__d2Yt_dx2f(x[i], N[i], dN_dx[i], d2N_dx2[i])
dYt_dw = np.zeros((n, H))
for i in range(n):
for k in range(H):
dYt_dw[i, k] = x[i]*(1 - x[i])*dN_dw[i, k]
dYt_du = np.zeros((n, H))
for i in range(n):
for k in range(H):
dYt_du[i, k] = x[i]*(1 - x[i])*dN_du[i, k]
dYt_dv = np.zeros((n, H))
for i in range(n):
for k in range(H):
dYt_dv[i, k] = x[i]*(1 - x[i])*dN_dv[i, k]
d2Yt_dwdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2Yt_dwdx[i, k] = x[i]*(1 - x[i])*d2N_dwdx[i, k] + (1 - 2*x[i])*dN_dw[i, k]
d2Yt_dudx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2Yt_dudx[i, k] = x[i]*(1 - x[i])*d2N_dudx[i, k] + (1 - 2*x[i])*dN_du[i, k]
d2Yt_dvdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2Yt_dvdx[i, k] = x[i]*(1 - x[i])*d2N_dvdx[i, k] + (1 - 2*x[i])*dN_dv[i, k]
d3Yt_dwdx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3Yt_dwdx2[i, k] = x[i]*(1 - x[i])*d3N_dwdx2[i, k] + 2*(1 - 2*x[i])*d2N_dwdx[i, k] - 2*dN_dw[i, k]
d3Yt_dudx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3Yt_dudx2[i, k] = x[i]*(1 - x[i])*d3N_dudx2[i, k] + 2*(1 - 2*x[i])*d2N_dudx[i, k] - 2*dN_du[i, k]
d3Yt_dvdx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
d3Yt_dvdx2[i, k] = x[i]*(1 - x[i])*d3N_dvdx2[i, k] + 2*(1 - 2*x[i])*d2N_dvdx[i, k] - 2*dN_dv[i, k]
# Compute the value of the original differential equation for
# each training point, and its derivatives.
G = np.zeros(n)
for i in range(n):
G[i] = self.eq.Gf(x[i], Yt[i], dYt_dx[i], d2Yt_dx2[i])
dG_dYt = np.zeros(n)
for i in range(n):
dG_dYt[i] = self.eq.dG_dYf(x[i], Yt[i], dYt_dx[i], d2Yt_dx2[i])
dG_ddYtdx = np.zeros(n)
for i in range(n):
dG_ddYtdx[i] = self.eq.dG_ddYdxf(x[i], Yt[i], dYt_dx[i], d2Yt_dx2[i])
dG_dd2Ytdx2 = np.zeros(n)
for i in range(n):
dG_dd2Ytdx2[i] = self.eq.dG_dd2Ydx2f(x[i], Yt[i], dYt_dx[i], d2Yt_dx2[i])
dG_dw = np.zeros((n, H))
for i in range(n):
for k in range(H):
dG_dw[i, k] = dG_dYt[i]*dYt_dw[i, k] + dG_ddYtdx[i]*d2Yt_dwdx[i, k] + dG_dd2Ytdx2[i]*d3Yt_dwdx2[i, k]
dG_du = np.zeros((n, H))
for i in range(n):
for k in range(H):
dG_du[i, k] = dG_dYt[i]*dYt_du[i, k] + dG_ddYtdx[i]*d2Yt_dudx[i, k] + dG_dd2Ytdx2[i]*d3Yt_dudx2[i, k]
dG_dv = np.zeros((n, H))
for i in range(n):
for k in range(H):
dG_dv[i, k] = dG_dYt[i]*dYt_dv[i, k] + dG_ddYtdx[i]*d2Yt_dvdx[i, k] + dG_dd2Ytdx2[i]*d3Yt_dvdx2[i, k]
# Compute the error function for this epoch.
E = 0
for i in range(n):
E += G[i]**2
# Compute the partial derivatives of the error with respect to the
# network parameters.
dE_dw = np.zeros(H)
for k in range(H):
for i in range(n):
dE_dw[k] += 2*G[i]*dG_dw[i, k]
dE_du = np.zeros(H)
for k in range(H):
for i in range(n):
dE_du[k] += 2*G[i]*dG_du[i, k]
dE_dv = np.zeros(H)
for k in range(H):
for i in range(n):
dE_dv[k] += 2*G[i]*dG_dv[i, k]
# Compute the RMS error for this epoch.
rmse = sqrt(E/n)
if opts['verbose']:
print(epoch, rmse)
# Save the optimized parameters.
self.w = w
self.u = u
self.v = v
def __train_minimize(self, x, trainalg, opts=DEFAULT_OPTS):
"""Train the network using the SciPy minimize() function. """
my_opts = dict(DEFAULT_OPTS)
my_opts.update(opts)
# Sanity-check arguments.
assert len(x) > 0
assert opts['vmin'] < opts['vmax']
assert opts['wmin'] < opts['wmax']
assert opts['umin'] < opts['umax']
# Create the hidden node weights, biases, and output node weights.
H = len(self.v)
wmin = my_opts['wmin'] # Network parameter limits
wmax = my_opts['wmax']
umin = my_opts['umin']
umax = my_opts['umax']
vmin = my_opts['vmin']
vmax = my_opts['vmax']
# Create the hidden node weights, biases, and output node weights.
w = np.random.uniform(wmin, wmax, H)
u = np.random.uniform(umin, umax, H)
v = np.random.uniform(vmin, vmax, H)
# Assemble the network parameters into a single 1-D vector for
# use by the minimize() method.
p = np.hstack((w, u, v))
# Add the status callback if requested.
callback = None
if my_opts['verbose']:
callback = self.__print_progress
# Minimize the error function to get the new parameter values.
if trainalg in ('Nelder-Mead', 'Powell', 'CG', 'BFGS'):
jac = None
elif trainalg in ('Newton-CG',):
jac = self.__compute_error_gradient
res = minimize(self.__compute_error, p, method=trainalg, jac=jac,
args=(x), callback=callback)
self.res = res
# Unpack the optimized network parameters.
self.w = res.x[0:H]
self.u = res.x[H:2*H]
self.v = res.x[2*H:3*H]
def __compute_error(self, p, x):
"""Compute the error function using the current parameter values."""
# Unpack the network parameters (hsplit() returns views, so no copies made).
H = len(self.v)
(w, u, v) = np.hsplit(p, 3)
# Compute the forward pass through the network.
z = np.outer(x, w) + u
s = s_v(z)
s1 = s1_v(s)
s2 = s2_v(s)
N = s.dot(v)
dN_dx = s1.dot(v*w)
d2N_dx2 = s2.dot(v*w**2)
Yt = self.Ytf_v(x, N)
dYt_dx = self.dYt_dxf_v(x, N, dN_dx)
d2Yt_dx2 = self.d2Yt_dx2f_v(x, N, dN_dx, d2N_dx2)
G = self.Gf_v(x, Yt, dYt_dx, d2Yt_dx2)
E = np.sum(G**2)
return E
def __compute_error_debug(self, p, x):
"""Compute the error function using the current parameter values (debug version)."""
# Fetch the number of training points.
n = len(x)
# Unpack the network parameters.
H = len(self.v)
(w, u, v) = np.hsplit(p, 3)
# Compute the forward pass through the network.
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = x[i]*w[k] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
s1 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s1[i, k] = sigma.s1(s[i, k])
s2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s2[i, k] = sigma.s2(s[i, k])
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += v[k]*s[i, k]
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += s1[i, k]*v[k]*w[k]
d2N_dx2 = np.zeros(n)
for i in range(n):
for k in range(H):
d2N_dx2[i] += v[k]*s2[i, k]*w[k]**2
Yt = np.zeros(n)
for i in range(n):
Yt[i] = self.__Ytf(x[i], N[i])
dYt_dx = np.zeros(n)
for i in range(n):
dYt_dx[i] = self.__dYt_dxf(x[i], N[i], dN_dx[i])
d2Yt_dx2 = np.zeros(n)
for i in range(n):
d2Yt_dx2[i] = self.__d2Yt_dx2f(x[i], N[i], dN_dx[i], d2N_dx2[i])
G = np.zeros(n)
for i in range(n):
G[i] = self.eq.Gf(x[i], Yt[i], dYt_dx[i], d2Yt_dx2[i])
E = 0
for i in range(n):
E += G[i]**2
return E
def __compute_error_gradient(self, p, x):
"""Compute the gradient of the error function wrt network
parameters."""
# Fetch the number of training points.
n = len(x)
# Unpack the network parameters (hsplit() returns views, so no copies made).
H = len(self.v)
(w, u, v) = np.hsplit(p, 3)
# Compute the forward pass through the network.
z = np.outer(x, w) + u
s = s_v(z)
s1 = s1_v(s)
s2 = s2_v(s)
s3 = s3_v(s)
# WARNING: Numpy and loop code below can give different results with Newton-CG after
# a few iterations. The differences are very slight, but they result in significantly
# different values for the weights and biases. To avoid this for now, loop code has been
# retained for some computations below.
# N = s.dot(v)
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += s[i, k]*v[k]
# dN_dx = s1.dot(v*w)
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += s1[i, k]*v[k]*w[k]
d2N_dx2 = s2.dot(v*w**2)
# dN_dw = s1*np.outer(x, v)
dN_dw = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_dw[i, k] = s1[i, k]*x[i]*v[k]
dN_du = s1*v
dN_dv = s
# d2N_dwdx = v*(s1 + s2*np.outer(x, w))
d2N_dwdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dwdx[i, k] = v[k]*(s1[i, k] + s2[i, k]*x[i]*w[k])
d2N_dudx = v*s2*w
d2N_dvdx = s1*w
d3N_dwdx2 = v*(2*s2*w + s3*np.outer(x, w**2))
d3N_dudx2 = v*s3*w**2
d3N_dvdx2 = s2*w**2
Yt = self.__Ytf(x, N)
dYt_dx = self.__dYt_dxf(x, N, dN_dx)
d2Yt_dx2 = self.__d2Yt_dx2f(x, N, dN_dx, d2N_dx2)
P_b = np.broadcast_to(x*(1 - x), (H, n)).T
dP_dx_b = np.broadcast_to(1 - 2*x, (H, n)).T
d2P_dx2_b = np.broadcast_to(-2, (H, n)).T
dYt_dw = P_b*dN_dw
dYt_du = P_b*dN_du
dYt_dv = P_b*dN_dv
d2Yt_dwdx = P_b*d2N_dwdx + dP_dx_b*dN_dw
d2Yt_dudx = P_b*d2N_dudx + dP_dx_b*dN_du
d2Yt_dvdx = P_b*d2N_dvdx + dP_dx_b*dN_dv
d3Yt_dwdx2 = P_b*d3N_dwdx2 + 2*dP_dx_b*d2N_dwdx + d2P_dx2_b*dN_dw
d3Yt_dudx2 = P_b*d3N_dudx2 + 2*dP_dx_b*d2N_dudx + d2P_dx2_b*dN_du
d3Yt_dvdx2 = P_b*d3N_dvdx2 + 2*dP_dx_b*d2N_dvdx + d2P_dx2_b*dN_dv
G = self.Gf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_dYt = self.dG_dYf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_ddYtdx = self.dG_ddYdxf_v(x, Yt, dYt_dx, d2Yt_dx2)
dG_dd2Ytdx2 = self.dG_dd2Ydx2f_v(x, Yt, dYt_dx, d2Yt_dx2)
# Temporary broadcast versions of dG_dyt and dG_dytdx.
dG_dYt_b = np.broadcast_to(dG_dYt, (H, n)).T
dG_ddYtdx_b = np.broadcast_to(dG_ddYtdx, (H, n)).T
dG_dd2Ytdx2_b = np.broadcast_to(dG_dd2Ytdx2, (H, n)).T
dG_dw = dG_dYt_b*dYt_dw + dG_ddYtdx_b*d2Yt_dwdx + dG_dd2Ytdx2_b*d3Yt_dwdx2
dG_du = dG_dYt_b*dYt_du + dG_ddYtdx_b*d2Yt_dudx + dG_dd2Ytdx2_b*d3Yt_dudx2
dG_dv = dG_dYt_b*dYt_dv + dG_ddYtdx_b*d2Yt_dvdx + dG_dd2Ytdx2_b*d3Yt_dvdx2
G_b = np.broadcast_to(G, (H, n)).T
dE_dw = 2*np.sum(G_b*dG_dw, axis=0)
dE_du = 2*np.sum(G_b*dG_du, axis=0)
dE_dv = 2*np.sum(G_b*dG_dv, axis=0)
jac = np.hstack((dE_dw, dE_du, dE_dv))
return jac
def __compute_error_gradient_debug(self, p, x):
"""Compute the gradient of the error function wrt network
parameters (debug version)."""
# Fetch the number of training points.
n = len(x)
# Unpack the network parameters (hsplit() returns views, so no copies made).
H = len(self.v)
(w, u, v) = np.hsplit(p, 3)
# Compute the forward pass through the network.
z = np.zeros((n, H))
for i in range(n):
for k in range(H):
z[i, k] = w[k]*x[i] + u[k]
s = np.zeros((n, H))
for i in range(n):
for k in range(H):
s[i, k] = sigma.s(z[i, k])
s1 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s1[i, k] = sigma.s1(s[i, k])
s2 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s2[i, k] = sigma.s2(s[i, k])
s3 = np.zeros((n, H))
for i in range(n):
for k in range(H):
s3[i, k] = sigma.s3(s[i, k])
N = np.zeros(n)
for i in range(n):
for k in range(H):
N[i] += v[k]*s[i, k]
dN_dx = np.zeros(n)
for i in range(n):
for k in range(H):
dN_dx[i] += v[k]*s1[i, k]*w[k]
d2N_dx2 = np.zeros(n)
for i in range(n):
for k in range(H):
d2N_dx2[i] += v[k]*s2[i, k]*w[k]**2
dN_dw = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_dw[i, k] = v[k]*s1[i, k]*x[i]
dN_du = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_du[i, k] = v[k]*s1[i, k]
dN_dv = np.zeros((n, H))
for i in range(n):
for k in range(H):
dN_dv[i, k] = s[i, k]
d2N_dwdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dwdx[i, k] = v[k]*(s1[i, k] + s2[i, k]*w[k]*x[i])
d2N_dudx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dudx[i, k] = v[k]*s2[i, k]*w[k]
d2N_dvdx = np.zeros((n, H))
for i in range(n):
for k in range(H):
d2N_dvdx[i, k] = s1[i, k]*w[k]
d3N_dwdx2 = np.zeros((n, H))
for i in range(n):
for k in range(H):