NEAT: NeuroEvolution of Augmenting Topologies
NeuroEvolution of Augmenting Topologies (NEAT) · Also known as: Neuroevolution of Augmenting Topologies, Topology and Weight Evolving Artificial Neural Networks (variant), Evolving Neural Networks, Topoloji Artırımlı Nöroevrim
NEAT is a genetic algorithm for evolving artificial neural networks introduced by Kenneth Stanley and Risto Miikkulainen in 2002. Unlike methods that evolve weights alone, NEAT simultaneously evolves both the topology (structure) and the connection weights of neural networks. It achieves this through a direct genome encoding with historical markings that enable meaningful crossover between networks of different structures, making it applicable to reinforcement learning, game playing, and control tasks without requiring a predefined architecture.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
NEAT is appropriate when the optimal network architecture is unknown in advance and should itself be discovered, particularly in reinforcement learning and sequential decision tasks. It assumes fitness can be evaluated via simulation or interaction with an environment, not via gradient signals. It works best for low-to-medium dimensional input spaces. Alternatives include hand-designed architectures trained with backpropagation when labeled data are plentiful, or neural architecture search (NAS) methods when gradient-based meta-optimization is feasible. Avoid NEAT when the architecture space is well understood or when GPU-parallel gradient descent is far more sample-efficient.
Strengths & limitations
- Simultaneously optimizes both network topology and weights, removing the need to specify architecture by hand.
- Historical markings enable principled crossover between networks of different structures, a problem that defeats naive neuroevolution approaches.
- Speciation protects structural innovation by allowing novel topologies time to mature before competing against established ones.
- Starts from minimal networks and grows complexity only when needed, producing parsimonious solutions.
- Sample efficiency is low compared to gradient-based methods; evaluating fitness typically requires many environment interactions.
- Scalability decreases as the input dimensionality grows, because the number of possible connections increases quadratically with node count.
- Hyperparameters — compatibility threshold, mutation rates, species stagnation limit — require careful tuning and are problem-specific.
- Crossover between highly diverged genomes can produce non-functional offspring even with historical markings, as semantic compatibility is not guaranteed.
Frequently asked
How does NEAT avoid the competing conventions problem in crossover?
NEAT assigns a unique global innovation number to each new structural gene the first time it appears. When crossing two genomes of different topology, genes with matching innovation numbers are aligned and exchanged, while non-matching genes are inherited from the more fit parent. This ensures that structurally homologous sub-networks are always crossed together, preventing the random misalignment that scrambles offspring in naive topology crossover.
Why does NEAT start with minimal networks rather than random ones?
Starting minimal exploits the principle of complexification: simple networks explore a compact subspace quickly, then grow structure only when additional complexity yields fitness gains. This avoids the 'bloat' common in genetic programming where large random individuals dominate early generations. Minimal initialization also makes speciation more tractable, since initial genomes are structurally similar and diverge only as evolution proceeds.
When should I prefer NEAT over a modern neural architecture search method?
NEAT is preferable when task feedback is non-differentiable or available only as a scalar reward from environment interaction, and when the expected optimal network is compact. Modern NAS methods generally require differentiable proxies or massive compute for meta-gradient estimation. NEAT remains competitive on low-dimensional control benchmarks and in settings where gradient information is unavailable, such as black-box simulation or physical hardware rollouts.
Sources
- Stanley, K. O., & Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2), 99–127. DOI: 10.1162/106365602320169811 ↗
How to cite this page
ScholarGate. (2026, June 2). NeuroEvolution of Augmenting Topologies (NEAT). ScholarGate. https://scholargate.app/en/deep-learning/neat
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Evolutionary StrategyOptimization↔ compare
- Genetic AlgorithmOptimization↔ compare
- Neural Architecture SearchDeep learning↔ compare