/
trainer.go
574 lines (524 loc) · 14.5 KB
/
trainer.go
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
package nnet
import (
"fmt"
"log"
"math"
"math/rand"
"strings"
"time"
"github.com/jnb666/deepthought2/num"
"github.com/jnb666/deepthought2/stats"
)
// Optimiser type
type OptimiserType int
const (
SGDOpt OptimiserType = iota
NesterovOpt
RMSpropOpt
AdamOpt
AMSGradOpt
)
func NewOptType(name string) (OptimiserType, error) {
name = strings.ToLower(name)
for i, opt := range OptimiserType(0).Options() {
if name == opt {
return OptimiserType(i), nil
}
}
return SGDOpt, fmt.Errorf("invalid optimiser: %s", name)
}
func (t OptimiserType) Options() []string {
return []string{"sgd", "nesterov", "rmsprop", "adam", "amsgrad"}
}
func (t OptimiserType) ExtraArrays() int {
return []int{1, 1, 1, 2, 3}[t]
}
func (t OptimiserType) String() string {
return t.Options()[t]
}
// Training statistics
type Stats struct {
Epoch int
AvgLoss float64
Loss []float64
Error []float64
BestSince int
TrainTime time.Duration
Elapsed time.Duration
}
func StatsHeaders(d map[string]Data) []string {
h := []string{"loss"}
for _, key := range DataTypes {
if _, ok := d[key]; ok {
h = append(h, key+" error")
if key == "valid" {
h = append(h, "valid avg")
}
}
}
return h
}
func (s Stats) Copy() Stats {
stats := s
stats.Loss = append([]float64{}, s.Loss...)
stats.Error = append([]float64{}, s.Error...)
return stats
}
func (s Stats) Format() []string {
str := []string{s.FormatLoss()}
for i := range s.Error {
str = append(str, s.FormatError(i))
}
return str
}
func (s Stats) FormatLoss() string {
return fmt.Sprintf("%7.4f", s.AvgLoss)
}
func (s Stats) FormatError(i int) string {
if s.Error[i] >= 0.1 {
return fmt.Sprintf("%6.1f%%", s.Error[i]*100)
}
return fmt.Sprintf("%6.2f%%", s.Error[i]*100)
}
func (s Stats) FormatElapsed() string {
return FormatDuration(s.Elapsed)
}
func (s Stats) String(headers []string) string {
msg := fmt.Sprintf("epoch %3d:", s.Epoch)
for i, val := range s.Format() {
msg += fmt.Sprintf(" %s =%s", headers[i], val)
}
return msg
}
func FormatDuration(d time.Duration) string {
if d >= time.Minute {
return d.Round(time.Second).String()
}
return fmt.Sprintf("%.2fs", d.Seconds())
}
// Tester interface to evaluate the performance after each epoch, Test method returns true if training should stop.
type Tester interface {
Test(net *Network, epoch int, batchLoss []float64, trainError float64, start time.Time) bool
Epilogue() bool
Release()
Network() *Network
}
// Tester which evaluates the loss and error for each of the data sets and updates the stats.
type TestBase struct {
Net *Network
Data map[string]*Dataset
Pred map[string][]int32
Stats []Stats
Headers []string
epilogue bool
}
// Create a new base class which implements the Tester interface.
func NewTestBase() *TestBase {
return &TestBase{Stats: []Stats{}, Data: map[string]*Dataset{}}
}
// Release allocated buffers
func (t *TestBase) Release() {
if t.Net != nil {
t.Net.Release()
t.Net = nil
}
for _, dset := range t.Data {
dset.Release()
}
t.Data = nil
}
func (t *TestBase) Network() *Network {
return t.Net
}
// Initialise the test dataset, network and other configuration.
func (t *TestBase) Init(dev num.Device, conf Config, data map[string]Data, rng *rand.Rand) *TestBase {
opts := conf.DatasetConfig(true)
t.Data = make(map[string]*Dataset)
t.Headers = StatsHeaders(data)
t.Pred = nil
t.epilogue = false
if debug >= 1 {
log.Printf("init tester: samples=%d batch size=%d\n", opts.MaxSamples, opts.BatchSize)
}
for key, d := range data {
if key != "train" {
if debug >= 1 {
log.Println("dataset =>", key)
}
t.Data[key] = NewDataset(dev, d, opts, rng)
}
}
if opts.BatchSize != conf.TrainBatch {
t.Net = New(dev.NewQueue(), conf, t.Data["test"].BatchSize, t.Data["test"].Shape(), false, rng)
if debug >= 1 {
log.Println("allocate test network: input shape ", t.Net.InShape)
}
}
return t
}
// Generate the predicted results when test is next run.
func (t *TestBase) Predict(train *Dataset) *TestBase {
t.Pred = make(map[string][]int32)
for key, dset := range t.Data {
t.Pred[key] = make([]int32, dset.Samples)
}
t.Pred["train"] = make([]int32, train.Samples)
return t
}
// Reset stats prior to new run
func (t *TestBase) Reset() {
t.Stats = t.Stats[:0]
t.epilogue = false
}
// Test performance of the network, called from the Train function on completion of each epoch.
func (t *TestBase) Test(net *Network, epoch int, batchLoss []float64, trainError float64, start time.Time) bool {
s := Stats{
Epoch: epoch,
Loss: append([]float64{}, batchLoss...),
Error: []float64{trainError},
BestSince: -1,
TrainTime: time.Since(start),
}
for _, loss := range batchLoss {
s.AvgLoss += loss
}
s.AvgLoss /= float64(len(batchLoss))
if t.Net != nil {
// copy the weights to net with different input shape
CopyParams(net.queue, net.Layers, t.Net.Layers, true)
net = t.Net
}
if debug >= 1 {
log.Printf("== TEST EPOCH %d ==\n", epoch)
}
for ix, key := range DataTypes {
if dset, ok := t.Data[key]; ok {
if dset.Samples < dset.Len() {
dset.Shuffle()
}
var pred []int32
if t.Pred != nil {
pred = t.Pred[key]
}
errVal := net.Error(dset, pred)
s.Error = append(s.Error, errVal)
if key == "valid" {
// save average validation error
avgVal := 0.0
if epoch > 1 {
avgVal = t.Stats[epoch-2].Error[ix+1]
}
avgVal = stats.EMA(avgVal).Add(errVal, net.ValidEMA)
s.Error = append(s.Error, avgVal)
// get number of epochs where average validation error has increased
for ep := epoch - 1; ep >= 1; ep-- {
prevErr := t.Stats[ep-1].Error[ix+1]
if prevErr > avgVal {
s.BestSince = epoch - ep - 1
break
}
}
}
}
}
s.Elapsed = time.Since(start)
if len(t.Stats) > 0 {
s.TrainTime += t.Stats[len(t.Stats)-1].TrainTime
s.Elapsed += t.Stats[len(t.Stats)-1].Elapsed
}
t.Stats = append(t.Stats, s)
done := false
loss := batchLoss[len(batchLoss)-1]
if epoch >= net.MaxEpoch || math.IsNaN(loss) || loss <= net.MinLoss || (net.MaxSeconds > 0 && int(s.Elapsed.Seconds()) > net.MaxSeconds) {
done = true
} else if net.StopAfter > 0 && s.BestSince >= net.StopAfter && epoch > 10 {
// auto stopping based on performance on validation set
if net.ExtraEpochs > 0 {
// perform additional training on undistorted training samples
t.epilogue = true
net.StopAfter = 0
net.MaxEpoch = epoch + net.ExtraEpochs
} else {
done = true
}
}
return done
}
func (t *TestBase) Epilogue() bool {
return t.epilogue
}
type testLogger struct {
*TestBase
}
// Create a new tester which logs stats to stdout.
func NewTestLogger(dev num.Device, conf Config, data map[string]Data, rng *rand.Rand) Tester {
return testLogger{TestBase: NewTestBase().Init(dev, conf, data, rng)}
}
func (t testLogger) Test(net *Network, epoch int, batchLoss []float64, trainErr float64, start time.Time) bool {
done := t.TestBase.Test(net, epoch, batchLoss, trainErr, start)
s := t.Stats[len(t.Stats)-1]
if done || net.LogEvery == 0 || epoch%net.LogEvery == 0 {
log.Println(s.String(t.Headers))
if done {
log.Printf("train time:%s total:%s", FormatDuration(s.TrainTime), FormatDuration(s.Elapsed))
}
}
return done
}
// Train the network on the given training set by updating the weights
func Train(net *Network, dset *Dataset, test Tester) {
done := false
epilogue := false
epoch := 0
for !done {
epoch++
if test.Epilogue() && !epilogue {
log.Printf("training for %d extra epochs\n", net.ExtraEpochs)
dset.SetTrans(net.Normalise, false)
epilogue = true
}
start := time.Now()
batchLoss, trainError := TrainEpoch(net, dset, epoch, nil)
done = test.Test(net, epoch, batchLoss, trainError, start)
}
if epilogue {
dset.SetTrans(net.Normalise, net.Distort)
}
}
// Perform one training epoch on dataset, returns the current loss prior to updating the weights.
func TrainEpoch(net *Network, dset *Dataset, epoch int, pred []int32) (batchLoss []float64, trainError float64) {
q := net.queue
if net.Shuffle {
dset.Shuffle()
}
learningRate, weightDecay := net.OptimiserParams(epoch, dset.Samples)
optimiser := NewOptimiser(net, (epoch-1)*dset.Batches, learningRate)
var p []int32
if pred != nil {
p = make([]int32, dset.Samples)
}
dset.NextEpoch()
// if batch size < 64 then average loss over 10 batches
lossBatches := 1
nloss := dset.Batches
if dset.BatchSize < 64 {
lossBatches = 10
nloss /= lossBatches
if dset.Batches%lossBatches != 0 {
nloss++
}
}
batchLoss = make([]float64, nloss)
for batch := 0; batch < dset.Batches; batch++ {
if debug >= 2 || (debug == 1 && batch == 0) {
log.Printf("== train batch %d ==\n", batch)
}
q.Finish()
x, y, yOneHot := dset.NextBatch()
// forward propagation
yPred := Fprop(q, net.Layers, x, net.WorkSpace[0], true)
if debug >= 2 {
log.Printf("yOneHot:\n%s", yOneHot.String(q))
log.Printf("yPred\n%s", yPred.String(q))
}
// sum average loss and error over batches
batchLoss[batch/lossBatches] += net.BatchLoss(yOneHot, yPred) / float64(lossBatches)
trainError += net.BatchError(batch, dset, y, yPred, p)
// get difference at output and back propagate gradient and update weights
grad := num.NewArray(net.WorkSpace[1], num.Float32, yOneHot.Dims...)
q.Call(
num.Copy(yOneHot, grad),
num.Axpy(-1, yPred, grad),
)
if debug >= 2 {
log.Printf("input grad:\n%s", grad.String(q))
}
Bprop(q, net.Layers, grad, net.WorkSpace)
ParamLayers("", net.Layers, func(desc string, l ParamLayer) {
l.WeightDecay(q, weightDecay)
l.UpdateParams(q, optimiser)
})
if debug >= 3 || (batch == dset.Batches-1 && debug >= 2) {
net.PrintWeights()
}
}
q.Finish()
optimiser.Release()
if pred != nil {
for i, ix := range dset.indexes {
pred[ix] = p[i]
}
}
return batchLoss, trainError / float64(dset.Samples)
}
// Optimiser updates the weights
type Optimiser interface {
Update(q num.Queue, x, dx *num.Array, v []*num.Array)
Release()
}
// Create new optimiser with given config settings.
func NewOptimiser(net *Network, iter int, eta float32) Optimiser {
mom := float32(net.Momentum)
d := net.queue.Dev()
nw := maxWeights(net.Layers)
switch net.Optimiser {
case AMSGradOpt:
return &AMSGrad{LearningRate: eta, Beta1: 0.9, Beta2: 0.999, Epsilon: 1e-8, Work: d.NewBuffer(nw)}
case AdamOpt:
return &Adam{LearningRate: eta, Beta1: 0.9, Beta2: 0.999, Epsilon: 1e-8,
Iter: iter, Work1: d.NewBuffer(nw), Work2: d.NewBuffer(nw)}
case RMSpropOpt:
return &RMSprop{LearningRate: eta, Gamma: 0.9, Epsilon: 1e-8, Work: d.NewBuffer(nw)}
case NesterovOpt:
return &Nesterov{LearningRate: eta, Momentum: mom, Work: d.NewBuffer(nw)}
default:
return &SGD{LearningRate: eta, Momentum: mom}
}
}
// Stochastic gradient descent with optional momentum.
type SGD struct {
LearningRate float32
Momentum float32
}
// Update weights using SGD optimiser:
// x += learningRate*dx , or
// v = momentum*v + learningRate*dx; x += v
func (o *SGD) Update(q num.Queue, x, dx *num.Array, v []*num.Array) {
if o.Momentum == 0 {
q.Call(num.Axpy(o.LearningRate, dx, x))
return
}
q.Call(
num.Scale(o.Momentum, v[0]),
num.Axpy(o.LearningRate, dx, v[0]),
num.Axpy(1, v[0], x),
)
}
func (o *SGD) Release() {}
// SGD with Nesterov momentum
type Nesterov struct {
LearningRate float32
Momentum float32
Work num.Buffer
}
// Update weights using Nesterov optimiser:
// v = momentum*v + learningRate*dx
// x += -momentum*vPrev + (1 + momentum)*v
func (o *Nesterov) Update(q num.Queue, x, dx *num.Array, v []*num.Array) {
vPrev := num.NewArray(o.Work, num.Float32, dx.Dims...)
q.Call(
num.Copy(v[0], vPrev),
num.Scale(o.Momentum, v[0]),
num.Axpy(o.LearningRate, dx, v[0]),
num.Axpy(1+o.Momentum, v[0], x),
num.Axpy(-o.Momentum, vPrev, x),
)
}
func (o *Nesterov) Release() {
o.Work.Release()
}
// RMSprop optimiser with adaptive learning rate
type RMSprop struct {
LearningRate float32
Gamma float32
Epsilon float32
Work num.Buffer
}
// Update weights using RMSProp optimiser:
// v = gamma*v + (1-gamma)*(dx**2)
// x += learningRate * dx / (sqrt(v) + epsilon)
func (o *RMSprop) Update(q num.Queue, x, dx *num.Array, v []*num.Array) {
temp := num.NewArray(o.Work, num.Float32, dx.Dims...)
q.Call(
num.Scale(o.Gamma, v[0]),
num.Square(dx, temp),
num.Axpy(1-o.Gamma, temp, v[0]),
num.Sqrt(v[0], temp),
num.Div(o.Epsilon, dx, temp, temp),
num.Axpy(o.LearningRate, temp, x),
)
}
func (o *RMSprop) Release() {
o.Work.Release()
}
// Adam optimiser with adaptive learning rate
type Adam struct {
LearningRate float32
Beta1 float32
Beta2 float32
Epsilon float32
Iter int
Work1 num.Buffer
Work2 num.Buffer
}
// Update weights using Adam optimiser:
// v1 = beta1*v1 + (1-beta1) * dx
// v2 = beta2*v2 + (1-beta2) * dx**2
// v1_hat = v1 / (1 - beta1**t)
// v2_hat = v2 / (1 - beta2**t)
// x += alpha * v1_hat / (sqrt(v2_hat) + epsilon)
func (o *Adam) Update(q num.Queue, x, dx *num.Array, v []*num.Array) {
o.Iter++
t := float64(o.Iter)
beta1 := float64(o.Beta1)
beta2 := float64(o.Beta2)
temp1 := num.NewArray(o.Work1, num.Float32, dx.Dims...)
temp2 := num.NewArray(o.Work2, num.Float32, dx.Dims...)
q.Call(
num.Scale(o.Beta1, v[0]),
num.Axpy(1-o.Beta1, dx, v[0]),
num.Scale(o.Beta2, v[1]),
num.Square(dx, temp1),
num.Axpy(1-o.Beta2, temp1, v[1]),
num.Copy(v[0], temp1),
num.Scale(float32(1/(1-math.Pow(beta1, t))), temp1),
num.Copy(v[1], temp2),
num.Scale(float32(1/(1-math.Pow(beta2, t))), temp2),
num.Sqrt(temp2, temp2),
num.Div(o.Epsilon, temp1, temp2, temp1),
num.Axpy(o.LearningRate, temp1, x),
)
}
func (o *Adam) Release() {
o.Work1.Release()
o.Work2.Release()
}
// AMSGrad optimiser with adaptive learning rate
type AMSGrad struct {
LearningRate float32
Beta1 float32
Beta2 float32
Epsilon float32
Work num.Buffer
}
// Update weights using AMSGrad optimiser:
// v1 = beta1*v1 + (1-beta1) * dx
// v2 = beta2*v2 + (1-beta2) * dx**2
// v3 = max(v3, v2)
// x += alpha * v1 / (sqrt(v3) + epsilon)
func (o *AMSGrad) Update(q num.Queue, x, dx *num.Array, v []*num.Array) {
temp := num.NewArray(o.Work, num.Float32, dx.Dims...)
q.Call(
num.Scale(o.Beta1, v[0]),
num.Axpy(1-o.Beta1, dx, v[0]),
num.Scale(o.Beta2, v[1]),
num.Square(dx, temp),
num.Axpy(1-o.Beta2, temp, v[1]),
num.Max(v[1], v[2], v[2]),
num.Sqrt(v[2], temp),
num.Div(o.Epsilon, v[0], temp, temp),
num.Axpy(o.LearningRate, temp, x),
)
}
func (o *AMSGrad) Release() {
o.Work.Release()
}
func min(a, b int) int {
if a == 0 {
return b
}
if a < b {
return a
}
return b
}