Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Evolutionary Strategy (CMA-ES)× | Genetisk algoritm× | |
|---|---|---|
| Ämnesområde | Optimering | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 2001 | 1975 |
| Upphovsperson≠ | Nikolaus Hansen & Andreas Ostermeier | John Henry Holland |
| Typ≠ | Derivative-free continuous black-box optimizer | Population-based metaheuristic |
| Ursprungskälla≠ | Hansen, N. & Ostermeier, A. (2001). Completely Derandomized Self-Adaptation in Evolutionary Strategies. Evolutionary Computation, 9(2), 159-195. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| Alias≠ | CMA-ES, Evolution Strategy, Evrimsel Strateji (CMA-ES), self-adapting evolution strategy | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|