/
experiment.go
449 lines (404 loc) · 13.5 KB
/
experiment.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
package experiment
import (
"encoding/gob"
"fmt"
"github.com/sbinet/npyio/npz"
"github.com/yaricom/goNEAT/v2/neat/genetics"
"gonum.org/v1/gonum/mat"
"io"
"math"
"sort"
"time"
)
// An Experiment is a collection of trials for one experiment. It's useful for statistical analysis of a series of
// experiments
type Experiment struct {
Id int
Name string
RandSeed int64
Trials
// The maximal allowed fitness score as defined by fitness function of experiment.
// It is used to normalize fitness score value used in efficiency score calculation. If this value
// is not set, than fitness score will not be normalized during efficiency score estimation.
MaxFitnessScore float64
}
// AvgTrialDuration Calculates average duration of experiment's trial
// Note, that most trials finish after solution solved, so this metric can be used to represent how efficient the solvers
// was generated
func (e *Experiment) AvgTrialDuration() time.Duration {
total := time.Duration(0)
for _, t := range e.Trials {
total += t.Duration
}
return total / time.Duration(len(e.Trials))
}
// AvgEpochDuration Calculates average duration of evaluations among all generations of organism populations in this experiment
func (e *Experiment) AvgEpochDuration() time.Duration {
total := time.Duration(0)
for _, t := range e.Trials {
total += t.AvgEpochDuration()
}
return total / time.Duration(len(e.Trials))
}
// AvgGenerationsPerTrial Calculates average number of generations evaluated per trial during this experiment. This can be helpful when estimating
// algorithm efficiency, because when winner organism is found the trial is terminated, i.e. less evaluations - more fast
// convergence.
func (e *Experiment) AvgGenerationsPerTrial() float64 {
total := 0.0
for _, t := range e.Trials {
total += float64(len(t.Generations))
}
return total / float64(len(e.Trials))
}
// MostRecentTrialEvalTime Returns the time of evaluation of the most recent trial
func (e *Experiment) MostRecentTrialEvalTime() time.Time {
var u time.Time
for _, e := range e.Trials {
ut := e.RecentEpochEvalTime()
if u.Before(ut) {
u = ut
}
}
return u
}
// BestOrganism Finds the most fit organism among all epochs in this trial. It's also possible to get the best organism
// only among the ones which was able to solve the experiment's problem. Returns the best fit organism in this experiment
// among with ID of trial where it was found and boolean value to indicate if search was successful.
func (e *Experiment) BestOrganism(onlySolvers bool) (*genetics.Organism, int, bool) {
var orgs = make(genetics.Organisms, 0, len(e.Trials))
for i, t := range e.Trials {
org, found := t.BestOrganism(onlySolvers)
if found {
orgs = append(orgs, org)
org.Flag = i
}
}
if len(orgs) > 0 {
sort.Sort(sort.Reverse(orgs))
return orgs[0], orgs[0].Flag, true
} else {
return nil, -1, false
}
}
// Solved is to check if solution was found in at least one trial
func (e *Experiment) Solved() bool {
for _, t := range e.Trials {
if t.Solved() {
return true
}
}
return false
}
// BestFitness The fitness values of the best organisms for each trial
func (e *Experiment) BestFitness() Floats {
var x Floats = make([]float64, len(e.Trials))
for i, t := range e.Trials {
if org, ok := t.BestOrganism(false); ok {
x[i] = org.Fitness
}
}
return x
}
// BestAge The age values of the organisms for each trial
func (e *Experiment) BestAge() Floats {
var x Floats = make([]float64, len(e.Trials))
for i, t := range e.Trials {
if org, ok := t.BestOrganism(false); ok {
x[i] = float64(org.Species.Age)
}
}
return x
}
// BestComplexity The complexity values of the best organisms for each trial
func (e *Experiment) BestComplexity() Floats {
var x Floats = make([]float64, len(e.Trials))
for i, t := range e.Trials {
if org, ok := t.BestOrganism(false); ok {
x[i] = float64(org.Phenotype.Complexity())
}
}
return x
}
// Diversity returns the average number of species in each trial
func (e *Experiment) Diversity() Floats {
var x Floats = make([]float64, len(e.Trials))
for i, t := range e.Trials {
x[i] = t.Diversity().Mean()
}
return x
}
// EpochsPerTrial returns the number of epochs in each trial
func (e *Experiment) EpochsPerTrial() Floats {
var x Floats = make([]float64, len(e.Trials))
for i, t := range e.Trials {
x[i] = float64(len(t.Generations))
}
return x
}
// TrialsSolved The number of trials solved
func (e *Experiment) TrialsSolved() int {
count := 0
for _, t := range e.Trials {
if t.Solved() {
count++
}
}
return count
}
// SuccessRate The success rate
func (e *Experiment) SuccessRate() float64 {
soved := float64(e.TrialsSolved())
return soved / float64(len(e.Trials))
}
// AvgWinner Returns average number of nodes, genes, organisms evaluations, and species diversity of winner genomes among all
// trials, i.e. for all trials where winning solution was found
func (e *Experiment) AvgWinner() (avgNodes, avgGenes, avgEvals, avgDiversity float64) {
totalNodes, totalGenes, totalEvals, totalDiversity := 0, 0, 0, 0
count := 0
for i := 0; i < len(e.Trials); i++ {
t := e.Trials[i]
if t.Solved() {
nodes, genes, evals, diversity := t.Winner()
totalNodes += nodes
totalGenes += genes
totalEvals += evals
totalDiversity += diversity
count++
}
}
avgNodes = float64(totalNodes) / float64(count)
avgGenes = float64(totalGenes) / float64(count)
avgEvals = float64(totalEvals) / float64(count)
avgDiversity = float64(totalDiversity) / float64(count)
return avgNodes, avgGenes, avgEvals, avgDiversity
}
// EfficiencyScore Calculates the efficiency score of the solution
// We are interested in efficient solver search solution that take
// less time per epoch, less generations per trial, and produce less complicated winner genomes.
// At the same time it should have maximal fitness score and maximal success rate among trials.
func (e *Experiment) EfficiencyScore() float64 {
meanComplexity, meanFitness := 0.0, 0.0
if len(e.Trials) > 1 {
count := 0.0
for i := 0; i < len(e.Trials); i++ {
t := e.Trials[i]
if t.Solved() {
if t.WinnerGeneration == nil {
// find winner
t.Winner()
}
meanComplexity += float64(t.WinnerGeneration.Best.Phenotype.Complexity())
meanFitness += t.WinnerGeneration.Best.Fitness
count++
}
}
meanComplexity /= count
meanFitness /= count
}
// normalize and scale fitness score if appropriate
fitnessScore := meanFitness
if e.MaxFitnessScore > 0 {
fitnessScore /= e.MaxFitnessScore
fitnessScore *= 100
}
score := e.AvgEpochDuration().Seconds() * 1000.0 * e.AvgGenerationsPerTrial() * meanComplexity
if score > 0 {
score = e.SuccessRate() * fitnessScore / math.Log(score)
}
return score
}
// PrintStatistics Prints experiment statistics
func (e *Experiment) PrintStatistics() {
fmt.Printf("\nSolved %d trials from %d, success rate: %f\n", e.TrialsSolved(), len(e.Trials), e.SuccessRate())
fmt.Printf("Random seed: %d\n", e.RandSeed)
fmt.Printf("Average\n\tTrial duration:\t\t%s\n\tEpoch duration:\t\t%s\n\tGenerations/trial:\t%.1f\n",
e.AvgTrialDuration(), e.AvgEpochDuration(), e.AvgGenerationsPerTrial())
// Print absolute champion statistics
if org, trid, found := e.BestOrganism(true); found {
nodes, genes, evals, divers := e.Trials[trid].Winner()
fmt.Printf("\nChampion found in %d trial run\n\tWinner Nodes:\t\t%d\n\tWinner Genes:\t\t%d\n\tWinner Evals:\t\t%d\n\n\tDiversity:\t\t%d",
trid, nodes, genes, evals, divers)
fmt.Printf("\n\tComplexity:\t\t%d\n\tAge:\t\t\t%d\n\tFitness:\t\t%f\n",
org.Phenotype.Complexity(), org.Species.Age, org.Fitness)
} else {
fmt.Println("\nNo winner found in the experiment!!!")
}
// Print average winner statistics
meanComplexity, meanDiversity, meanAge, meanFitness := 0.0, 0.0, 0.0, 0.0
if len(e.Trials) > 1 {
avgNodes, avgGenes, avgEvals, avgDivers, avgGenerations := 0.0, 0.0, 0.0, 0.0, 0.0
count := 0.0
for i := 0; i < len(e.Trials); i++ {
t := e.Trials[i]
if t.Solved() {
nodes, genes, evals, diversity := t.Winner()
avgNodes += float64(nodes)
avgGenes += float64(genes)
avgEvals += float64(evals)
avgDivers += float64(diversity)
avgGenerations += float64(len(t.Generations))
meanComplexity += float64(t.WinnerGeneration.Best.Phenotype.Complexity())
meanAge += float64(t.WinnerGeneration.Best.Species.Age)
meanFitness += t.WinnerGeneration.Best.Fitness
count++
// update trials array
e.Trials[i] = t
}
}
avgNodes /= count
avgGenes /= count
avgEvals /= count
avgDivers /= count
avgGenerations /= count
fmt.Printf("\nAverage among winners\n\tWinner Nodes:\t\t%.1f\n\tWinner Genes:\t\t%.1f\n\tWinner Evals:\t\t%.1f\n\tGenerations/trial:\t%.1f\n\n\tDiversity:\t\t%f\n",
avgNodes, avgGenes, avgEvals, avgGenerations, avgDivers)
meanComplexity /= count
meanAge /= count
meanFitness /= count
fmt.Printf("\tComplexity:\t\t%f\n\tAge:\t\t\t%f\n\tFitness:\t\t%f\n",
meanComplexity, meanAge, meanFitness)
}
// Print the average values for each population of organisms evaluated
count := float64(len(e.Trials))
for _, t := range e.Trials {
fitness, age, complexity := t.Average()
meanComplexity += complexity.Mean()
meanDiversity += t.Diversity().Mean()
meanAge += age.Mean()
meanFitness += fitness.Mean()
}
meanComplexity /= count
meanDiversity /= count
meanAge /= count
meanFitness /= count
fmt.Printf("\nAverages for all organisms evaluated during experiment\n\tDiversity:\t\t%f\n\tComplexity:\t\t%f\n\tAge:\t\t\t%f\n\tFitness:\t\t%f\n",
meanDiversity, meanComplexity, meanAge, meanFitness)
score := e.EfficiencyScore()
fmt.Printf("\nEfficiency score:\t\t%f\n\n", score)
}
// Write is to writes encoded experiment data into provided writer
func (e *Experiment) Write(w io.Writer) error {
enc := gob.NewEncoder(w)
return e.Encode(enc)
}
// Encode Encodes experiment with GOB encoding
func (e *Experiment) Encode(enc *gob.Encoder) error {
if err := enc.Encode(e.Id); err != nil {
return err
}
if err := enc.Encode(e.Name); err != nil {
return err
}
// encode trials
if err := enc.Encode(len(e.Trials)); err != nil {
return err
}
for _, t := range e.Trials {
if err := t.Encode(enc); err != nil {
return err
}
}
return nil
}
// Read is to read experiment data from provided reader and decodes it
func (e *Experiment) Read(r io.Reader) error {
dec := gob.NewDecoder(r)
return e.Decode(dec)
}
// Decode Decodes experiment data
func (e *Experiment) Decode(dec *gob.Decoder) error {
if err := dec.Decode(&e.Id); err != nil {
return err
}
if err := dec.Decode(&e.Name); err != nil {
return err
}
// decode Trials
var tNum int
if err := dec.Decode(&tNum); err != nil {
return err
}
e.Trials = make([]Trial, tNum)
for i := 0; i < tNum; i++ {
trial := Trial{}
if err := trial.Decode(dec); err != nil {
return err
}
e.Trials[i] = trial
}
return nil
}
// WriteNPZ Dumps experiment results to the NPZ file.
// The file has following structure:
// - trials_fitness - the mean, variance of fitness scores per trial
// - trials_ages - the mean, variance of species ages per trial
// - trials_complexity - the mean, variance of genome complexity of best organisms among species per trial
// - trial_[0...n]_epoch_mean_fitnesses - the mean fitness scores per epoch per trial
// - trial_[0...n]_epoch_best_fitnesses - the best fitness scores per epoch per trial
// the same for AGE and COMPLEXITY per epoch per trial
// - trial_[0...n]_epoch_diversity - the number of species per epoch per trial
func (e *Experiment) WriteNPZ(w io.Writer) error {
// write general statistics
trialsFitness := mat.NewDense(len(e.Trials), 2, nil) // mean, var
trialsAges := mat.NewDense(len(e.Trials), 2, nil) // mean, var
trialsComplexity := mat.NewDense(len(e.Trials), 2, nil) // mean, var
for i, t := range e.Trials {
fitness, age, complexity := t.Average()
trialsFitness.SetRow(i, fitness.MeanVariance())
trialsAges.SetRow(i, age.MeanVariance())
trialsComplexity.SetRow(i, complexity.MeanVariance())
}
out := npz.NewWriter(w)
if err := out.Write("trials_fitness", trialsFitness); err != nil {
return err
}
if err := out.Write("trials_ages", trialsAges); err != nil {
return err
}
if err := out.Write("trials_complexity", trialsComplexity); err != nil {
return err
}
// write statistics per epoch per trial
//
for i, t := range e.Trials {
fitness, age, complexity := t.Average()
if err := out.Write(fmt.Sprintf("trial_%d_epoch_mean_fitnesses", i), fitness); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_mean_ages", i), age); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_mean_complexities", i), complexity); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_best_fitnesses", i), t.BestFitness()); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_best_ages", i), t.BestAge()); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_best_complexities", i), t.BestComplexity()); err != nil {
return err
}
if err := out.Write(fmt.Sprintf("trial_%d_epoch_diversity", i), t.Diversity()); err != nil {
return err
}
}
return out.Close()
}
// Experiments is a sortable list of experiments by execution time and Id
type Experiments []Experiment
func (es Experiments) Len() int {
return len(es)
}
func (es Experiments) Swap(i, j int) {
es[i], es[j] = es[j], es[i]
}
func (es Experiments) Less(i, j int) bool {
ui := es[i].MostRecentTrialEvalTime()
uj := es[j].MostRecentTrialEvalTime()
if ui.Equal(uj) {
return es[i].Id < es[j].Id
}
return ui.Before(uj)
}