ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

NEAT×Automatsko pretraživanje arhitektura dubokih mreža×
PodručjeDuboko učenjeDuboko učenje
ObiteljMachine learningMachine learning
Godina nastanka20022017
TvoracKenneth Stanley & Risto MiikkulainenZoph, B. & Le, Q.V.
VrstaNeuroevolutionary algorithmAutomated architecture optimization (deep learning)
Temeljni izvorStanley, 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 ↗
Drugi naziviNeuroevolution 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
Srodne35
SažetakNEAT 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.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: NEAT · Neural Architecture Search. Preuzeto 2026-06-19 s https://scholargate.app/hr/compare