ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

NEAT: Nevroevolusjon av forbedrende topologier×Nevral arkitektursøk×
FagfeltDyp læringDyp læring
FamilieMachine learningMachine learning
Opprinnelsesår20022017
OpphavspersonKenneth Stanley & Risto MiikkulainenZoph, B. & Le, Q.V.
TypeNeuroevolutionary algorithmAutomated architecture optimization (deep learning)
Opprinnelig kildeStanley, K. O., & Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2), 99–127. DOI ↗Zoph, B. & Le, Q.V. (2017). Neural Architecture Search with Reinforcement Learning. ICLR. link ↗
AliasNeuroevolution of Augmenting Topologies, Topology and Weight Evolving Artificial Neural Networks (variant), Evolving Neural Networks, Topoloji Artırımlı NöroevrimNöral Mimari Arama (NAS), NAS, automated architecture design, differentiable architecture search
Relaterte35
SammendragNEAT 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.Neural Architecture Search (NAS), introduced by Zoph and Le in 2017, automatically optimizes architectural decisions such as a network's depth, width, and connection structure instead of hand-designing them. Leading methods in the field include DARTS, ENAS, and Once-for-All.
ScholarGateDatasett
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: NEAT · Neural Architecture Search. Hentet 2026-06-19 fra https://scholargate.app/no/compare