eaopt - Awesome Go Library for Machine Learning

eaopt is an evolutionary optimization library

Table of Contents

Changelog
Example
Background
Features
Usage
A note on parallelism
FAQ
Dependencies
License

Changelog

11/11/18: a simple version of OpenAI's evolution strategy has been implemented, it's called OES.
02/08/18: gago has now become eaopt. You can still everything you could do before but the scope is now larger than genetic algorithms. The goal is to implement many more evolutionary optimization algorithms on top of the existing codebase.

Example

The following example attempts to minimize the Drop-Wave function using a genetic algorithm. The Drop-Wave function is known to have a minimum value of -1 when each of it's arguments is equal to 0.

package main

import (
    "fmt"
    m "math"
    "math/rand"

    "github.com/MaxHalford/eaopt"
)

// A Vector contains float64s.
type Vector []float64

// Evaluate a Vector with the Drop-Wave function which takes two variables as
// input and reaches a minimum of -1 in (0, 0). The function is simple so there
// isn't any error handling to do.
func (X Vector) Evaluate() (float64, error) {
    var (
        numerator   = 1 + m.Cos(12*m.Sqrt(m.Pow(X[0], 2)+m.Pow(X[1], 2)))
        denominator = 0.5*(m.Pow(X[0], 2)+m.Pow(X[1], 2)) + 2
    )
    return -numerator / denominator, nil
}

// Mutate a Vector by resampling each element from a normal distribution with
// probability 0.8.
func (X Vector) Mutate(rng *rand.Rand) {
    eaopt.MutNormalFloat64(X, 0.8, rng)
}

// Crossover a Vector with another Vector by applying uniform crossover.
func (X Vector) Crossover(Y eaopt.Genome, rng *rand.Rand) {
    eaopt.CrossUniformFloat64(X, Y.(Vector), rng)
}

// Clone a Vector to produce a new one that points to a different slice.
func (X Vector) Clone() eaopt.Genome {
    var Y = make(Vector, len(X))
    copy(Y, X)
    return Y
}

// VectorFactory returns a random vector by generating 2 values uniformally
// distributed between -10 and 10.
func VectorFactory(rng *rand.Rand) eaopt.Genome {
    return Vector(eaopt.InitUnifFloat64(2, -10, 10, rng))
}

func main() {
    // Instantiate a GA with a GAConfig
    var ga, err = eaopt.NewDefaultGAConfig().NewGA()
    if err != nil {
        fmt.Println(err)
        return
    }

    // Set the number of generations to run for
    ga.NGenerations = 10

    // Add a custom print function to track progress
    ga.Callback = func(ga *eaopt.GA) {
        fmt.Printf("Best fitness at generation %d: %f\n", ga.Generations, ga.HallOfFame[0].Fitness)
    }

    // Find the minimum
    err = ga.Minimize(VectorFactory)
    if err != nil {
        fmt.Println(err)
        return
    }
}

>>> Best fitness at generation 0: -0.550982
>>> Best fitness at generation 1: -0.924220
>>> Best fitness at generation 2: -0.987282
>>> Best fitness at generation 3: -0.987282
>>> Best fitness at generation 4: -0.987282
>>> Best fitness at generation 5: -0.987282
>>> Best fitness at generation 6: -0.987282
>>> Best fitness at generation 7: -0.997961
>>> Best fitness at generation 8: -0.999954
>>> Best fitness at generation 9: -0.999995
>>> Best fitness at generation 10: -0.999999

All the examples can be found in this repository.

Background

Evolutionary optimization algorithms are a subdomain of evolutionary computation. Their goal is to minimize/maximize a function without using any gradient information (usually because there isn't any gradient available). They share the common property of exploring the search space by breeding, mutating, evaluating, and sorting so-called individuals. Most evolutionary algorithms are designed to handle real valued functions, however in practice they are commonly used for handling more exotic problems. For example genetic algorithms can be used to find the optimal structure of a neural network.

eaopt provides implementations for various evolutionary optimization algorithms. Implementation-wise, the idea is that most (if not all) of said algorithms can be written as special cases of a genetic algorithm. Indeed this is made possible by using a generic definition of a genetic algorithm by allowing the mutation, crossover, selection, and replacement procedures to be modified at will. The GA struct is thus the most flexible struct of eaopt, the other algorithms are written on top of it. If you don't find any algorithm that suits your need then you can easily write your own operators (as is done in most of the examples).

Features

Different evolutionary algorithms are available with a consistent API
You can practically do anything by using the GA struct
Speciation and migration procedures are available
Common genetic operators (mutation, crossover, selection, migration, speciation) are already implemented
Function evaluation can be done in parallel if your function is costly

Usage

General advice

Evolutionary algorithms are usually designed for solving specific kinds of problems. Take a look at the Minimize function of each method to get an idea of what type of function it can optimize.
Use the associated constructor function of each method to initialize it. For example use the NewPSO function instead of instantiating the PSO struct yourself. Along with making your life easier, these functions provide the added benefit of checking for parameter input errors.
If you're going to use the GA struct then be aware that some evolutionary operators are already implemented in eaopt (you don't necessarily have to reinvent the wheel).
Don't feel overwhelmed by the fact that algorithms are implemented as special cases of genetic algorithms. It doesn't matter if you just want to get things done, it just makes things easier under the hood.

Genetic algorithms

Overview

Genetic algorithms are the backbone of eaopt. Most of the other algorithms available in eaopt are implemented as special cases of GAs. A GA isn't an algorithm per say, but rather a blueprint which can be used to optimize any kind of problem.

In a nutshell, a GA solves an optimization problem by doing the following:

Generate random solutions to a problem.
Assign a fitness to each solutions.
Check if a new best solution has been found.
Apply genetic operators following a given evolutionary model.
Repeat from step 2 until the stopping criterion is satisfied.

This description is voluntarily vague. It is up to the user to define the problem and the genetic operators to use. Different categories of genetic operators exist:

Mutation operators modify an existing solution.
Crossover operators generate a new solution by combining two or more existing ones.
Selection operators selects individuals that are to be evolved.
Migration swaps individuals between populations.
Speciation clusters individuals into subpopulations.

Popular stopping criteria include

a fixed number of generations,
a fixed duration,
an indicator that the population is stagnating.

Genetic algorithms can be used via the GA struct. The necessary steps for using the GA struct are

Implement the Genome interface to model your problem
Instantiate a GA struct (preferably via the GAConfig struct)
Call the GA's Minimize function and check the HallOfFame field

Implementing the Genome interface

To use the GA struct you first have to implement the Genome interface, which is used to define the logic that is specific to your problem (logic that eaopt doesn't know about). For example this is where you will define an Evaluate() method for evaluating a particular problem. The GA struct contains context-agnostic information. For example this is where you can choose the number of individuals in a population (which is a separate concern from your particular problem). Apart from a good design pattern, decoupling the problem definition from the optimization through the Genome interface means that eaopt can be used to optimize any kind of problem.

Let's have a look at the Genome interface.

type Genome interface {
    Evaluate() (float64, error)
    Mutate(rng *rand.Rand)
    Crossover(genome Genome, rng *rand.Rand)
    Clone() Genome
}

The Evaluate() method returns the fitness of a genome. The sweet thing is that you can do whatever you want in this method. Your struct that implements the interface doesn't necessarily have to be a slice. The Evaluate() method is your problem to deal with. eaopt only needs it's output to be able to function. You can also return an error which eaopt will catch and return when calling ga.Initialize() and ga.Evolve().

The Mutate(rng *rand.Rand) method is where you can modify an existing solution by tinkering with it's variables. The way in which you should mutate a solution essentially boils down to your particular problem. eaopt provides some common mutation methods that you can use instead of reinventing the wheel -- this is what is being done in most of the examples.

The Crossover(genome Genome, rng *rand.Rand) method combines two individuals. The important thing to notice is that the type of first argument differs from the struct calling the method. Indeed the first argument is a Genome that has to be casted into your struct before being able to apply a crossover operator. This is due to the fact that Go doesn't provide generics out of the box; it's easier to convince yourself by checking out the examples.

The Clone() method is there to produce independent copies of the struct you want to evolve. This is necessary for internal reasons and ensures that pointer fields are not pointing to identical memory addresses. Usually this is not too difficult implement; you just have to make sure that the clones you produce are not shallow copies of the genome that is being cloned. This is also fairly easy to unit test.

Once you have implemented the Genome interface you have provided eaopt with all the information it couldn't guess for you.

Instantiate the GA struct

You can now instantiate a GA and use it to find an optimal solution to your problem. The GA struct has a lot of fields, hence the recommended way is to use the GAConfig struct and call it's NewGA method.

Let's have a look at the GAConfig struct.

type GAConfig struct {
    // Required fields
    NPops        uint
    PopSize      uint
    NGenerations uint
    HofSize      uint
    Model        Model

    // Optional fields
	  ParallelInit bool // Whether to initialize Individuals in parallel or not
    ParallelEval bool // Whether to evaluate Individuals in parallel or not
    Migrator     Migrator
    MigFrequency uint // Frequency at which migrations occur
    Speciator    Speciator
    Logger       *log.Logger
    Callback     func(ga *GA)
    EarlyStop    func(ga *GA) bool
    RNG          *rand.Rand
}

Required fields
- NPops determines the number of populations that will be used.
- PopSize determines the number of individuals inside each population.
- NGenerations determines for many generations the populations will be evolved.
- HofSize determines how many of the best individuals should be recorded.
- Model is a struct that determines how to evolve each population of individuals.
Optional fields
- ParallelInit determines if a population is initialized in parallel. The rule of thumb is to set this to true if your genome initialization method is expensive, if not it won't be worth the overhead. Refer to the section on parallelism for a more comprehensive explanation.
- ParallelEval determines if a population is evaluated in parallel. The rule of thumb is to set this to true if your Evaluate method is expensive, if not it won't be worth the overhead. Refer to the section on parallelism for a more comprehensive explanation.
- Migrator and MigFrequency should be provided if you want to exchange individuals between populations in case of a multi-population GA. If not the populations will be run independently. Again this is an advanced concept in the genetic algorithms field that you shouldn't deal with at first.
- Speciator will split each population in distinct species at each generation. Each specie will be evolved separately from the others, after all the species has been evolved they are regrouped.
- Logger can be used to record basic population statistics, you can read more about it in the logging section.
- Callback will execute any piece of code you wish every time ga.Evolve() is called. Callback will also be called when ga.Initialize() is. Using a callback can be useful for many things:
  - Calculating specific population statistics that are not provided by the logger
  - Changing parameters of the GA after a certain number of generations
  - Monitoring convergence
- EarlyStop will be called before each generation to check if the evolution should be stopped early.
- RNG can be set to make results reproducible. If it is not provided then a default rand.New(rand.NewSource(time.Now().UnixNano())) will be used. If you want to make your results reproducible use a constant source, e.g. rand.New(rand.NewSource(42)).

Once you have instantiated a GAConfig you can call it's NewGA method to obtain a GA. The GA struct has the following definition:

type GA struct {
    GAConfig

    Populations Populations
    HallOfFame  Individuals
    Age         time.Duration
    Generations uint
}

Naturally a GA stores a copy of the GAConfig that was used to instantiate it. Apart from this the following fields are available:

Populations is where all the current populations and individuals are kept.
HallOfFame contains the HofSize best individuals ever encountered. This slice is always sorted, meaning that the first element of the slice will be the best individual ever encountered.
Age indicates the duration the GA has spent evolving.
Generations indicates how many how many generations have gone by.

You could bypass the NewGA method instantiate a GA with a GAConfig but this would leave the GAConfig's fields unchecked for input errors.

Calling the Minimize method

You are now all set to find an optimal solution to your problem. To do so you have to call the GA's Minimize function which has the following signature:

func (ga *GA) Minimize(newGenome func(rng *rand.Rand) Genome) error

You have to provide the Minimize a function which returns a Genome. It is recommended that the Genome thus produced contains random values. This is where the connection between the Genome interface and the GA struct is made.

The Minimize function will return an error (nil if everything went okay) once it is done. You can done access the first entry in the HallOfFame field to retrieve the best encountered solution.

Using the Slice interface

Classically GAs are used to optimize problems where the genome has a slice representation - eg. a vector or a sequence of DNA code. Almost all the mutation and crossover algorithms available in eaopt are based on the Slice interface which has the following definition.

type Slice interface {
    At(i int) interface{}
    Set(i int, v interface{})
    Len() int
    Swap(i, j int)
    Slice(a, b int) Slice
    Split(k int) (Slice, Slice)
    Append(Slice) Slice
    Replace(Slice)
    Copy() Slice
}

Internally IntSlice, Float64Slice and StringSlice implement this interface so that you can use the available operators for most use cases. If however you wish to use the operators with slices of a different type you will have to implement the Slice interface. Although there are many methods to implement, they are all trivial (have a look at slice.go and the TSP example.

Models

eaopt makes it easy to use different so called models. Simply put, a models defines how a GA evolves a population of individuals through a sequence of genetic operators. It does so without considering whatsoever the intrinsics of the underlying operators. In a nutshell, an evolution model attempts to mimic evolution in the real world. It's extremely important to choose a good model because it is usually the highest influence on the performance of a GA.

Generational model

The generational model is one the, if not the most, popular models. Simply put it generates n offsprings from a population of size n and replaces the population with the offsprings. The offsprings are generated by selecting 2 individuals from the population and applying a crossover method to the selected individuals until the n offsprings have been generated. The newly generated offsprings are then optionally mutated before replacing the original population. Crossover generates two new individuals, thus if the population size isn't an even number then the second individual from the last crossover (individual n+1) won't be included in the new population.

Steady state model

The steady state model differs from the generational model in that the entire population isn't replaced between each generations. Instead of adding the children of the selected parents into the next generation, the 2 best individuals out of the two parents and two children are added back into the population so that the population size remains constant. However, one may also replace the parents with the children regardless of their fitness. This method has the advantage of not having to evaluate the newly generated offsprings. Whats more, crossover often generates individuals who are sub-par but who have a lot of potential; giving individuals generated from crossover a chance can be beneficial on the long run.

Select down to size model

The select down to size model uses two selection rounds. The first one is similar to the one used in the generational model. Parents are selected to generate new individuals through crossover. However, the offsprings are then merged with the original population and a second selection round occurs to determine which individuals will survive to the next generation. Formally m offsprings are generated from a population of n, the n+m individuals are then "selected down to size" so that there only remains n individuals.

Ring model

In the ring model, crossovers are applied to neighbours in a one-directional ring topology. Two by the two neighbours generate 2 offsprings. The best out of the 4 individuals (2 parents + 2 offsprings) replaces the first neighbour.

Mutation only

It's possible to run a GA without crossover simply by mutating individuals. This can be done with the ModMutationOnly struct. At each generation each individual is mutated. ModMutationOnly has a strict field to determine if the mutant should replace the initial individual only if it's fitness is lower.

Speciation

Clusters, also called species in the literature, are a partitioning of individuals into smaller groups of similar individuals. Programmatically a cluster is a list of lists that each contain individuals. Individuals inside each species are supposed to be similar. The similarity depends on a metric, for example it could be based on the fitness of the individuals. In the literature, speciation is also called speciation.

The purpose of a partitioning individuals is to apply genetic operators to similar individuals. In biological terms this encourages "incest" and maintains isolated species. For example in nature animals usually breed with local mates and don't breed with different animal species.

Using speciation/speciation with genetic algorithms became "popular" when they were first applied to the optimization of neural network topologies. By mixing two neural networks during crossover, the resulting neural networks were often useless because the inherited weights were not optimized for the new topology. This meant that newly generated neural networks were not performing well and would likely disappear during the selection phase. Thus speciation was introduced so that neural networks evolved in similar groups in order for new neural networks wouldn't disappear immediately. Instead the similar neural networks would evolve between each other until they were good enough to mixed with the other neural networks.

With eaopt it's possible to use speciation on top of all the rest. To do so the Speciator field of the GA struct has to specified.

Multiple populations and migration

Multi-populations GAs run independent populations in parallel. They are not frequently used, however they are very easy to understand and to implement. In eaopt a GA struct contains a Populations field which stores each population in a slice. The number of populations is specified in the GAConfig's NPops field.

If Migrator and MigFrequency are not provided the populations will be run independently in parallel. However, if they are provided then at each generation number that is divisible by MigFrequency (for example 5 divides generation number 25) individuals will be exchanged between the populations following the Migrator.

Using multi-populations can be an easy way to gain in diversity. Moreover, not using multi-populations on a multi-core architecture is a waste of resources.

With eaopt you can use multi-populations and speciation at the same time. The following flowchart shows what that would look like.

Logging population statistics

It's possible to log statistics for each population at every generation. To do so you simply have to provide the GA struct a Logger from the Go standard library. This is quite convenient because it allows you to decide where to write the log output, whether it be in a file or directly in the standard output.

ga.Logger = log.New(os.Stdout, "", log.Ldate|log.Ltime)

If a logger is provided, each row in the log output will include

the population ID,
the population minimum fitness,
the population maximum fitness,
the population average fitness,
the population's fitness standard deviation.

Particle swarm optimization

Description

Particle swarm optimization (PSO) can be used to optimize real valued functions. It maintains a population of candidate solutions called particles. The particles move around the search-space according to a mathematical formula that takes as input the particle's position and it's velocity. Each particle's movement is influenced by its's local best encountered position, as well as the best overall position in the search-space (these values are updated after each generation). This is expected to move the swarm toward the best solutions.

As can be expected there are many variants of PSO. The SPSO struct implements the SPSO-2011 standard.

Example

In this example we're going to minimize th Styblinski-Tang function with two dimensions. The global minimum is about -39.16599 times the number of dimensions.

package main

import (
    "fmt"
    m "math"
    "math/rand"

    "github.com/MaxHalford/eaopt"
)

func StyblinskiTang(X []float64) (y float64) {
    for _, x := range X {
        y += m.Pow(x, 4) - 16*m.Pow(x, 2) + 5*x
    }
    return 0.5 * y
}

func main() {
    // Instantiate SPSO
    var spso, err = eaopt.NewDefaultSPSO()
    if err != nil {
        fmt.Println(err)
        return
    }

    // Fix random number generation
    spso.GA.RNG = rand.New(rand.NewSource(42))

    // Run minimization
    _, y, err := spso.Minimize(StyblinskiTang, 2)
    if err != nil {
        fmt.Println(err)
        return
    }

    // Output best encountered solution
    fmt.Printf("Found minimum of %.5f, the global minimum is %.5f\n", y, -39.16599*2)
}

This should produce the following output.

>>> Found minimum of -78.23783, the global minimum is -78.33198

Parameters

You can (and should) instantiate an SPSO with the NewSPSO method. You can also use the NewDefaultSPSO method as is done in the previous example.

func NewSPSO(nParticles, nSteps uint, min, max, w float64, parallel bool, rng *rand.Rand) (*SPSO, error)

nParticles is the number of particles to use
nSteps is the number of steps during which evolution occurs
min and max are the boundaries from which the initial values are sampled from
w is the velocity amplifier
parallel determines if the particles are evaluated in parallel or not
rng is a random number generator, you can set it to nil if you want it to be random

Differential evolution

Description

Differential evolution (DE) somewhat resembles PSO and is also used for optimizing real-valued functions. At each generation, each so-called agent is moved according to the position of 3 randomly sampled agents. If the new position is not better than the current one then it is discarded.

As can be expected there are many variants of PSO. The SPSO struct implements the SPSO-2011 standard.

Example

In this example we're going to minimize th Ackley function with two dimensions. The global minimum is 0.

package main

import (
    "fmt"
    m "math"
    "math/rand"

    "github.com/MaxHalford/eaopt"
)

func Ackley(x []float64) float64 {
    var (
        a, b, c = 20.0, 0.2, 2 * m.Pi
        s1, s2  float64
        d       = float64(len(x))
    )
    for _, xi := range x {
        s1 += xi * xi
        s2 += m.Cos(c * xi)
    }
    return -a*m.Exp(-b*m.Sqrt(s1/d)) - m.Exp(s2/d) + a + m.Exp(1)
}

func main() {
    // Instantiate DiffEvo
    var de, err = eaopt.NewDefaultDiffEvo()
    if err != nil {
        fmt.Println(err)
        return
    }

    // Fix random number generation
    de.GA.RNG = rand.New(rand.NewSource(42))

    // Run minimization
    _, y, err := de.Minimize(Ackley, 2)
    if err != nil {
        fmt.Println(err)
        return
    }

    // Output best encountered solution
    fmt.Printf("Found minimum of %.5f, the global minimum is 0\n", y)
}

This should produce the following output.

>>> Found minimum of 0.00137, the global minimum is 0

Parameters

You can (and should) instantiate an DiffEvo with the NewDiffEvo method. You can also use the NewDefaultDiffEvo method as is done in the previous example.

func NewDiffEvo(nAgents, nSteps uint, min, max, cRate, dWeight float64, parallel bool, rng *rand.Rand) (*DiffEvo, error)

nAgents is the number of agents to use (it has to be at least 4)
nSteps is the number of steps during which evolution occurs
min and max are the boundaries from which the initial values are sampled from
cRate is the crossover rate
dWeight is the differential weight
parallel determines if the agents are evaluated in parallel or not
rng is a random number generator, you can set it to nil if you want it to be random

OpenAI evolution strategy

Description

OpenAI proposed a simple evolution strategy based on the use of natural gradients. The algorithm is dead simple:

Choose a center mu at random
Sample points around mu using a normal distribution
Evaluate each point and obtain the natural gradient g
Move mu along the natural gradient g using a learning rate
Repeat from step 2 until satisfied

Example

In this example we're going to minimize the Rastrigin function with three dimensions. The global minimum is 0.

package main

import (
    "fmt"
    m "math"
    "math/rand"

    "github.com/MaxHalford/eaopt"
)

func Rastrigin(x []float64) (y float64) {
    y = 10 * float64(len(x))
    for _, xi := range x {
        y += m.Pow(xi, 2) - 10*m.Cos(2*m.Pi*xi)
    }
    return y
}

func main() {
    // Instantiate DiffEvo
    var oes, err = eaopt.NewDefaultOES()
    if err != nil {
        fmt.Println(err)
        return
    }

    // Fix random number generation
    oes.GA.RNG = rand.New(rand.NewSource(42))

    // Run minimization
    _, y, err := oes.Minimize(Rastrigin, 2)
    if err != nil {
        fmt.Println(err)
        return
    }

    // Output best encountered solution
    fmt.Printf("Found minimum of %.5f, the global minimum is 0\n", y)
}

This should produce the following output.

>>> Found minimum of 0.02270, the global minimum is 0

Parameters

You can (and should) instantiate an OES with the NewOES method. You can also use the NewDefaultOES method as is done in the previous example.

func NewOES(nPoints, nSteps uint, sigma, lr float64, parallel bool, rng *rand.Rand) (*OES, error)

nPoints is the number of points to use (it has to be at least 3)
nSteps is the number of steps during which evolution occurs
sigma determines the shape of the normal distribution used to sample new points
lr is the learning rate
parallel determines if the agents are evaluated in parallel or not
rng is a random number generator, you can set it to nil if you want it to be random

Hill climbing

Description

Hill climbing is a very simple optimization strategy. It works as follows:

Randomly select a point to be the "current" point. Evaluate it.
Randomly alter one of the coordinates, and evaluate this new point.
If the new point is better than the current point, make the new point the current point. Otherwise, do nothing.
Repeat from step 2 until satisfied.

One implements hill climbing in eaopt using a genetic algorithm with the ModMutationOnly model and Strict set to true.

Example

In this example we minimize a Bohachevsky function. The global minimum is 0.

package main

import (
	"fmt"
	"math"
	"math/rand"

	"github.com/MaxHalford/eaopt"
)

// A Coord2D is a coordinate in two dimensions.
type Coord2D struct {
	X float64
	Y float64
}

// Evaluate evalutes a Bohachevsky function at the current coordinates.
func (c *Coord2D) Evaluate() (float64, error) {
	z := c.X*c.X + 2*c.Y*c.Y - 0.3*math.Cos(3*math.Pi*c.X) - 0.4*math.Cos(4*math.Pi*c.Y) + 0.7
	return z, nil
}

// Mutate replaces one of the current coordinates with a random value in [-100, -100].
func (c *Coord2D) Mutate(rng *rand.Rand) {
	if rng.Intn(2) == 0 {
		c.X = rng.Float64()*200.0 - 100.0
	} else {
		c.Y = rng.Float64()*200.0 - 100.0
	}
}

// Crossover does nothing.  It is defined only so *Coord2D implements the eaopt.Genome interface.
func (c *Coord2D) Crossover(other eaopt.Genome, rng *rand.Rand) {}

// Clone returns a copy of a *Coord2D.
func (c *Coord2D) Clone() eaopt.Genome {
	return &Coord2D{X: c.X, Y: c.Y}
}

func main() {
	// Hill climbing is implemented as a GA using the ModMutationOnly model
	// with the Strict option.
	cfg := eaopt.NewDefaultGAConfig()
	cfg.Model = eaopt.ModMutationOnly{Strict: true}
	cfg.NGenerations = 9999

	// Add a custom callback function to track progress.
	minFit := math.MaxFloat64
	cfg.Callback = func(ga *eaopt.GA) {
		hof := ga.HallOfFame[0]
		fit := hof.Fitness
		if fit == minFit {
			// Output only when we make an improvement.
			return
		}
		best := hof.Genome.(*Coord2D)
		fmt.Printf("Best fitness at generation %4d: %10.5f at (%9.5f, %9.5f)\n",
			ga.Generations, fit, best.X, best.Y)
		minFit = fit
	}

	// Run the hill-climbing algorithm.
	ga, err := cfg.NewGA()
	if err != nil {
		panic(err)
	}
	err = ga.Minimize(func(rng *rand.Rand) eaopt.Genome {
		return &Coord2D{
			X: rng.Float64()*200.0 - 100.0,
			Y: rng.Float64()*200.0 - 100.0,
		}
	})
	if err != nil {
		panic(err)
	}

	// Output the best encountered solution.
	best := ga.HallOfFame[0].Genome.(*Coord2D)
	fmt.Printf("Found a minimum at (%.5f, %.5f).\n", best.X, best.Y)
	fmt.Println("The global minimum is known to lie at (0, 0).")
}

This should produce output along the following lines:

>>> Best fitness at generation    0:  347.29009 at (-17.77572,   3.91475)
>>> Best fitness at generation    1:   91.64634 at ( -7.79357,  -3.88125)
>>> Best fitness at generation    7:   84.31780 at (  8.42342,  -2.53296)
>>> Best fitness at generation    8:   22.81205 at (  3.64011,  -2.09039)
>>> Best fitness at generation   13:    3.17994 at ( -1.37117,   0.63824)
>>> Best fitness at generation   25:    2.58142 at ( -1.05701,  -0.29836)
>>> Best fitness at generation   26:    2.34391 at (  0.96249,  -0.57655)
>>> Best fitness at generation   70:    1.21768 at (  0.23307,   0.17318)
>>> Best fitness at generation  117:    0.78975 at (  0.68306,  -0.10444)
>>> Best fitness at generation  119:    0.71870 at ( -0.10934,  -0.14860)
>>> Best fitness at generation  130:    0.47829 at (  0.02383,   0.46641)
>>> Best fitness at generation  277:    0.11108 at (  0.00798,  -0.05851)
>>> Best fitness at generation  492:    0.07006 at ( -0.07098,   0.00333)
>>> Best fitness at generation  860:    0.03000 at (  0.01445,  -0.02850)
>>> Best fitness at generation 1149:    0.02192 at ( -0.03899,   0.00333)
>>> Best fitness at generation 1270:    0.02055 at ( -0.03333,   0.01191)
>>> Best fitness at generation 1596:    0.00650 at ( -0.02072,   0.00333)
>>> Best fitness at generation 2945:    0.00249 at ( -0.00509,   0.00794)
>>> Best fitness at generation 5551:    0.00134 at (  0.00482,  -0.00548)
>>> Best fitness at generation 6551:    0.00063 at ( -0.00390,  -0.00350)
>>> Best fitness at generation 6780:    0.00056 at (  0.00364,   0.00333)
>>> Found a minimum at (0.00364, 0.00333).
>>> The global minimum is known to lie at (0, 0).

Simulated Annealing

Description

Simulated annealing is an optimization strategy inspired by metallurgical annealing. It works as follows:

Randomly select a point to be the current point. Evaluate it.
Select a nearby point (i.e., via a small mutation), and evaluate it.
If the new point is better than the current point, make the new point the current point.
If the new point is worse than the current point, decide randomly—but with decreasing likelihood—whether make the new point the current point.
Repeat from step 2 for a given number of generations.

One implements simulated annealing in eaopt using a genetic algorithm with the ModSimulatedAnnealing model. ModSimulatedAnnealing takes a user-defined function Accept that returns a probability of moving to a worse point as a function of the current generation number, the total number of generations, the fitness of the current point and the fitness of the mutated point. It is assumed that Accept is non-increasing with the generation number.

An Accept function that returns a constant 0 (never accepting a worse move) is equivalent to the ModMutationOnly model with Strict: true:

func(g, ng uint, e0, e1 float64) float64 { return 0.0 }

Likewise, an Accept function that returns a constant 1 (always accepting a worse move) is equivalent to the ModMutationOnly model with Strict: false:

func(g, ng uint, e0, e1 float64) float64 { return 1.0 }

More commonly, Accept will return a function of "temperature", which drops from 1 to 0 as g increases from 0 to ng. Returning the temperature itself is perfectly legitimate:

func(g, ng uint, e0, e1 float64) float64 {
	t := 1.0 - float64(g)/float64(ng)
	return t
}

An exponential causes the acceptance probability to drop quickly at first and slowly later, ending a bit above zero:

func(g, ng uint, e0, e1 float64) float64 {
	t := 1.0 - float64(g)/float64(ng)
	return math.Exp(-3.0 * t)
}

A cosine causes the acceptance probability to drop slowly at the beginning and ending of the evolution and quickly in between:

func(g, ng uint, e0, e1 float64) float64 {
	t := 1.0 - float64(g)/float64(ng)
	return (math.Cos(t*math.Pi) + 1.0) / 2.0
}

The following figure graphs the preceding three Accept functions: probability

The e0 and e1 parameters can be used to make the acceptance probability also a function of how much worse the mutation is than its parent. However, doing so requires a priori knowledge of the range of values e0 and e1 can take, which is not available in many cases.

Example

The following is a complete program that uses simulated annealing to find a minimum of the Holder table function:

package main

import (
	"fmt"
	"math"
	"math/rand"

	"github.com/MaxHalford/eaopt"
)

// A Coord2D is a coordinate in two dimensions.
type Coord2D struct {
	X float64
	Y float64
}

// Evaluate evaluates the Holder-table function at the current coordinates.
func (c *Coord2D) Evaluate() (float64, error) {
	z := -math.Abs(math.Sin(c.X) * math.Cos(c.Y) *
		math.Exp(math.Abs(1.0-math.Sqrt(c.X*c.X+c.Y*c.Y)/math.Pi)))
	return z, nil
}

// Mutate replaces one of the current coordinates with a random value in [-10, 10).
func (c *Coord2D) Mutate(rng *rand.Rand) {
	v := rng.Float64()*20.0 - 10.0
	if rng.Intn(2) == 0 {
		c.X = v
	} else {
		c.Y = v
	}
}

// Crossover does nothing.  It is defined only so *Coord2D implements the eaopt.Genome interface.
func (c *Coord2D) Crossover(other eaopt.Genome, rng *rand.Rand) {}

// Clone returns a copy of a *Coord2D.
func (c *Coord2D) Clone() eaopt.Genome {
	cc := *c
	return &cc
}

func main() {
	// Simulated annealing is implemented as a GA using the ModSimulatedAnnealing model.
	cfg := eaopt.NewDefaultGAConfig()
	cfg.Model = eaopt.ModSimulatedAnnealing{
		Accept: func(g, ng uint, e0, e1 float64) float64 {
			// Accept readily in early generations but reluctantly in later generations.
			t := 1.0 - float64(g)/float64(ng)
			return (math.Cos(t*math.Pi) + 1.0) / 2.0
		},
	}
	cfg.NGenerations = 999

	// Add a custom callback function to track progress.
	minFit := math.MaxFloat64
	cfg.Callback = func(ga *eaopt.GA) {
		hof0 := ga.HallOfFame[0]
		fit := hof0.Fitness
		if fit == minFit {
			// Output only when we make an improvement.
			return
		}
		best := hof0.Genome.(*Coord2D)
		fmt.Printf("Best fitness at generation %3d: %10.5f at (%9.5f, %9.5f)\n",
			ga.Generations, fit,
			best.X, best.Y)
		minFit = fit
	}

	// Run the simulated-annealing algorithm.
	ga, err := cfg.NewGA()
	if err != nil {
		panic(err)
	}
	err = ga.Minimize(func(rng *rand.Rand) eaopt.Genome {
		var c Coord2D
		c.X = rng.Float64()
		c.Y = rng.Float64()
		return &c
	})
	if err != nil {
		panic(err)
	}

	// Output the best encountered solution.
	hof0 := ga.HallOfFame[0]
	best := hof0.Genome.(*Coord2D)
	fmt.Printf("Found a minimum at (%.5f, %.5f) --> %.5f.\n",
		best.X, best.Y, hof0.Fitness)
	fmt.Println("The global minimum is known to lie at (±8.05502, ±9.66459) and have value -19.20850.")
}

This should produce output like the following:

Best fitness at generation   0:   -1.62856 at (  0.97142,   0.13185)
Best fitness at generation   1:   -5.70555 at (  0.81465,  -9.68769)
Best fitness at generation   2:   -8.22368 at ( -8.35803,   6.91242)
Best fitness at generation   3:  -13.40055 at (  7.36818,  -9.18324)
Best fitness at generation   6:  -16.45462 at ( -7.49961,  -9.68769)
Best fitness at generation   7:  -16.53317 at (  8.50224,  -9.39214)
Best fitness at generation   8:  -19.06737 at ( -7.93491,   9.65411)
Best fitness at generation  12:  -19.18453 at (  8.02260,  -9.70168)
Best fitness at generation  44:  -19.18972 at ( -8.04929,   9.70731)
Best fitness at generation  80:  -19.19616 at ( -8.04283,   9.63179)
Best fitness at generation  82:  -19.20817 at (  8.05422,   9.65894)
Found a minimum at (8.05422, 9.65894) --> -19.20817.
The global minimum is known to lie at (±8.05502, ±9.66459) and have value -19.20850.

A note on parallelism

Evolutionary algorithms are famous for being embarrassingly parallel. Most of the operations can be run independently each one from another. For example individuals can be mutated in parallel because mutation doesn't have any side effects.

The Go language provides nice mechanisms to run stuff in parallel, provided you have more than one core available. However, parallelism is only worth it when the functions you want to run in parallel are heavy. If the functions are cheap then the overhead of spawning routines will be too high and not worth it. It's simply not worth using a routine for each individual because operations at an individual level are often not time consuming enough.

By default eaopt will evolve populations in parallel. This is because evolving one population implies a lot of operations and parallelism is worth it. If your Evaluate method is heavy then it might be worth evaluating individuals in parallel, which can done by setting the GA's ParallelEval field to true. Evaluating individuals in parallel can be done regardless of the fact that you are using more than one population. If your genome initialization method is heavy then it might be worth initializing individuals in parallel, which can done by setting the GA's ParallelInit field to true. Initializing individuals in parallel can be done regardless of the fact that you are using more than one population.

FAQ

What if I don't want to use crossover?

Alas you still have to implement the Genome interface. You can however provide a blank Crossover method just to satisfy the interface.

type Vector []float64

func (X Vector) Crossover(Y eaopt.Genome, rng *rand.Rand) {}

Why aren't my Mutate and Crossover methods modifying my Genomes?

The Mutate and Crossover methods have to modify the values of the Genome in-place. The following code will work because the Vector is a slice; slices in Go are references to underlying data, hence modifying a slice modifies them in-place.

type Vector []float64

func (X Vector) Mutate(rng *rand.Rand) {
    eaopt.MutNormal(X, rng, 0.5)
}

On the contrary, mutating other kind of structs will require the * symbol to access the struct's pointer. Notice the *Name in the following example.

type Name string

func (n *Name) Mutate(rng *rand.Rand) {
    n = randomName()
}

Are evolutionary optimization algorithms any good?

For real-valued, differentiable functions, evolutionary optimization algorithms will probably not fair well against methods based on gradient descent. Intuitively this is because evolutionary optimization algorithms ignore the shape and slope of the function. However gradient descent algorithms usually get stuck in local optimas, whereas evolutionary optimization algorithms don't.

As mentioned earlier, some problems can simply not be written down as closed-form expressions. In this case methods based on gradient information can't be used whilst evolutionary optimization algorithms can still be used. For example tuning the number of layers and of neurons per layer in a neural network is an open problem that doesn't yet have a reliable solution. Neural networks architectures used in production are usually designed by human experts. The field of neuroevolution aims to train neural networks with evolutionary algorithms.

How can I contribute?

Feel free to implement your own operators or to make suggestions! Check out the CONTRIBUTING file for some guidelines. This repository has a long list of existing evolutionary algorithms.

Dependencies

You can see the list of dependencies here and the graph view here. Here is the list of external dependencies:

golang.org/x/sync/errgroup

License

The MIT License (MIT). Please see the LICENSE file for more information.

📚 eaopt - Awesome Go Library for Machine Learning

Detailed Description of eaopt

Changelog

Example

Background

Features

Usage

General advice

Genetic algorithms

Overview

Implementing the Genome interface

Instantiate the GA struct

Calling the Minimize method

Using the Slice interface

Models

Generational model

Steady state model

Select down to size model

Ring model

Mutation only

Speciation

Multiple populations and migration

Logging population statistics

Particle swarm optimization

Description

Example

Parameters

Differential evolution

Description

Example

Parameters

OpenAI evolution strategy

Description

Example

Parameters

Hill climbing

Description

Example

Simulated Annealing

Description

Example

A note on parallelism

FAQ

Dependencies

License