Comparar métodos

	NEAT: Neuroevolução de Topologias Crescentes	Estratégia Evolutiva (CMA-ES)	Algoritmo Genético
Área	Aprendizado profundo	Otimização	Otimização
Família	Machine learning	Process / pipeline	Process / pipeline
Ano de origem	2002	2001	1975
Autor original	Kenneth Stanley & Risto Miikkulainen	Nikolaus Hansen & Andreas Ostermeier	John Henry Holland
Tipo	Neuroevolutionary algorithm	Derivative-free continuous black-box optimizer	Population-based metaheuristic
Fonte seminal	Stanley, K. O., & Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2), 99–127.	Hansen, N. & Ostermeier, A. (2001). Completely Derandomized Self-Adaptation in Evolutionary Strategies. Evolutionary Computation, 9(2), 159-195.	Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
Outros nomes	Neuroevolution of Augmenting Topologies, Topology and Weight Evolving Artificial Neural Networks (variant), Evolving Neural Networks, Topoloji Artırımlı Nöroevrim	CMA-ES, Evolution Strategy, Evrimsel Strateji (CMA-ES), self-adapting evolution strategy	GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
Relacionados	3	5	5
Resumo	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.	CMA-ES, short for Covariance Matrix Adaptation Evolution Strategy, is a modern derivative-free optimizer for continuous black-box functions introduced by Hansen and Ostermeier in 2001. It maintains a population of candidate solutions drawn from a multivariate normal distribution and iteratively updates the distribution's mean, step size, and full covariance matrix to steer the search toward better regions of the parameter space. It has become the de-facto standard for continuous black-box optimization and is widely used in neural architecture search and reinforcement-learning policy optimization.	A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail.