NEAT Algorithm
NeuroEvolution of Augmenting Topologies (NEAT), an algorithm proposed by Kenneth Stanley and Risto Miikkulainen in 2002 that evolves both the weights and the topology of neural networks. It introduces historical markings to resolve the competing conventions problem and is widely applied in autonomous driving simulation and game AI.
Timeline (last 90 days)
NEAT introduced a historical markings mechanism that allows the algorithm to track homologous gene segments across different individuals, thereby solving the competing conventions problem.
NEAT starts from extremely simple networks (often with only a direct connection between the input and output layers) and gradually grows more complex structures through two mutation operations: adding nodes and adding connections.
NEAT's speciation mechanism ensures that individuals with significantly different structures have sufficient time to develop before being eliminated, preventing innovative mutations from being pruned too early.
All Facts (3)
NEAT introduced a historical markings mechanism that allows the algorithm to track homologous gene segments across different individuals, thereby solving the competing conventions problem.
50%UnverifiedNEAT starts from extremely simple networks (often with only a direct connection between the input and output layers) and gradually grows more complex structures through two mutation operations: adding nodes and adding connections.
50%UnverifiedNEAT's speciation mechanism ensures that individuals with significantly different structures have sufficient time to develop before being eliminated, preventing innovative mutations from being pruned too early.
50%