Neat Python Latest PDF
Neat Python Latest PDF
Release 0.92
CodeReclaimers, LLC
1 NEAT Overview 3
2 Installation 5
2.1 About The Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.2 Install neat-python from PyPI using pip . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.3 Install neat-python from source using setup.py . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
5 Customizing Behavior 19
5.1 New activation functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
5.2 Reporting/logging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
5.3 New genome types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
5.4 Speciation scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
5.5 Species stagnation scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
5.6 Reproduction scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
i
6.9 log . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.10 relu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.11 elu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.12 lelu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
6.13 selu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.14 sigmoid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.15 sin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.16 softplus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.17 square . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
6.18 tanh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
8 Module summaries 33
8.1 activations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
8.2 aggregations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
8.3 attributes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
8.4 checkpoint . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
8.5 config . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
8.6 ctrnn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
8.7 distributed . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
8.8 genes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
8.9 genome . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
8.10 graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
8.11 iznn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
8.12 math_util . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
8.13 nn.feed_forward . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
8.14 nn.recurrent . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
8.15 parallel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
8.16 population . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
8.17 reporting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
8.18 reproduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
8.19 six_util . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
8.20 species . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
8.21 stagnation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
8.22 statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
8.23 threaded . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
9 Genome Interface 75
9.1 Class Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
9.2 Initialization/Reproduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
9.3 Crossover/Mutation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
9.4 Speciation/Misc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
10 Reproduction Interface 77
10.1 Class Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
10.2 Initialization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
10.3 Other methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
11 Glossary 79
ii
NEAT-Python Documentation, Release 0.92
NEAT (NeuroEvolution of Augmenting Topologies) is a method developed by Kenneth O. Stanley for evolving arbi-
trary neural networks. NEAT-Python is a pure Python implementation of NEAT, with no dependencies other than the
Python standard library.
Note: Some of the example code has other dependencies; please see each example’s README.md file for additional
details and installation/setup instructions for the main code for each. In addition to dependencies varying with different
examples, visualization of the results (via visualize.py modules) frequently requires graphviz and/or matplotlib.
TODO: Improve README.md file information for the examples.
Support for HyperNEAT and other extensions to NEAT is planned once the fundamental NEAT implementation is
more complete and stable.
For further information regarding general concepts and theory, please see Selected Publications on Stanley’s website,
or his recent AMA on Reddit.
If you encounter any confusing or incorrect information in this documentation, please open an issue in the GitHub
project.
Contents:
Contents 1
NEAT-Python Documentation, Release 0.92
2 Contents
CHAPTER 1
NEAT Overview
NEAT (NeuroEvolution of Augmenting Topologies) is an evolutionary algorithm that creates artificial neural networks.
For a detailed description of the algorithm, you should probably go read some of Stanley’s papers on his website.
Even if you just want to get the gist of the algorithm, reading at least a couple of the early NEAT papers is a good idea.
Most of them are pretty short, and do a good job of explaining concepts (or at least pointing you to other references
that will). The initial NEAT paper is only 6 pages long, and Section II should be enough if you just want a high-level
overview.
In the current implementation of NEAT-Python, a population of individual genomes is maintained. Each genome
contains two sets of genes that describe how to build an artificial neural network:
1. Node genes, each of which specifies a single neuron.
2. Connection genes, each of which specifies a single connection between neurons.
To evolve a solution to a problem, the user must provide a fitness function which computes a single real number
indicating the quality of an individual genome: better ability to solve the problem means a higher score. The algorithm
progresses through a user-specified number of generations, with each generation being produced by reproduction
(either sexual or asexual) and mutation of the most fit individuals of the previous generation.
The reproduction and mutation operations may add nodes and/or connections to genomes, so as the algorithm proceeds
genomes (and the neural networks they produce) may become more and more complex. When the preset number of
generations is reached, or when at least one individual (for a fitness criterion function of max; others are configurable)
exceeds the user-specified fitness threshold, the algorithm terminates.
One difficulty in this setup is with the implementation of crossover - how does one do a crossover between two
networks of differing structure? NEAT handles this by keeping track of the origins of the nodes, with an identifying
number (new, higher numbers are generated for each additional node). Those derived from a common ancestor (that
are homologous) are matched up for crossover, and connections are matched if the nodes they connect have common
ancestry. (There are variations in exactly how this is done depending on the implementation of NEAT; this paragraph
describes how it is done in this implementation.)
Another potential difficulty is that a structural mutation - as opposed to mutations in, for instance, the weights of the
connections - such as the addition of a node or connection can, while being promising for the future, be disruptive in
the short-term (until it has been fine-tuned by less-disruptive mutations). How NEAT deals with this is by dividing
genomes into species, which have a close genomic distance due to similarity, then having competition most intense
3
NEAT-Python Documentation, Release 0.92
within species, not between species (fitness sharing). How is genomic distance measured? It uses a combination of the
number of non-homologous nodes and connections with measures of how much homologous nodes and connections
have diverged since their common origin. (Non-homologous nodes and connections are termed disjoint or excess,
depending on whether the numbers are from the same range or beyond that range; like most NEAT implementations,
this one makes no distinction between the two.)
Installation
Because neat-python is still changing fairly rapidly, attempting to run examples with a significantly newer or older
version of the library will result in errors. It is best to obtain matching example/library code by using one of the two
methods outlined below:
To install the most recent release (version 0.92) from PyPI, you should run the command (as root or using sudo as
necessary):
Note that the examples are not included with the package installed from PyPI, so you should download the source
archive for release 0.92 and use the example code contained in it.
You may also just get the 0.92 release source, and install it directly using setup.py (as shown below) instead of pip.
5
NEAT-Python Documentation, Release 0.92
6 Chapter 2. Installation
CHAPTER 3
The configuration file is in the format described in the Python configparser documentation as “a basic config-
uration file parser language which provides a structure similar to what you would find on Microsoft Windows INI
files.”
Most settings must be explicitly enumerated in the configuration file. (This makes it less likely that library code
changes will result in your project silently using different NEAT settings. There are some defaults, as noted below,
and insofar as possible new configuration parameters will default to the existing behavior.)
Note that the Config constructor also requires you to explicitly specify the types that will be used for the NEAT
simulation. This, again, is to help avoid silent changes in behavior.
The configuration file is in several sections, of which at least one is required. However, there are no requirements for
ordering within these sections, or for ordering of the sections themselves.
The NEAT section specifies parameters particular to the generic NEAT algorithm or the experiment itself. This section
is always required, and is handled by the Config class itself.
• fitness_criterion The function used to compute the termination criterion from the set of genome fitnesses. Al-
lowable values are: min, max, and mean
• fitness_threshold When the fitness computed by fitness_criterion meets or exceeds this threshold, the
evolution process will terminate, with a call to any registered reporting class’ found_solution method.
Note: The found_solution method is not called if the maximum number of generations is reached with-
out the above threshold being passed (if attention is being paid to fitness for termination in the first place - see
no_fitness_termination below).
7
NEAT-Python Documentation, Release 0.92
method is called upon generation number termination. If it evaluates to False, then fitness is used to
determine termination. This defaults to “False”.
New in version 0.92.
• pop_size The number of individuals in each generation.
• reset_on_extinction If this evaluates to True, when all species simultaneously become extinct due to stagna-
tion, a new random population will be created. If False, a CompleteExtinctionException will
be thrown.
The DefaultStagnation section specifies parameters for the builtin DefaultStagnation class. This section
is only necessary if you specify this class as the stagnation implementation when creating the Config instance;
otherwise you need to include whatever configuration (if any) is required for your particular implementation.
• species_fitness_func The function used to compute species fitness. This defaults to ‘‘mean‘‘. Allowed values
are: max, min, mean, and median
Note: This is not used for calculating species fitness for apportioning reproduction (which always uses mean).
• max_stagnation Species that have not shown improvement in more than this number of generations will be
considered stagnant and removed. This defaults to 15.
• species_elitism The number of species that will be protected from stagnation; mainly intended to prevent
total extinctions caused by all species becoming stagnant before new species arise. For example, a
species_elitism setting of 3 will prevent the 3 species with the highest species fitness from be-
ing removed for stagnation regardless of the amount of time they have not shown improvement. This
defaults to 0.
The DefaultReproduction section specifies parameters for the builtin DefaultReproduction class. This
section is only necessary if you specify this class as the reproduction implementation when creating the Config
instance; otherwise you need to include whatever configuration (if any) is required for your particular implementation.
• elitism The number of most-fit individuals in each species that will be preserved as-is from one generation to
the next. This defaults to 0.
• survival_threshold The fraction for each species allowed to reproduce each generation. This defaults to 0.2.
• min_species_size The minimum number of genomes per species after reproduction. This defaults to 2.
The DefaultGenome section specifies parameters for the builtin DefaultGenome class. This section is only
necessary if you specify this class as the genome implementation when creating the Config instance; otherwise you
need to include whatever configuration (if any) is required for your particular implementation.
• activation_default The default activation function attribute assigned to new nodes. If none is given, or
“random” is specified, one of the activation_options will be chosen at random.
• activation_mutate_rate The probability that mutation will replace the node’s activation function with a
randomly-determined member of the activation_options. Valid values are in [0.0, 1.0].
• activation_options A space-separated list of the activation functions that may be used by nodes. This defaults
to sigmoid. The built-in available functions can be found in Overview of builtin activation functions; more
can be added as described in Customizing Behavior.
• aggregation_default The default aggregation function attribute assigned to new nodes. If none is given, or
“random” is specified, one of the aggregation_options will be chosen at random.
• aggregation_mutate_rate The probability that mutation will replace the node’s aggregation function with a
randomly-determined member of the aggregation_options. Valid values are in [0.0, 1.0].
• aggregation_options A space-separated list of the aggregation functions that may be used by nodes. This
defaults to “sum”. The available functions (defined in aggregations) are: sum, product, min,
max, mean, median, and maxabs (which returns the input value with the greatest absolute value; the
returned value may be positive or negative). New aggregation functions can be defined similarly to new
activation functions. (Note that the function needs to take a list or other iterable; the reduce
function, as in aggregations, may be of use in this.)
Changed in version 0.92: Moved out of genome into aggregations; maxabs, mean, and median
added; method for defining new aggregation functions added.
• bias_init_mean The mean of the normal/gaussian distribution, if it is used to select bias attribute values for
new nodes.
• bias_init_stdev The standard deviation of the normal/gaussian distribution, if it is used to select bias values for
new nodes.
• bias_init_type If set to gaussian or normal, then the initialization is to a normal/gaussian distribution. If set
to uniform, a uniform distribution from max(𝑏𝑖𝑎𝑠_𝑚𝑖𝑛_𝑣𝑎𝑙𝑢𝑒, (𝑏𝑖𝑎𝑠_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛−(𝑏𝑖𝑎𝑠_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣*
2))) to min(𝑏𝑖𝑎𝑠_𝑚𝑎𝑥_𝑣𝑎𝑙𝑢𝑒, (𝑏𝑖𝑎𝑠_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛 + (𝑏𝑖𝑎𝑠_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣 * 2))). (Note that the standard de-
viation of a uniform distribution is not range/0.25, as implied by this, but the range divided by a bit over
0.288 (the square root of 12); however, this approximation makes setting the range much easier.) This
defaults to “gaussian”.
New in version 0.92.
• bias_max_value The maximum allowed bias value. Biases above this value will be clamped to this value.
• bias_min_value The minimum allowed bias value. Biases below this value will be clamped to this value.
• bias_mutate_power The standard deviation of the zero-centered normal/gaussian distribution from which a bias
value mutation is drawn.
• bias_mutate_rate The probability that mutation will change the bias of a node by adding a random value.
• bias_replace_rate The probability that mutation will replace the bias of a node with a newly chosen random
value (as if it were a new node).
• compatibility_threshold Individuals whose genomic distance is less than this threshold are considered to be in
the same species.
• compatibility_disjoint_coefficient The coefficient for the disjoint and excess gene counts’ contribution to the
genomic distance.
• compatibility_weight_coefficient The coefficient for each weight, bias, or response multiplier difference’s con-
tribution to the genomic distance (for homologous nodes or connections). This is also used as the value to
add for differences in activation functions, aggregation functions, or enabled/disabled status.
Note: It is currently possible for two homologous nodes or connections to have a higher contribution to the genomic
distance than a disjoint or excess node or connection, depending on their attributes and the settings of the above
parameters.
• conn_add_prob The probability that mutation will add a connection between existing nodes. Valid values are
in [0.0, 1.0].
• conn_delete_prob The probability that mutation will delete an existing connection. Valid values are in [0.0,
1.0].
• enabled_default The default enabled attribute of newly created connections. Valid values are True and
False.
Note: “Newly created connections” include ones in newly-created genomes, if those have initial connections (from
the setting of the initial_connection variable).
• enabled_mutate_rate The probability that mutation will replace (50/50 chance of True or False) the
enabled status of a connection. Valid values are in [0.0, 1.0].
• enabled_rate_to_false_add Adds to the enabled_mutate_rate if the connection is currently enabled.
• enabled_rate_to_true_add Adds to the enabled_mutate_rate if the connection is currently not enabled.
New in version 0.92: enabled_rate_to_false_add and enabled_rate_to_true_add
• feed_forward If this evaluates to True, generated networks will not be allowed to have recurrent connections
(they will be feedforward). Otherwise they may be (but are not forced to be) recurrent.
• initial_connection Specifies the initial connectivity of newly-created genomes. (Note the effects on settings
other than unconnected of the enabled_default parameter.) There are seven allowed values:
– unconnected - No connections are initially present. This is the default.
– fs_neat_nohidden - One randomly-chosen input node has one connection to each output node.
(This is one version of the FS-NEAT scheme; “FS” stands for “Feature Selection”.)
– fs_neat_hidden - One randomly-chosen input node has one connection to each hidden and output
node. (This is another version of the FS-NEAT scheme. If there are no hidden nodes, it is the same as
fs_neat_nohidden.)
– full_nodirect - Each input node is connected to all hidden nodes, if there are any, and each
hidden node is connected to all output nodes; otherwise, each input node is connected to all output
nodes. Genomes with feed_forward set to False will also have recurrent (loopback, in this case)
connections from each hidden or output node to itself.
– full_direct - Each input node is connected to all hidden and output nodes, and each hidden node
is connected to all output nodes. Genomes with feed_forward set to False will also have recurrent
(loopback, in this case) connections from each hidden or output node to itself.
– partial_nodirect # - As for full_nodirect, but each connection has a probability of be-
ing present determined by the number (valid values are in [0.0, 1.0]).
– partial_direct # - as for full_direct, but each connection has a probability of being
present determined by the number (valid values are in [0.0, 1.0]).
Changed in version 0.92: fs_neat split into fs_neat_nohidden and fs_neat_hidden; full, partial split into full_nodirect,
full_direct, partial_nodirect, partial_direct
• node_add_prob The probability that mutation will add a new node (essentially replacing an existing connection,
the enabled status of which will be set to False). Valid values are in [0.0, 1.0].
• node_delete_prob The probability that mutation will delete an existing node (and all connections to it). Valid
values are in [0.0, 1.0].
• num_hidden The number of hidden nodes to add to each genome in the initial population.
• num_inputs The number of input nodes, through which the network receives inputs.
• num_outputs The number of output nodes, to which the network delivers outputs.
• response_init_mean The mean of the normal/gaussian distribution, if it is used to select response multiplier
attribute values for new nodes.
• response_init_stdev The standard deviation of the normal/gaussian distribution, if it is used to select response
multipliers for new nodes.
• response_init_type If set to gaussian or normal, then the initialization is to a normal/gaussian distribution.
If set to uniform, a uniform distribution from max(𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑚𝑖𝑛_𝑣𝑎𝑙𝑢𝑒, (𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛 −
(𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣 * 2))) to min(𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑚𝑎𝑥_𝑣𝑎𝑙𝑢𝑒, (𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛 +
(𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣 * 2))). (Note that the standard deviation of a uniform distribution is not
range/0.25, as implied by this, but the range divided by a bit over 0.288 (the square root of 12); however,
this approximation makes setting the range much easier.) This defaults to “gaussian”.
New in version 0.92.
• response_max_value The maximum allowed response multiplier. Response multipliers above this value will
be clamped to this value.
• response_min_value The minimum allowed response multiplier. Response multipliers below this value will be
clamped to this value.
• response_mutate_power The standard deviation of the zero-centered normal/gaussian distribution from which
a response multiplier mutation is drawn.
• response_mutate_rate The probability that mutation will change the response multiplier of a node by adding a
random value.
• response_replace_rate The probability that mutation will replace the response multiplier of a node with a newly
chosen random value (as if it were a new node).
• single_structural_mutation If this evaluates to True, only one structural mutation (the addition or removal of
a node or connection) will be allowed per genome per generation. (If the probabilities for conn_add_prob,
conn_delete_prob, node_add_prob, and node_delete_prob add up to over 1, the chances of each are pro-
portional to the appropriate configuration value.) This defaults to “False”.
New in version 0.92.
• structural_mutation_surer If this evaluates to True, then an attempt to add a node to a genome lacking con-
nections will result in adding a connection instead; furthermore, if an attempt to add a connection tries to
add a connection that already exists, that connection will be enabled. If this is set to default, then it acts
as if it had the same value as single_structural_mutation (above). This defaults to “default”.
New in version 0.92.
• weight_init_mean The mean of the normal/gaussian distribution used to select weight attribute values for
new connections.
• weight_init_stdev The standard deviation of the normal/gaussian distribution used to select weight values for
new connections.
• weight_init_type If set to gaussian or normal, then the initialization is to a normal/gaussian distribu-
tion. If set to uniform, a uniform distribution from max(𝑤𝑒𝑖𝑔ℎ𝑡_𝑚𝑖𝑛_𝑣𝑎𝑙𝑢𝑒, (𝑤𝑒𝑖𝑔ℎ𝑡_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛 −
(𝑤𝑒𝑖𝑔ℎ𝑡_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣 * 2))) to min(𝑤𝑒𝑖𝑔ℎ𝑡_𝑚𝑎𝑥_𝑣𝑎𝑙𝑢𝑒, (𝑤𝑒𝑖𝑔ℎ𝑡_𝑖𝑛𝑖𝑡_𝑚𝑒𝑎𝑛 + (𝑤𝑒𝑖𝑔ℎ𝑡_𝑖𝑛𝑖𝑡_𝑠𝑡𝑑𝑒𝑣 *
2))). (Note that the standard deviation of a uniform distribution is not range/0.25, as implied by this, but
the range divided by a bit over 0.288 (the square root of 12); however, this approximation makes setting
the range much easier.) This defaults to “gaussian”.
The xor2.py example, shown in its entirety at the bottom of this page, evolves a network that implements the two-input
XOR function:
The key thing you need to figure out for a given problem is how to measure the fitness of the genomes that are produced
by NEAT. Fitness is expected to be a Python float value. If genome A solves your problem more successfully than
genome B, then the fitness value of A should be greater than the value of B. The absolute magnitude and signs of these
fitnesses are not important, only their relative values.
In this example, we create a feed-forward neural network based on the genome, and then for each case in the table
above,
∑︀we provide that network with the inputs, and compute the network’s output. The error for each genome is
1 − 𝑖 (𝑒𝑖 − 𝑎𝑖 )2 between the expected (𝑒𝑖 ) and actual (𝑎𝑖 ) outputs, so that if the network produces exactly the
expected output, its fitness is 1, otherwise it is a value less than 1, with the fitness value decreasing the more incorrect
the network responses are.
This fitness computation is implemented in the eval_genomes function. This function takes two arguments: a list
of genomes (the current population) and the active configuration. neat-python expects the fitness function to calculate
a fitness for each genome and assign this value to the genome’s fitness member.
13
NEAT-Python Documentation, Release 0.92
Once you have implemented a fitness function, you mostly just need some additional boilerplate code that carries out
the following steps:
• Create a neat.config.Config object from the configuration file (described in the Configuration file de-
scription).
• Create a neat.population.Population object using the Config object created above.
• Call the run method on the Population object, giving it your fitness function and (optionally) the maximum
number of generations you want NEAT to run.
After these three things are completed, NEAT will run until either you reach the specified number of generations, or
at least one genome achieves the fitness_threshold value you specified in your config file.
Once the call to the population object’s run method has returned, you can query the statistics member of the
population (a neat.statistics.StatisticsReporter object) to get the best genome(s) seen during the run.
In this example, we take the ‘winner’ genome to be that returned by pop.statistics.best_genome().
Other information available from the default statistics object includes per-generation mean fitness, per-generation
standard deviation of fitness, and the best N genomes (with or without duplicates).
4.4 Visualizations
Functions are available in the visualize module to plot the best and average fitness vs. generation, plot the change in
species vs. generation, and to show the structure of a network described by a genome.
NOTE: This page shows the source and configuration file for the current version of neat-python available on GitHub.
If you are using the version 0.92 installed from PyPI, make sure you get the script and config file from the archived
source for that release.
Here’s the entire example:
"""
2-input XOR example -- this is most likely the simplest possible example.
"""
def run(config_file):
# Load configuration.
config = neat.Config(neat.DefaultGenome, neat.DefaultReproduction,
neat.DefaultSpeciesSet, neat.DefaultStagnation,
config_file)
# Create the population, which is the top-level object for a NEAT run.
p = neat.Population(config)
p = neat.Checkpointer.restore_checkpoint('neat-checkpoint-4')
p.run(eval_genomes, 10)
if __name__ == '__main__':
# Determine path to configuration file. This path manipulation is
# here so that the script will run successfully regardless of the
# current working directory.
local_dir = os.path.dirname(__file__)
config_path = os.path.join(local_dir, 'config-feedforward')
run(config_path)
[NEAT]
fitness_criterion = max
fitness_threshold = 3.9
pop_size = 150
reset_on_extinction = False
[DefaultGenome]
# node activation options
activation_default = sigmoid
activation_mutate_rate = 0.0
activation_options = sigmoid
feed_forward = True
initial_connection = full
# network parameters
num_hidden = 0
num_inputs = 2
num_outputs = 1
[DefaultSpeciesSet]
compatibility_threshold = 3.0
[DefaultStagnation]
species_fitness_func = max
max_stagnation = 20
species_elitism = 2
[DefaultReproduction]
elitism = 2
survival_threshold = 0.2
Customizing Behavior
NEAT-Python allows the user to provide drop-in replacements for some parts of the NEAT algorithm, which hopefully
makes it easier to implement common variations of the algorithm as mentioned in the literature. If you find that you’d
like to be able to customize something not shown here, please submit an issue on GitHub.
New activation functions are registered with your Config instance, prior to creation of the Population instance,
as follows:
def sinc(x):
return 1.0 if x == 0 else sin(x) / x
config.genome_config.add_activation('my_sinc_function', sinc)
The first argument to add_activation is the name by which this activation function will be referred to in the
configuration settings file.
This is demonstrated in the memory-fixed example.
Note: This method is only valid when using the DefaultGenome implementation, with the method being found in
the DefaultGenomeConfig implementation; different genome implementations may require a different method
of registration.
5.2 Reporting/logging
The Population class makes calls to a collection of zero or more reporters at fixed points during the evolution process.
The user can add a custom reporter to this collection by calling Population.add_reporter and providing it with an object
19
NEAT-Python Documentation, Release 0.92
which implements the same interface as BaseReporter (in reporting.py), probably partially by subclassing
it.
StdOutReporter, StatisticsReporter, and Checkpointer may be useful as examples of the behavior
you can add using a reporter.
To use a different genome type, you can create a custom class whose interface matches that of DefaultGenome
and pass this as the genome_type argument to the Config constructor. The minimum genome type interface is
documented here: Genome Interface.
This is demonstrated in the circuit evolution example.
Alternatively, you can subclass DefaultGenome in cases where you need to just add some extra behavior. This is
done in the OpenAI lander example to add an evolvable per-genome reward discount value. It is also done in the iznn
setup, with IZGenome.
To use a different speciation scheme, you can create a custom class whose interface matches that of
DefaultSpeciesSet and pass this as the species_set_type argument to the Config constructor.
Note: TODO: Further document species set interface (some done in module_summaries)
The default species stagnation scheme is a simple fixed stagnation limit–when a species exhibits no improvement for
a fixed number of generations, all its members are removed from the simulation. This behavior is encapsulated in the
DefaultStagnation class.
To use a different species stagnation scheme, you must create a custom class whose interface matches that of
DefaultStagnation, and provide it as the stagnation_type argument to the Config constructor.
This is demonstrated in the interactive 2D image example.
The default reproduction scheme uses explicit fitness sharing. This behavior is encapsulated in the
DefaultReproduction class. The minimum reproduction type interface is documented here: Reproduction In-
terface
To use a different reproduction scheme, you must create a custom class whose interface matches that of
DefaultReproduction, and provide it as the reproduction_type argument to the Config constructor.
Note that some of these functions are scaled differently from the canonical versions you may be familiar with. The
intention of the scaling is to place more of the functions’ “interesting” behavior in the region [−1, 1] × [−1, 1].
The implementation of these functions can be found in the activations module.
6.1 abs
23
NEAT-Python Documentation, Release 0.92
6.2 clamped
6.3 cube
6.4 exp
6.5 gauss
6.6 hat
6.2. clamped 25
NEAT-Python Documentation, Release 0.92
6.7 identity
6.8 inv
6.9 log
6.10 relu
6.11 elu
6.12 lelu
6.7. identity 27
NEAT-Python Documentation, Release 0.92
6.13 selu
6.14 sigmoid
6.15 sin
6.16 softplus
6.17 square
6.18 tanh
6.13. selu 29
NEAT-Python Documentation, Release 0.92
The default continuous-time recurrent neural network (CTRNN) implementation in neat-python is modeled as a
system of ordinary differential equations, with neuron potentials as the dependent variables.
(︃ )︃
𝜏𝑖 𝑑𝑦
∑︀
𝑑𝑡 = −𝑦𝑖 + 𝑓𝑖 𝛽𝑖 +
𝑖
𝑤𝑖𝑗 𝑦𝑗
𝑗∈𝐴𝑖
Where:
• 𝜏𝑖 is the time constant of neuron 𝑖.
• 𝑦𝑖 is the potential of neuron 𝑖.
• 𝑓𝑖 is the activation function of neuron 𝑖.
• 𝛽𝑖 is the bias of neuron 𝑖.
• 𝐴𝑖 is the set of indices of neurons that provide input to neuron 𝑖.
• 𝑤𝑖𝑗 is the weight of the connection from neuron 𝑗 to neuron 𝑖.
The time evolution of the network is computed using the forward Euler method:
𝑦𝑖 (𝑡 + ∆𝑡) = 𝑦𝑖 (𝑡) + ∆𝑡 𝑑𝑦
𝑑𝑡
𝑖
31
NEAT-Python Documentation, Release 0.92
Module summaries
8.1 activations
Has the built-in activation functions, code for using them, and code for adding new user-defined ones.
exception activations.InvalidActivationFunction(TypeError)
Exception called if an activation function being added is invalid according to the
validate_activation function, or if an unknown activation function is requested by name
via get.
Changed in version 0.92: Base of exception changed to more-precise TypeError.
activations.validate_activation(function)
Checks to make sure its parameter is a function that takes a single argument.
Parameters function (object) – Object to be checked.
Raises InvalidActivationFunction – If the object does not pass the tests.
class activations.ActivationFunctionSet
Contains the list of current valid activation functions, including methods for adding and getting
them.
add(name, function)
After validating the function (via validate_activation), adds it to the avail-
able activation functions under the given name. Used by DefaultGenomeConfig.
add_activation.
Parameters
• name (str) – The name by which the function is to be known in the configuration
file.
• function (function) – The function to be added.
get(name)
Returns the named function, or raises an exception if it is not a known activation function.
Parameters name (str) – The name of the function.
Returns The function of interest
33
NEAT-Python Documentation, Release 0.92
8.2 aggregations
Has the built-in aggregation functions, code for using them, and code for adding new user-defined ones.
Note: Non-enabled connections will, by all methods currently included in NEAT-Python, not be included
among the numbers input to these functions, even as 0s.
aggregations.product_aggregation(x)
An adaptation of the multiplication function to take an iterable.
Parameters x (list(float) or tuple(float) or set(float)) – The numbers to be multiplied to-
gether; takes any iterable.
∏︀
Returns (𝑥)
Return type float
aggregations.sum_aggregation(x)
Probably the most commonly-used aggregation function.
Parameters x (list(float) or tuple(float) or set(float)) – The numbers to find the sum of;
takes any iterable.
∑︀
Returns (𝑥)
Return type float
aggregations.max_aggregation(x)
Returns the maximum of the inputs.
Parameters x (list(float) or tuple(float) or set(float)) – The numbers to find the greatest
of; takes any iterable.
Returns max(𝑥)
Return type float
aggregations.min_aggregation(x)
Returns the minimum of the inputs.
Parameters x (list(float) or tuple(float) or set(float)) – The numbers to find the least of;
takes any iterable.
Returns min(𝑥)
Return type float
aggregations.maxabs_aggregation(x)
Returns the maximum by absolute value, which may be positive or negative. Envisioned as suitable
for neural network pooling operations.
8.2. aggregations 35
NEAT-Python Documentation, Release 0.92
• name (str) – The name by which the function is to be known in the configuration
file.
• function (function) – The function to be added.
New in version 0.92.
get(name)
Returns the named function, or raises an exception if it is not a known aggregation function.
Parameters name (str) – The name of the function.
Returns The function of interest
Return type function
Raises InvalidAggregationFunction – If the function is not known.
New in version 0.92.
__getitem__(index)
Present for compatibility with older programs that expect the aggregation functions to be in a
dict. A wrapper for get(index).
Parameters index (str) – The name of the function.
Returns The function of interest.
Return type function
Raises
• InvalidAggregationFunction – If the function is not known.
• DeprecationWarning – Always.
Changed in version 0.92: Originally a dictionary in genome.
Deprecated since version 0.92: Use get(index) instead.
is_valid(name)
Checks whether the named function is a known aggregation function.
Parameters name (str) – The name of the function.
Returns Whether or not the function is known.
Return type bool
New in version 0.92.
Changed in version 0.92: Moved from genome and expanded to match activations (plus the
maxabs, median, and mean functions added).
8.3 attributes
attributes.BoolAttribute
attributes.BaseAttribute attributes.FloatAttribute
attributes.StringAttribute
8.3. attributes 37
NEAT-Python Documentation, Release 0.92
mutate_value(value, config)
May replace (as if reinitializing, using init_value), mutate (using a 0-mean gaussian dis-
tribution with a configured standard deviation from mutate_power), or leave alone the input
value, depending on the configuration settings (of replace_rate and mutate_rate).
Parameters
• value (float) – The current value of the attribute.
• config (instance) – The configuration object from which the parameters are to
be extracted.
Returns Either the original value, if unchanged, or the new value.
Return type float
class attributes.BoolAttribute(BaseAttribute)
Class for boolean attributes such as whether a connection is enabled or not; includes code for con-
figuration, creation, and mutation.
init_value(config)
Initializes the attribute’s value, either using a configured default, or (if the default is “ran-
dom”) with a 50/50 chance of True or False.
Deprecated since version 0.92: While it is possible to use “None” as an equivalent to “random”,
this is too easily confusable with an actual None.
Changed in version 0.92: Ability to use “random” for a 50/50 chance of True or False added.
Parameters config (instance) – The configuration object from which the default
parameter is to be retrieved.
Returns The new value.
Return type bool
Raises RuntimeError – If the default value is not recognized as standing for any
of True, False, “random”, or “none”.
mutate_value(value, config)
With a frequency determined by the mutate_rate and rate_to_false_add or
rate_to_true_add configuration parameters, replaces the value with a 50/50 chance of
True or False; note that this has a 50% chance of leaving the value unchanged.
Parameters
• value (bool) – The current value of the attribute.
• config (instance) – The configuration object from which the mutate_rate
and other parameters are to be extracted.
Returns Either the original value, if unchanged, or the new value.
Return type bool
Changed in version 0.92: Added the rate_to_false_add and rate_to_true_add pa-
rameters.
class attributes.StringAttribute(BaseAttribute)
Class for string attributes such as the aggregation function of a node, which are selected from a list
of options; includes code for configuration, creation, and mutation.
init_value(config)
Initializes the attribute’s value, either using a configured default or (if the default is “ran-
dom”) with a randomly-chosen member of the options (each having an equal chance). Note:
It is possible for the default value, if specifically configured, to not be one of the options.
Deprecated since version 0.92: While it is possible to use “None” as an equivalent to “random”,
this is too easily confusable with an actual None.
Parameters config (instance) – The configuration object from which the default
and, if necessary, options parameters are to be retrieved.
Returns The new value.
Return type str
mutate_value(value, config)
With a frequency determined by the mutate_rate configuration parameter, replaces the
value with one of the options, with each having an equal chance; note that this can be the
same value as before. (It is possible to crudely alter the chances of what is chosen by listing a
given option more than once, although this is inefficient given the use of the random.choice
function.) TODO: Add configurable probabilities of which option is used. Longer-term, as with
the improved version of RBF-NEAT, separate genes for the likelihoods of each (but always do-
ing some change, to prevent overly-conservative evolution due to its inherent short-sightedness),
allowing the genomes to control the distribution of options, will be desirable.
Parameters
• value (str) – The current value of the attribute.
• config (instance) – The configuration object from which the options and
other parameters are to be extracted.
Returns The new value.
Return type str
Changed in version 0.92: __config_items__ changed to _config_items, since it is not a Python
internal variable.
8.4 checkpoint
Uses pickle to save and restore populations (and other aspects of the simulation state).
Note: The speed of this module can vary widely between python implementations (and perhaps versions).
class checkpoint.Checkpointer(generation_interval=100,
time_interval_seconds=300, filename_prefix=’neat-
checkpoint-’)
A reporter class that performs checkpointing, saving and restoring the simulation state (in-
cluding population, randomization, and other aspects). It saves the current state every
generation_interval generations or time_interval_seconds seconds, whichever
happens first. Subclasses reporting.BaseReporter. (The potential save point is at the end
of a generation.) The start of the filename will be equal to filename_prefix, followed by the
generation number. If there is a need to check the last generation for which a checkpoint was saved,
such as to determine which file to load, access last_generation_checkpoint; if -1, none
have been saved.
Parameters
• generation_interval (int or None) – If not None, maximum number of gen-
erations between checkpoints.
• time_interval_seconds (float or None) – If not None, maximum number of
seconds between checkpoints.
• filename_prefix (str) – The prefix for the checkpoint file names.
save_checkpoint(config, population, species, generation)
Saves the current simulation (including randomization) state to (if using the default
neat-checkpoint- for filename_prefix) neat-checkpoint-generation,
with generation being the generation number.
Parameters
• config (instance) – The config.Config configuration instance to be used.
8.4. checkpoint 39
NEAT-Python Documentation, Release 0.92
8.5 config
Does general configuration parsing; used by other classes for their configuration.
class config.ConfigParameter(name, value_type, default=None)
Does initial handling of a particular configuration parameter.
Parameters
• name (str) – The name of the configuration parameter.
• value_type – The type that the configuration parameter should be; must be one
of str, int, bool, float, or list.
• default (str or None) – If given, the default to use for the configuration
parameter.
Changed in version 0.92: Default capability added.
__repr__()
Returns a representation of the class suitable for use in code for initialization.
Returns Representation as for repr.
Return type str
parse(section, config_parser)
Uses the supplied configuration parser (either from the configparser.ConfigParser
class, or - for 2.7 - the ConfigParser.SafeConfigParser class) to gather the configuration param-
eter from the appropriate configuration file section. Parsing varies depending on the type.
Parameters
• section (str) – The section name, taken from the __name__ attribute of the
class to be configured (or NEAT for those parameters).
• config_parser (instance) – The configuration parser to be used.
Returns The configuration parameter value, in stringified form unless a list.
Return type str or list(str)
interpret(config_dict)
Takes a dictionary of configuration parameters, as output by the configuration parser called
in parse(), and interprets them into the proper type, with some error-checking.
Parameters config_dict (dict(str, str)) – Configuration parameters as
output by the configuration parser.
Returns The configuration parameter value
Return type str or int or bool or float or list(str)
Raises
• RuntimeError – If there is a problem with the configuration parameter.
• DeprecationWarning – If a default is used.
Changed in version 0.92: Default capability added.
format(value)
Depending on the type of configuration parameter, returns either a space-separated list version,
for list parameters, or the stringified version (using str), of value.
Parameters value (str or int or bool or float or list) – Configuration parameter value
to be formatted.
Returns String version.
Return type str
config.write_pretty_params(f, config, params)
Prints configuration parameters, with justification based on the longest configuration parameter
name.
Parameters
• f (file) – File object to be written to.
• config (instance) – Configuration object from which parameter values are to be
fetched (using getattr).
• params (list(instance)) – List of ConfigParameter instances giving the names
of interest and the types of parameters.
exception config.UnknownConfigItemError(NameError)
Error for unknown configuration option(s) - partially to catch typos. TODO: genome.
DefaultGenomeConfig does not currently check for these.
New in version 0.92.
class config.DefaultClassConfig(param_dict, param_list)
Replaces at least some boilerplate configuration code for reproduction, species_set, and stagnation
classes.
Parameters
• param_dict (dict(str, str)) – Dictionary of configuration parameters
from config file.
• param_list (list(instance)) – List of ConfigParameter instances; used to
know what parameters are of interest to the calling class.
Raises UnknownConfigItemError – If a key in param_dict is not among the
names in param_list.
classmethod write_config(f, config)
Required method (inherited by calling classes). Uses write_pretty_params() to output
parameters of interest to the calling class.
Parameters
• f (file) – File object to be written to.
• config (instance) – DefaultClassConfig instance.
New in version 0.92.
class config.Config(genome_type, reproduction_type, species_set_type, stagnation_type,
filename)
A simple container for user-configurable parameters of NEAT. The four parameters ending in
_type may be the built-in ones or user-provided objects, which must make available the meth-
ods parse_config and write_config, plus others depending on which object it is. (For
8.5. config 41
NEAT-Python Documentation, Release 0.92
more information on the objects, see below and Customizing Behavior.) Config itself takes care
of the NEAT parameters, which are found as some of its attributes. For a description of the config-
uration file, see Configuration file description. The __name__ attributes of the _type parameters
are used for the titles of the configuration file sections. A Config instance’s genome_config,
species_set_config, stagnation_config, and reproduction_config attributes
hold the configuration objects for the respective classes.
Parameters
• genome_type (class) – Specifies the genome class used, such as genome.
DefaultGenome or iznn.IZGenome. See Genome Interface for the needed
interface.
• reproduction_type (class) – Specifies the reproduction class used, such as
reproduction.DefaultReproduction. See Reproduction Interface for
the needed interface.
• species_set_type (class) – Specifies the species set class used, such as
species.DefaultSpeciesSet.
• stagnation_type (class) – Specifies the stagnation class used, such as
stagnation.DefaultStagnation.
• filename (str) – Pathname for configuration file to be opened, read, processed
by a parser from the configparser.ConfigParser class (or, for 2.7, the
ConfigParser.SafeConfigParser class), the NEAT section handled by Config, and
then other sections passed to the parse_config methods of the appropriate
classes.
Raises
• AssertionError – If any of the _type classes lack a parse_config
method.
• UnknownConfigItemError – If an option in the NEAT section of the configu-
ration file is not recognized.
• DeprecationWarning – If a default is used for one of the NEAT section options.
Changed in version 0.92: Added default capabilities, UnknownConfigItemError,
no_fitness_termination.
save(filename)
Opens the specified file for writing (not appending) and outputs a configuration file from the
current configuration. Uses write_pretty_params() for the NEAT parameters and the
appropriate class write_config methods for the other sections. (A comparison of it and the
input configuration file can be used to determine any default parameters of interest.)
Parameters filename (str) – The configuration file to be written.
8.6 ctrnn
8.7 distributed
Note: This module is in a beta state, and still unstable even in single-machine testing. Reliability is likely
to vary, including depending on the Python version and implementation (e.g., cpython vs pypy) in use and
the likelihoods of timeouts (due to machine and/or network slowness). In particular, while the code can try
to reconnect between between primary and secondary nodes, as noted in the multiprocessing docu-
mentation this may not work due to data loss/corruption. Note also that this module is not responsible for
starting the script copies on the different compute nodes, since this is very site/configuration-dependent.
8.7. distributed 43
NEAT-Python Documentation, Release 0.92
The primary compute node (the node which creates and mutates genomes) and the secondary com-
pute nodes (the nodes which evaluate genomes) can execute the same script. The role of a compute
node is determined using the mode argument of the DistributedEvaluator. If the mode is MODE_AUTO,
the host_is_local() function is used to check if the addr argument points to the localhost. If
it does, the compute node starts as a primary node, and otherwise as a secondary node. If mode is
MODE_PRIMARY, the compute node always starts as a primary node. If mode is MODE_SECONDARY,
the compute node will always start as a secondary node.
There can only be one primary node per NEAT, but any number of secondary nodes. The primary node
will not evaluate any genomes, which means you will always need at least two compute nodes (one
primary and at least one secondary).
You can run any number of compute nodes on the same physical machine (or VM). However, if a ma-
chine has both a primary node and one or more secondary nodes, MODE_AUTO cannot be used for those
secondary nodes - MODE_SECONDARY will need to be specified.
Usage:
1. Import modules and define the evaluation logic (the eval_genome function). (After this, check for
if __name__ == '__main__', and put the rest of the code inside the body of the statement,
or in subroutines called from it.)
2. Load config and create a population - here, the variable p.
3. If required, create and add reporters.
4. Create a DistributedEvaluator(addr_of_primary_node, b'some_password',
eval_function, mode=MODE_AUTO) - here, the variable de.
5. Call de.start(exit_on_stop=True). The start() call will block on the secondary nodes
and call sys.exit(0) when the NEAT evolution finishes. This means that the following code will only
be executed on the primary node.
6. Start the evaluation using p.run(de.evaluate, number_of_generations).
7. Stop the secondary nodes using de.stop().
8. You are done. You may want to save the winning genome(s) or show some statistics.
See examples/xor/evolve-feedforward-distributed.py for a complete example.
Note: The below contains some (but not complete) information about private functions, classes, and
similar (starting with _); this documentation is meant to help with maintaining and improving the code,
not for enabling external use, and the interface may change rapidly with no warning.
distributed.MODE_AUTO
distributed.MODE_PRIMARY
distributed.MODE_SECONDARY
Values - which should be treated as constants - that are used for the mode argu-
ment of DistributedEvaluator. If MODE_AUTO, _determine_mode() uses
host_is_local() and the specified addr of the primary node to decide the mode; the other
two specify it.
distributed._STATE_RUNNING
distributed._STATE_SHUTDOWN
distributed._STATE_FORCED_SHUTDOWN
Values - which should be treated as constants - that are used to determine the current state (whether
the secondaries should be continuing the run or not).
exception distributed.ModeError(RuntimeError)
An exception raised when a mode-specific method is being called without being in the mode - either
a primary-specific method called by a secondary node or a secondary-specific method called by a
primary node.
distributed.host_is_local(hostname, port=22)
Returns True if the hostname points to the localhost (including shares addresses), otherwise False.
Parameters
• hostname (str) – The hostname to be checked; will be put through socket.
getfqdn.
• port (int) – The optional port for socket functions requiring one. Defaults to 22,
the ssh port.
Returns Whether the hostname appears to be equivalent to that of the localhost.
Return type bool
distributed._determine_mode(addr, mode)
Returns the mode that should be used. If mode is MODE_AUTO, this is determined by checking (via
host_is_local()) if addr points to the localhost; if it does, it returns MODE_PRIMARY, else
it returns MODE_SECONDARY. If mode is either MODE_PRIMARY or MODE_SECONDARY, it
returns the mode argument. Otherwise, a ValueError is raised.
Parameters
• addr (tuple(str, int) or bytes) – Either a tuple of (hostname, port)
pointing to the machine that has the primary node, or the hostname (as bytes if on
3.X).
• mode (int) – Specifies the mode to run in - must be one of MODE_AUTO,
MODE_PRIMARY, or MODE_SECONDARY.
Raises ValueError – If the mode is not one of the above.
distributed.chunked(data, chunksize)
Splits up data and returns it as a list of chunks containing at most chunksize elements
of data.
Parameters
• data (list(object) or tuple(object) or set(object)) – The
data to split up; takes any iterable.
• chunksize (int) – The maximum number of elements per chunk.
Returns A list of chunks containing (as a list) at most chunksize elements of data.
Return type list(list(object))
Raises ValueError – If chunksize is not 1+ or is not an integer
8.7. distributed 45
NEAT-Python Documentation, Release 0.92
Parameters
• addr (tuple(str, int)) – Should be a tuple of (hostname, port) pointing
to the machine running the DistributedEvaluator in primary mode. If mode is
MODE_AUTO, the mode is determined by checking whether the hostname points
to this host or not (via _determine_mode() and host_is_local()).
• authkey (bytes) – The password used to restrict access to the manager. All Dis-
tributedEvaluators need to use the same authkey. Note that this needs to be a bytes
object for Python 3.X, and should be in 2.7 for compatibility (identical in 2.7 to a
str object). For more information, see under DistributedEvaluator.
• mode (int) – Specifies the mode to run in - must be one of
MODE_AUTO, MODE_PRIMARY, or MODE_SECONDARY. Processed by
_determine_mode().
• start (bool) – Whether to call the start() method after initialization.
__reduce__()
Used by pickle to serialize instances of this class. TODO: Appears to assume that start
(for initialization) should be true; perhaps self.manager should be checked? (This may
require :py:meth::stop() to set self.manager to None, incidentally.)
Returns Information about the class instance; a tuple of (class name, tuple(addr, au-
thkey, mode, True)).
Return type tuple(str, tuple(tuple(str, int), bytes, int, bool))
start()
Starts (if in MODE_PRIMARY) or connects to (if in MODE_SECONDARY) the manager.
stop()
Stops the manager using shutdown . TODO: Should this set self.manager to None?
set_secondary_state(value)
Sets the value for the secondary_state, shared between the nodes via multiprocess-
ing.managers.Value.
Parameters value (int) – The desired secondary state; must be one of
_STATE_RUNNING, _STATE_SHUTDOWN , or _STATE_FORCED_SHUTDOWN .
Raises
• ValueError – If the value is not one of the above.
• RuntimeError – If the manager has not been started.
secondary_state
The property secondary_state - whether the secondary nodes should still be processing
elements.
get_inqueue()
Returns the inqueue.
Returns The incoming queue.
Return type instance
Raises RuntimeError – If the manager has not been started.
get_outqueue()
Returns the outqueue.
Returns The outgoing queue.
Return type instance
Raises RuntimeError – If the manager has not been started.
get_namespace()
Returns the manager’s namespace instance.
Returns The namespace.
Warning: See Authentication Keys for more on the authkey parameter, used to restrict access
to the manager.
Parameters
• addr (tuple(str, int)) – Should be a tuple of (hostname, port) pointing
to the machine running the DistributedEvaluator in primary mode. If mode is
MODE_AUTO, the mode is determined by checking whether the hostname points
to this host or not (via host_is_local()).
• authkey (bytes) – The password used to restrict access to the manager. All Dis-
tributedEvaluators need to use the same authkey. Note that this needs to be a bytes
object for Python 3.X, and should be in 2.7 for compatibility (identical in 2.7 to a
str object).
• eval_function (function) – The eval_function should take two arguments -
a genome object and a config object - and return a single float (the genome’s fitness)
Note that this is not the same as how a fitness function is called by Population.
run, nor by ParallelEvaluator (although it is more similar to the latter).
• secondary_chunksize (int) – The number of genomes that will be sent to a
secondary node at any one time.
• num_workers (int or None) – The number of worker processes per secondary
node, used for evaluating genomes. If None, will use multiprocessing.cpu_count()
to determine the number of processes (see further below regarding this de-
fault). If 1 (for a secondary node), including if there is no usable result from
multiprocessing.cpu_count(), then the process creating the Distribut-
edEvaluator instance will also do the evaluations.
• worker_timeout (float or None) – specifies the timeout (in seconds) for a sec-
ondary node getting the results from a worker subprocess; if None, there is no time-
out.
• mode (int) – Specifies the mode to run in - must be one of MODE_AUTO (the
default), MODE_PRIMARY, or MODE_SECONDARY.
Raises ValueError – If the mode is not one of the above.
Note: Whether the default for num_workers is appropriate can vary depending on the evalua-
tion function (e.g., whether cpu-bound, memory-bound, i/o-bound. . . ), python implementation, and
other factors; if unsure and maximal per-machine performance is critical, experimentation will be
required.
is_primary()
Returns True if the caller is the primary node; otherwise False.
8.7. distributed 47
NEAT-Python Documentation, Release 0.92
8.8 genes
neat.genes.BaseGene iznn.IZNodeGene
genes.DefaultConnectionGene
genes.BaseGene
genes.DefaultNodeGene
class genes.BaseGene(key)
Handles functions shared by multiple types of genes (both node and connection), including crossover
and calling mutation methods.
Parameters key (int or tuple(int, int)) – The gene identifier. Note: For connection genes,
determining whether they are homologous (for genomic distance and crossover deter-
mination) uses the (ordered) identifiers of the connected nodes.
__str__()
Converts gene attributes into a printable format.
Returns Stringified gene instance.
Return type str
__lt__(other)
Allows sorting genes by keys.
Parameters other (instance) – The other BaseGene instance.
Returns Whether the calling instance’s key is less than that of the other instance.
Return type bool
classmethod parse_config(config, param_dict)
Placeholder; parameters are entirely in gene attributes.
classmethod get_config_params()
Fetches configuration parameters from each gene class’ _gene_attributes
list (using BaseAttribute.get_config_params). Used by genome.
DefaultGenomeConfig to include gene parameters in its configuration parameters.
Returns List of configuration parameters (as config.ConfigParameter in-
stances) for the gene attributes.
Return type list(instance)
Raises DeprecationWarning – If the gene class uses
__gene_attributes__ instead of _gene_attributes
init_attributes(config)
Initializes its gene attributes using the supplied configuration object and FloatAttribute.
init_value, BoolAttribute.init_value, or StringAttribute.
init_value as appropriate.
Parameters config (instance) – Configuration object to be used by the appropriate
attributes class.
mutate(config)
Mutates (possibly) its gene attributes using the supplied configuration object
and FloatAttribute.init_value, BoolAttribute.init_value, or
8.8. genes 49
NEAT-Python Documentation, Release 0.92
StringAttribute.init_value as appropriate.
Parameters config (instance) – Configuration object to be used by the appropriate
attributes class.
copy()
Makes a copy of itself, including its subclass, key, and all gene attributes.
Returns A copied gene
Return type instance
crossover(gene2)
Creates a new gene via crossover - randomly inheriting attributes from its parents. The two
genes must be homologous, having the same key/id.
Parameters gene2 (instance) – The other gene.
Returns A new gene, with the same key/id, with other attributes being copied ran-
domly (50/50 chance) from each parent gene.
Return type instance
class genes.DefaultNodeGene(BaseGene)
Groups attributes specific to node genes - such as bias - and calculates genetic distances be-
tween two homologous (not disjoint or excess) node genes.
distance(other, config)
Determines the degree of differences between node genes using their 4 attributes; the final result
is multiplied by the configured compatibility_weight_coefficient.
Parameters
• other (instance) – The other DefaultNodeGene.
• config (instance) – The genome configuration object.
Returns The contribution of this pair to the genomic distance between the source
genomes.
Return type float
class genes.DefaultConnectionGene(BaseGene)
Groups attributes specific to connection genes - such as weight - and calculates genetic dis-
tances between two homologous (not disjoint or excess) connection genes.
distance(other, config)
Determines the degree of differences between connection genes using their 2 attributes; the
final result is multiplied by the configured compatibility_weight_coefficient.
Parameters
• other (instance) – The other DefaultConnectionGene.
• config (instance) – The genome configuration object.
Returns The contribution of this pair to the genomic distance between the source
genomes.
Return type float
Changed in version 0.92: __gene_attributes__ changed to _gene_attributes, since
it is not a Python internal variable. Updates also made due to addition of default capabilities to
attributes.
8.9 genome
neat.genome.DefaultGenome iznn.IZGenome
genome.DefaultGenomeConfig
genome.DefaultGenome
class genome.DefaultGenomeConfig(params)
Does the configuration for the DefaultGenome class. Has the list allowed_connectivity,
which defines the available values for initial_connection. Includes parameters taken
from the configured gene classes, such as genes.DefaultNodeGene, genes.
DefaultConnectionGene, or iznn.IZNodeGene. The activations.
ActivationFunctionSet instance is available via its activation_defs attribute,
and the aggregations.AggregationFunctionSet instance is available via its
aggregation_defs - or, for compatibility, aggregation_function_defs - attributes.
TODO: Check for unused configuration parameters from the config file.
Parameters params (dict(str, str)) – Parameters from configuration file and
DefaultGenome initialization (by parse_config).
Raises RuntimeError – If initial_connection or structural_mutation_surer is
invalid.
Changed in version 0.92: Aggregation functions moved to aggregations; additional configura-
tion parameters added.
add_activation(name, func)
Adds a new activation function, as described in Customizing Behavior. Uses
ActivationFunctionSet.add.
Parameters
• name (str) – The name by which the function is to be known in the configuration
file.
• func (function) – A function meeting the requirements of activations.
validate_activation().
add_aggregation(name, func)
Adds a new aggregation function. Uses AggregationFunctionSet.add.
Parameters
• name (str) – The name by which the function is to be known in the configuration
file.
• func (function) – A function meeting the requirements of aggregations.
validate_aggregation().
New in version 0.92.
save(f )
Saves the initial_connection configuration and uses config.write_pretty_params()
to write out the other parameters.
Parameters f (file) – The file object to be written to.
8.9. genome 51
NEAT-Python Documentation, Release 0.92
Required interface method. Configures a new genome (itself) by crossover from two par-
ent genomes. disjoint or excess genes are inherited from the fitter of the two parents,
while homologous genes use the gene class’ crossover function (e.g., genes.BaseGene.
crossover()).
Parameters
• genome1 (instance) – The first parent genome.
• genome2 (instance) – The second parent genome.
• config (instance) – Genome configuration object; currently ignored.
mutate(config)
Required interface method. Mutates this genome. What mutations take place are determined
by configuration file settings, such as node_add_prob and node_delete_prob for the like-
lihood of adding or removing a node and conn_add_prob and conn_delete_prob for the
likelihood of adding or removing a connection. Checks single_structural_mutation for whether
more than one structural mutation should be permitted per call. Non-structural mutations (to
gene attributes) are performed by calling the appropriate mutate method(s) for connection
and node genes (generally genes.BaseGene.mutate()).
Parameters config (instance) – Genome configuration object.
Changed in version 0.92: single_structural_mutation config parameter added.
mutate_add_node(config)
Takes a randomly-selected existing connection, turns its enabled attribute to False, and
makes two new (enabled) connections with a new node between them, which join the now-
disabled connection’s nodes. The connection weights are chosen so as to potentially have
roughly the same behavior as the original connection, although this will depend on the acti-
vation function, bias, and response multiplier of the new node. If there are no connections
available, may call mutate_add_connection() instead, depending on the result from
check_structural_mutation_surer.
Parameters config (instance) – Genome configuration object.
Changed in version 0.92: Potential addition of connection instead added.
add_connection(config, input_key, output_key, weight, enabled)
Adds a specified new connection; its key is the tuple of (input_key, output_key).
TODO: Add further validation of this connection addition?
Parameters
• config (instance) – Genome configuration object.
• input_key (int) – Key of the connection’s input-side node.
• output_key (int) – Key of the connection’s output-side node.
• weight (float) – The weight the new connection should have.
• enabled (bool) – The enabled attribute the new connection should have.
mutate_add_connection(config)
Attempts to add a randomly-selected new connection, with some filtering: 1. input
nodes cannot be at the output end. 2. Existing connections cannot be duplicated.
(If an existing connection is selected, it may be enabled depending on the result from
check_structural_mutation_surer.) 3. Two output nodes cannot be connected to-
gether. 4. If feed_forward is set to True in the configuration file, connections cannot create
cycles.
Parameters config (instance) – Genome configuration object
Changed in version 0.92: Output nodes not allowed to be connected together. Possibility of
enabling existing connection added.
mutate_delete_node(config)
Deletes a randomly-chosen (non-output/input) node along with its connections.
Parameters config (instance) – Genome configuration object
mutate_delete_connection()
8.9. genome 53
NEAT-Python Documentation, Release 0.92
connect_fs_neat_hidden(config)
Connect one randomly-chosen input to all hidden nodes and output nodes (FS-NEAT with
connections to hidden nodes, if any). Implements the fs_neat_hidden setting for ini-
tial_connection.
Parameters config (instance) – The genome configuration object.
Changed in version 0.92: Connect_fs_neat, connect_full, connect_partial split up - documenta-
tion vs program conflict.
compute_full_connections(config, direct)
Compute connections for a fully-connected feed-forward genome–each input connected to all
hidden nodes (and output nodes if direct is set or there are no hidden nodes), each hid-
den node connected to all output nodes. (Recurrent genomes will also include node self-
connections.)
Parameters
• config (instance) – The genome configuration object.
• direct (bool) – Whether or not, if there are hidden nodes, to include links
directly from input to output.
Returns The list of connections, as (input key, output key) tuples
Return type list(tuple(int,int))
Changed in version 0.92: “Direct” added to help with documentation vs program conflict for
initial_connection of full or partial.
connect_full_nodirect(config)
Create a fully-connected genome (except no direct input to output connections unless there are
no hidden nodes).
Parameters config (instance) – The genome configuration object.
Changed in version 0.92: Connect_fs_neat, connect_full, connect_partial split up - documenta-
tion vs program conflict.
connect_full_direct(config)
Create a fully-connected genome, including direct input-output connections even if there are
hidden nodes.
Parameters config (instance) – The genome configuration object.
Changed in version 0.92: Connect_fs_neat, connect_full, connect_partial split up - documenta-
tion vs program conflict.
connect_partial_nodirect(config)
Create a partially-connected genome, with (unless there are no hidden nodes) no direct input-
output connections.
Parameters config (instance) – The genome configuration object.
Changed in version 0.92: Connect_fs_neat, connect_full, connect_partial split up - documenta-
tion vs program conflict.
connect_partial_direct(config)
Create a partially-connected genome, possibly including direct input-output connections even
if there are hidden nodes.
Parameters config (instance) – The genome configuration object.
Changed in version 0.92: Connect_fs_neat, connect_full, connect_partial split up - documenta-
tion vs program conflict.
8.10 graphs
8.10. graphs 55
NEAT-Python Documentation, Release 0.92
Returns true if the addition of the test connection would create a cycle, assuming that no cycle
already exists in the graph represented by connections. Used to avoid recurrent networks when
a purely feed-forward network is desired (e.g., as determined by the feed_forward setting in the
configuration file.
Parameters
• connections (list(tuple(int, int))) – The current network, as a list
of (input, output) connection identifiers.
• test (tuple(int, int)) – Possible connection to be checked for causing a
cycle.
Returns True if a cycle would be created; false if not.
Return type bool
graphs.required_for_output(inputs, outputs, connections)
Collect the nodes whose state is required to compute the final network output(s).
Parameters
• inputs (list(int)) – the input node identifiers; it is assumed that the input
identifier set and the node identifier set are disjoint.
• outputs (list(int)) – the output node identifiers; by convention, the output
node ids are always the same as the output index.
• connections (list(tuple(int, int))) – list of (input, output) connec-
tions in the network; should only include enabled ones.
Returns A set of node identifiers.
Return type set(int)
graphs.feed_forward_layers(inputs, outputs, connections)
Collect the layers whose members can be evaluated in parallel in a feed-forward network.
Parameters
• inputs (list(int)) – the network input node identifiers.
• outputs (list(int)) – the output node identifiers.
• connections (list(tuple(int, int))) – list of (input, output) connec-
tions in the network; should only include enabled ones.
Returns A list of layers, with each layer consisting of a set of identifiers; only includes
nodes returned by required_for_output.
Return type list(set(int))
8.11 iznn
This module implements a spiking neural network. Neurons are based on the model described by:
Izhikevich, E. M.
Simple Model of Spiking Neurons
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 14, NO. 6, NOVEMBER 2003
See http://www.izhikevich.org/publications/spikes.pdf.
neat.genes.BaseGene iznn.IZNodeGene
iznn.IZNeuron
iznn.IZNN
neat.genome.DefaultGenome iznn.IZGenome
iznn.REGULAR_SPIKING_PARAMS
iznn.INTRINSICALLY_BURSTING_PARAMS
iznn.CHATTERING_PARAMS
iznn.FAST_SPIKING_PARAMS
iznn.THALAMO_CORTICAL_PARAMS
iznn.RESONATOR_PARAMS
iznn.LOW_THRESHOLD_SPIKING_PARAMS
Parameter sets (for a, b, c, and d, described below) producing known types of spiking behaviors.
class iznn.IZNodeGene(BaseGene)
Contains attributes for the iznn node genes and determines genomic distances. TODO: Genomic
distance currently does not take into account the node’s bias.
distance(other, config)
Determines the genomic distance between this node gene and the other node gene.
Parameters
• other (instance) – The other IZNodeGene instance.
• config (instance) – Configuration object, in this case a genome.
DefaultGenomeConfig instance.
class iznn.IZGenome(DefaultGenome)
Contains the parse_config class method for iznn genome configuration, which returns a genome.
DefaultGenomeConfig instance.
class iznn.IZNeuron(bias, a, b, c, d, inputs)
Sets up and simulates the iznn nodes (neurons).
Parameters
• bias (float) – The bias of the neuron.
• a (float) – The time scale of the recovery variable.
• b (float) – The sensitivity of the recovery variable.
• c (float) – The after-spike reset value of the membrane potential.
• d (float) – The after-spike reset of the recovery variable.
8.11. iznn 57
NEAT-Python Documentation, Release 0.92
8.12 math_util
Contains some mathematical/statistical functions not found in the Python2 standard library, plus a mechanism for
looking up some commonly used functions (such as for the species_fitness_func) by name.
math_util.stat_functions
Lookup table for commonly used {value} -> value functions, namely max, min,
mean, median, and median2. The species_fitness_func (used for stagnation.
DefaultStagnation) is required to be one of these.
Changed in version 0.92: median2 added.
math_util.mean(values)
Returns the arithmetic mean.
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to take the mean of.
Returns The arithmetic mean.
Return type float
math_util.median(values)
Returns the median for odd numbers of values; returns the higher of the middle two values for even
numbers of values.
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to take the median of.
Returns The median.
Return type float
math_util.median2(values)
Returns the median for odd numbers of values; returns the mean of the middle two values for even
numbers of values.
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to take the median of.
Returns The median.
Return type float
New in version 0.92.
math_util.variance(values)
Returns the (population) variance.
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to get the variance of.
Returns The variance.
Return type float
math_util.stdev(values)
Returns the (population) standard deviation. Note spelling.
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to get the standard deviation of.
Returns The standard deviation.
Return type float
8.12. math_util 59
NEAT-Python Documentation, Release 0.92
math_util.softmax(values)
Compute the softmax (a differentiable/smooth approximization of the maximum function) of the
given value set. (See the Wikipedia entry for more on softmax. Envisioned as useful for postpro-
cessing of network output.)
Parameters values (list(float) or set(float) or tuple(float)) –
Numbers to get the softmax of.
∑︀
Returns 𝑣𝑖 = exp(𝑣𝑖 )/𝑠, where 𝑠 = (exp(𝑣0 ), exp(𝑣1 ), . . . )(8.1)
Return type list(float)
Changed in version 0.92: Previously not functional on Python 3.X due to changes to map.
8.13 nn.feed_forward
8.14 nn.recurrent
reset()
Resets all node activations to 0 (necessary due to otherwise retaining state via recurrent con-
nections).
activate(inputs)
Feeds the inputs into the network and returns the resulting outputs.
Parameters inputs (list(float)) – The values for the input nodes.
Returns The values for the output nodes.
Return type list(float)
Raises RuntimeError – If the number of inputs is not the same as the number of
input nodes.
static create(genome, config)
Receives a genome and returns its phenotype.
Parameters
• genome (instance) – Genome to return phenotype for.
• config (instance) – Configuration object.
Returns A RecurrentNetwork instance.
Return type instance
8.15 parallel
Runs evaluation functions in parallel subprocesses in order to evaluate multiple genomes at once.
class parallel.ParallelEvaluator(num_workers, eval_function, timeout=None)
Runs evaluation functions in parallel subprocesses in order to evaluate multiple genomes at once.
The analogous threaded is probably preferable for python implementations without a GIL
(Global Interpreter Lock); note that neat-python is not currently tested vs any such implementa-
tions.
Parameters
• num_workers (int) – How many workers to have in the Pool.
• eval_function (function) – The eval_function should take one argument
- a tuple of (genome object, config object) - and return a single float (the
genome’s fitness) Note that this is not the same as how a fitness function is called by
Population.run, nor by ThreadedEvaluator (although it is more similar
to the latter).
• timeout (int or None) – How long (in seconds) each subprocess will be given
before an exception is raised (unlimited if None).
__del__()
Takes care of removing the subprocesses.
evaluate(genomes, config)
Distributes the evaluation jobs among the subprocesses, then assigns each fitness back to the
appropriate genome.
Parameters
• genomes (list(tuple(int, instance))) – A list of tuples of genome_id (not used),
genome.
• config (instance) – A config.Config instance.
8.15. parallel 61
NEAT-Python Documentation, Release 0.92
8.16 population
8.17 reporting
Makes possible reporter classes, which are triggered on particular events and may provide information to the user, may
do something else such as checkpointing, or may do both.
reporting.ReporterSet
reporting.BaseReporter reporting.StdOutReporter
checkpoint.Checkpointer
neat.reporting.BaseReporter
statistics.StatisticsReporter
class reporting.ReporterSet
Keeps track of the set of reporters and gives methods to dispatch them at appropriate points.
add(reporter)
Adds a reporter to those to be called via ReporterSet methods.
Parameters reporter (instance) – A reporter instance.
remove(reporter)
Removes a reporter from those to be called via ReporterSet methods.
Parameters reporter (instance) – A reporter instance.
start_generation(gen)
Calls start_generation on each reporter in the set.
Parameters gen (int) – The generation number.
end_generation(config, population, species)
Calls end_generation on each reporter in the set.
Parameters
• config (instance) – Config configuration instance.
• population (dict(int, instance)) – Current population, as a dict of unique
genome ID/key vs genome.
• species (instance) – Current species set object, such as a
DefaultSpeciesSet instance.
post_evaluate(config, population, species)
Calls post_evaluate on each reporter in the set.
Parameters
• config (instance) – Config configuration instance.
• population (dict(int, instance)) – Current population, as a dict of unique
genome ID/key vs genome.
• species (instance) – Current species set object, such as a
DefaultSpeciesSet instance.
• best_genome (instance) – The currently highest-fitness genome. (Ties are re-
solved pseudorandomly, by dictionary ordering.)
post_reproduction(config, population, species)
Not currently called. Would call post_reproduction on each reporter in the set.
complete_extinction()
8.17. reporting 63
NEAT-Python Documentation, Release 0.92
8.18 reproduction
Handles creation of genomes, either from scratch or by sexual or asexual reproduction from parents. For class re-
quirements, see Reproduction Interface. Implements the default NEAT-python reproduction scheme: explicit fitness
sharing with fixed-time species stagnation.
class reproduction.DefaultReproduction(config, reporters, stagnation)
Implements the default NEAT-python reproduction scheme: explicit fitness sharing with fixed-time
species stagnation. Inherits from config.DefaultClassConfig the required class method
write_config. TODO: Provide some sort of optional cross-species performance criteria, which
are then used to control stagnation and possibly the mutation rate configuration. This scheme should
be adaptive so that species do not evolve to become “cautious” and only make very slow progress.
Parameters
• config (instance) – Configuration object, in this implementation a config.
DefaultClassConfig instance.
• reporters (instance) – A ReporterSet instance.
• stagnation (instance) – A DefaultStagnation instance - the current code
partially depends on internals of this class (a TODO is noted to correct this).
8.18. reproduction 65
NEAT-Python Documentation, Release 0.92
• pop_size (int) – Population size desired, such as set in the configuration file.
• generation (int) – Generation count.
Returns New population, as a dict of unique genome ID/key vs genome.
Return type dict(int, instance)
Changed in version 0.92: Previously, the minimum and maximum relative fitnesses were deter-
mined (contrary to the comments in the code) including members of species being removed due
to stagnation; it is now determined using only the non-stagnant species. The minimum size of
species was (and is) the greater of the min_species_size and elitism configuration parameters;
previously, this was not taken into account for compute_spawn(); this made it more likely
to have a population size above the configured population size.
8.19 six_util
This Python 2/3 portability code was copied from the six module to avoid adding it as a dependency.
six_util.iterkeys(d, **kw)
This function returns an iterator over the keys of dict d.
Parameters
• d (dict) – Dictionary to iterate over
• kw – The function of this parameter is unclear.
six_util.iteritems(d, **kw)
This function returns an iterator over the (key, value) pairs of dict d.
Parameters
• d (dict) – Dictionary to iterate over
• kw – The function of this parameter is unclear.
six_util.itervalues(d, **kw)
This function returns an iterator over the values of dict d.
Parameters
• d (dict) – Dictionary to iterate over
• kw – The function of this parameter is unclear.
8.20 species
8.19. six_util 67
NEAT-Python Documentation, Release 0.92
Parameters
• representative (instance) – A genome instance.
• members (dict(int, instance)) – A dictionary of genome id vs genome in-
stance.
get_fitnesses()
Required interface method (used by stagnation.DefaultStagnation, for instance).
Retrieves the fitnesses of each member genome.
Returns List of fitnesses of member genomes.
Return type list(float)
class species.GenomeDistanceCache(config)
Caches (indexing by genome key/id) genomic distance information to avoid repeated lookups. (The
distance function, memoized by this class, is among the most time-consuming parts of the
library, although many fitness functions are likely to far outweigh this for moderate-size popula-
tions.)
Parameters config (instance) – A genome configuration instance; later used by the
genome distance function.
__call__(genome0, genome1)
GenomeDistanceCache is called as a method with a pair of genomes to retrieve the distance.
Parameters
• genome0 (instance) – The first genome instance.
• genome1 (instance) – The second genome instance.
Returns The genomic distance.
Return type float
class species.DefaultSpeciesSet(config, reporters)
Encapsulates the default speciation scheme by configuring it and performing the speci-
ation function (placing genomes into species by genetic similarity). reproduction.
DefaultReproduction currently depends on this having a species attribute consisting of
a dictionary of species keys to species. Inherits from config.DefaultClassConfig the re-
quired class method write_config.
Parameters
• config (instance) – A configuration object, in this implementation a config.
Config instance.
• reporters (instance) – A ReporterSet instance giving reporters to be notified
about genomic distance statistics.
Changed in version 0.92: Configuration changed to use DefaultClassConfig, instead of a dictionary,
and inherit write_config.
classmethod parse_config(param_dict)
Required interface method. Currently, the only configuration parameter is the compatibil-
ity_threshold; this method provides a default for it and updates it from the configuration file, in
this implementation using config.DefaultClassConfig.
Parameters param_dict (dict(str, str)) – Dictionary of parameters from
configuration file.
Returns SpeciesSet configuration object; considered opaque by rest of code, so cur-
rent type returned is not required for interface.
Return type DefaultClassConfig instance
Changed in version 0.92: Configuration changed to use DefaultClassConfig instead of a dictio-
nary.
speciate(config, population, generation)
Required interface method. Place genomes into species by genetic similarity (genomic dis-
tance). TODO: The current code has a docstring stating that there may be a problem if
all old species representatives are not dropped for each generation; it is not clear how this is
consistent with the code in reproduction.DefaultReproduction.reproduce(),
such as for elitism. TODO: Check if sorting the unspeciated genomes by fitness will improve
speciation (by making the highest-fitness member of a species its representative).
Parameters
• config (instance) – Config instance.
• population (dict(int, instance)) – Population as per the output of
DefaultReproduction.reproduce.
• generation (int) – Current generation number.
get_species_id(individual_id)
Required interface method (used by reporting.StdOutReporter). Retrieves species
id/key for a given genome id/key.
Parameters individual_id (int) – Genome id/key.
Returns Species id/key.
Return type int
get_species(individual_id)
Retrieves species object for a given genome id/key. May become a required interface method,
and useful for some fitness functions already.
Parameters individual_id (int) – Genome id/key.
Returns Species containing the genome corresponding to the id/key.
Return type instance
8.21 stagnation
Keeps track of whether species are making progress and helps remove ones that are not.
Note: TODO: Currently, depending on the settings for species_fitness_func and fitness_criterion, it is
possible for a species with members above the fitness_threshold level of fitness to be considered “stag-
nant” (including, most problematically, because they are at the limit of fitness improvement).
8.21. stagnation 69
NEAT-Python Documentation, Release 0.92
8.22 statistics
class statistics.StatisticsReporter(BaseReporter)
Gathers (via the reporting interface) and provides (to callers and/or to a file) the most-fit genomes
and information on genome and species fitness and species sizes.
post_evaluate(config, population, species, best_genome)
Called as part of the reporting.BaseReporter interface after the evaluation at the start
8.22. statistics 71
NEAT-Python Documentation, Release 0.92
8.23 threaded
Runs evaluation functions in parallel threads (using the python library module threading) in order to evaluate multiple
genomes at once. Probably preferable to parallel for python implementations without a GIL (Global Interpreter
Lock); note, however, that neat-python is not currently tested on any such implementation.
8.23. threaded 73
NEAT-Python Documentation, Release 0.92
Genome Interface
This is an outline of the minimal interface that is expected to be present on genome objects; example genome objects
can be seen in DefaultGenome and iznn.IZGenome.
9.2 Initialization/Reproduction
__init__(self, key)
Takes a unique genome instance identifier. The initializer should create the following members:
• key
• connections - (gene_key, gene) pairs for the connection gene set.
• nodes - (gene_key, gene) pairs for the node gene set.
• fitness
configure_new(self, config)
Configure the genome as a new random genome based on the given configuration from the top-level
Config object.
75
NEAT-Python Documentation, Release 0.92
9.3 Crossover/Mutation
configure_crossover(self, genome1, genome2, config)
Configure the genome as a child of the given parent genomes.
mutate(self, config)
Apply mutation operations to the genome, using the given configuration.
9.4 Speciation/Misc
distance(self, other, config)
Returns the genomic distance between this genome and the other. This distance value is used to compute
genome compatibility for speciation.
size(self)
Returns a measure of genome complexity. This object is currently only given to reporters at the end of
a generation to indicate the complexity of the highest-fitness genome. In the DefaultGenome class, this
method currently returns (number of nodes, number of enabled connections).
Reproduction Interface
This is an outline of the minimal interface that is expected to be present on reproduction objects. Each Population
instance will create exactly one instance of the reproduction class in Population.__init__ regardless of the configuration
or arguments provided to Population.__init__.
parse_config(cls, param_dict) - Takes a dictionary of configuration items, returns an object that will later be passed to
the write_config method. This configuration object is considered to be opaque by the rest of the library.
write_config(cls, f, config) - Takes a file-like object and the configuration object created by parse_config. This method
should write the configuration item definitions to the given file.
10.2 Initialization
__init__(self, config, reporters, stagnation) - Takes the top-level Config object, a ReporterSet instance, and a stagnation
object instance.
create_new(self, genome_type, genome_config, num_genomes): - Create num_genomes new genomes of the given
type using the given configuration.
reproduce(self, config, species, pop_size, generation): - Creates the population to be used in the next generation from
the given configuration instance, SpeciesSet instance, desired size of the population, and current generation number.
This method is called after all genomes have been evaluated and their fitness member assigned. This method should
use the stagnation instance given to the initializer to remove species it deems to have stagnated.
77
NEAT-Python Documentation, Release 0.92
Glossary
activation function
aggregation function
bias
response These are the attributes of a node. They determine the output of a node as follows: activation(𝑏𝑖𝑎𝑠+(𝑟𝑒𝑠𝑝𝑜𝑛𝑠𝑒*
aggregation(𝑖𝑛𝑝𝑢𝑡𝑠)))(11.1) For available activation functions, see Overview of builtin activation functions; for
adding new ones, see Customizing Behavior. For the available aggregation functions, see the aggregations
module.
These are the properties of a node (such as its activation function) or connection (such as whether it is enabled or not)
determined by its associated gene (in the default implementation, in the attributes module in combination with
the gene class).
Using the distributed module, genomes can be evaluated on multiple machines (including virtual machines) at
once. Each such machine/host is called a compute node. These are of two types, primary nodes and secondary
nodes.
These connect between nodes, and give rise to the network in the term neural network. For non-loopback
(directly recurrent) connections, they are equivalent to biological synapses. Connections have two attributes, their
weight and whether or not they are enabled; both are determined by their gene. An example gene class for connections
can be seen in genes.DefaultConnectionGene.
A discrete-time neural network (which should be assumed unless specified otherwise) proceeds in time steps, with
processing at one node followed by going through connections to other nodes followed by processing at those other
nodes, eventually giving the output. A continuous-time neural network, such as the ctrnn (continuous-time recurrent
neural network) implemented in NEAT-Python, simulates a continuous process via differential equations (or other
methods).
The process in sexual reproduction in which two genomes are combined. This involves the combination of homologous
genes and the copying (from the highest-fitness genome) of disjoint/excess genes. Along with mutation, one of the
two sources of innovation in (classical) evolution.
79
NEAT-Python Documentation, Release 0.92
These are genes in NEAT not descended from a common ancestor - i.e., not homologous. This implementation of
NEAT, like most, does not distinguish between disjoint and excess genes. For further discussion, see the NEAT
Overview.
A neural network that is not recurrent is feedforward - it has no loops. (Note that this means that it has no memory -
no ability to take into account past events.) It can thus be described as a DAG (Directed Acyclic Graph).
The information coding (in the current implementation) for a particular aspect (node or connection) of a neural net-
work phenotype. Contains several attributes, varying depending on the type of gene. Example gene classes include
genes.DefaultNodeGene, genes.DefaultConnectionGene, and iznn.IZNodeGene; all of these are
subclasses of genes.BaseGene.
This implementation of NEAT uses, like most, multiple semi-separated generations (some genomes may survive mul-
tiple generations via elitism). In terms of generations, the steps are as follows: generate the next generation from
the current population; partition the new generation into species based on genetic similarity; evaluate fitness of all
genomes; check if a/the termination criterion is satisfied; if not, repeat. (The ordering in the population module is
somewhat different.) Generations are numbered, and a limit on the number of generations is one type of termination
criterion.
The distance between two homologous genes, added up as part of the genomic distance. Also sometimes used as a
synonym for genomic distance.
The set of genes that together code for a (neural network) phenotype. Example genome objects can be seen in
genome.DefaultGenome and iznn.IZGenome, and the object interface is described in Genome Interface.
An approximate measure of the difference between genomes, used in dividing the population into species. For further
discussion, see the NEAT Overview.
These are the nodes other than input nodes and output nodes. In the original NEAT (NeuroEvolution of Augment-
ing Topologies) algorithm, networks start with no hidden nodes, and evolve more complexity as necessary - thus
“Augmenting Topologies”.
Descended from a common ancestor; two genes in NEAT from different genomes are either homologous or dis-
joint/excess. In NEAT, two genes that are homologous will have the same key/id. For node genes, the key is an int
incremented with each newly-created node; for connection genes, the key is a tuple of the keys of the nodes being
connected. For further discussion, see the NEAT Overview.
Various of the objects used by the library are indexed by an key (id); for most, this is an int, which is either unique in
the library as a whole (as with species and genomes), or within a genome (as with node genes). For connection genes,
this is a tuple of two ints, the keys of the connected nodes. For input nodes (or input pins), it is the input’s (list or
tuple) index plus one, then multiplied by negative one; for output nodes, it is equal to the output’s (list or tuple) index.
These are the nodes through which the network receives inputs. They cannot be deleted (although connections from
them can be), cannot be the output end of a connection, and have: no aggregation function; a fixed bias of 0; a fixed
response multiplier of 1; and a fixed activation function of identity. Note: In the genome module, they are not in
many respects treated as actual nodes, but simply as keys for input ends of connections. Sometimes known as an input
pin.
The process in which the attributes of a gene (or the genes in a genome) are (randomly, with likelihoods determined by
configuration parameters) altered. Along with crossover, one of the two sources of innovation in (classical) evolution.
Also known as a neuron (as in a neural network). They are of three types: input, hidden, and output. Nodes have
one or more attributes, such as an activation function; all are determined by their gene. Classes of node genes include
genes.DefaultNodeGene and iznn.IZNodeGene. (They should not be confused with compute nodes, host
machines on which distributed evaluations of genomes are performed.)
These are the nodes to which the network delivers outputs. They cannot be deleted (although connections to them can
be) but can otherwise be mutated normally. The output of this node is connected to the corresponding output pin with
an implicit weight-1, enabled connection.
Point at which the network is effectively connected to the external world. Pins are either input (aka input nodes) or
output (connected to an output node with the same key as the output pin).
If using the distributed module, you will need one primary compute node and at least one secondary node. The
primary node creates and mutates genomes, then distributes them to the secondary nodes for evaluation. (It does not
do any evaluations itself; thus, at least one secondary node is required.)
A recurrent neural network has cycles in its topography. These may be a node having a connection back to itself, with
(for a discrete-time neural network) the prior time period’s output being provided to the node as one of its inputs. They
may also have longer cycles, such as with output from node A going into node B (via a connection) and an output
from node B going (via another connection) into node A. (This gives it a possibly-useful memory - an ability to take
into account past events - unlike a feedforward neural network; however, it also makes it harder to work with in some
respects.)
If using the distributed module, you will need at least one secondary compute node, as well as a primary node.
The secondary nodes evaluate genomes, distributed to them by the primary node.
Subdivisions of the population into groups of similar (by the genomic distance measure) individuals (genomes), which
compete among themselves but share fitness relative to the rest of the population. This is, among other things, a
mechanism to try to avoid the quick elimination of high-potential topological mutants that have an initial poor fitness
prior to smaller “tuning” changes. For further discussion, see the NEAT Overview.
These are the attributes of a connection. If a connection is enabled, then the input to it (from a node) is multiplied by
the weight then sent to the output (to a node - possibly the same node, for a recurrent neural network). If a connection
is not enabled, then the output is 0; genes for such connections are the equivalent of pseudogenes that, as in in vivo
evolution, can be reactivated at a later time. TODO: Some versions of NEAT give a chance, such as 25%, that a
disabled connection will be enabled during crossover; in the future, this should be an option.
Table of Contents
81
NEAT-Python Documentation, Release 0.92
• genindex
• modindex
• search
83
NEAT-Python Documentation, Release 0.92
a stagnation, 69
activations, 33 statistics, 70
aggregations, 34
attributes, 36 t
threaded, 72
c
checkpoint, 39
config, 40
ctrnn, 42
d
distributed, 43
g
genes, 48
genome, 50
graphs, 55
i
iznn, 56
m
math_util, 58
n
nn.feed_forward, 60
nn.recurrent, 60
p
parallel, 61
population, 61
r
reporting, 62
reproduction, 65
s
six_util, 67
species, 67
85
NEAT-Python Documentation, Release 0.92
87
NEAT-Python Documentation, Release 0.92
88 Index
NEAT-Python Documentation, Release 0.92
Index 89
NEAT-Python Documentation, Release 0.92
90 Index
NEAT-Python Documentation, Release 0.92
T
THALAMO_CORTICAL_PARAMS (in module iznn),
57
threaded (module), 72
ThreadedEvaluator (class in threaded), 73
U
UnknownConfigItemError, 41
update() (species.Species method), 67
update() (stagnation.DefaultStagnation method), 70
V
validate_activation() (in module activations), 33
validate_aggregation() (in module aggregations), 35
variance() (in module math_util), 59
W
weight, 11
write_config() (config.DefaultClassConfig class method),
41
write_config() (genome.DefaultGenome class method),
52
write_pretty_params() (in module config), 41
X
X_default, 8–10, 38
X_options, 9, 38, 38
Index 91