To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Natural evolution strategy

From Wikipedia, the free encyclopedia

Natural evolution strategies (NES) are a family of numerical optimization algorithms for black box problems. Similar in spirit to evolution strategies, they iteratively update the (continuous) parameters of a search distribution by following the natural gradient towards higher expected fitness.

YouTube Encyclopedic

  • 1/5
    Views:
    1 975
    1 376 719
    1 254 624
    15 333
    21 626
  • today I tried: Evolution Strategies
  • Natural Selection - Crash Course Biology #14
  • Roman Battle Tactics
  • Evolution part 1, introduction to natural selection
  • Evolutionary game theory | Individuals and Society | MCAT | Khan Academy

Transcription

Method

The general procedure is as follows: the parameterized search distribution is used to produce a batch of search points, and the fitness function is evaluated at each such point. The distribution’s parameters (which include strategy parameters) allow the algorithm to adaptively capture the (local) structure of the fitness function. For example, in the case of a Gaussian distribution, this comprises the mean and the covariance matrix. From the samples, NES estimates a search gradient on the parameters towards higher expected fitness. NES then performs a gradient ascent step along the natural gradient, a second order method which, unlike the plain gradient, renormalizes the update with respect to uncertainty. This step is crucial, since it prevents oscillations, premature convergence, and undesired effects stemming from a given parameterization. The entire process reiterates until a stopping criterion is met.

All members of the NES family operate based on the same principles. They differ in the type of probability distribution and the gradient approximation method used. Different search spaces require different search distributions; for example, in low dimensionality it can be highly beneficial to model the full covariance matrix. In high dimensions, on the other hand, a more scalable alternative is to limit the covariance to the diagonal only. In addition, highly multi-modal search spaces may benefit from more heavy-tailed distributions (such as Cauchy, as opposed to the Gaussian). A last distinction arises between distributions where we can analytically compute the natural gradient, and more general distributions where we need to estimate it from samples.

Search gradients

Let denote the parameters of the search distribution and the fitness function evaluated at . NES then pursues the objective of maximizing the expected fitness under the search distribution

through gradient ascent. The gradient can be rewritten as

that is, the expected value of times the log-derivatives at . In practice, it is possible to use the Monte Carlo approximation based on a finite number of samples

.

Finally, the parameters of the search distribution can be updated iteratively

Natural gradient ascent

Instead of using the plain stochastic gradient for updates, NES follows the natural gradient, which has been shown to possess numerous advantages over the plain (vanilla) gradient, e.g.:

  • the gradient direction is independent of the parameterization of the search distribution
  • the updates magnitudes are automatically adjusted based on uncertainty, in turn speeding convergence on plateaus and ridges.

The NES update is therefore

,

where is the Fisher information matrix. The Fisher matrix can sometimes be computed exactly, otherwise it is estimated from samples, reusing the log-derivatives .

Fitness shaping

NES utilizes rank-based fitness shaping in order to render the algorithm more robust, and invariant under monotonically increasing transformations of the fitness function. For this purpose, the fitness of the population is transformed into a set of utility values . Let denote the ith best individual. Replacing fitness with utility, the gradient estimate becomes

.

The choice of utility function is a free parameter of the algorithm.

Pseudocode

input: 

1  repeat
   
2     for   do                                              // λ is the population size
       
3         draw sample 
       
4         evaluate fitness 
       
5         calculate log-derivatives 
       
6     end
   
7     assign the utilities                                           // based on rank
   
8     estimate the gradient 
   
9     estimate            // or compute it exactly 
   
10    update parameters                         // η is the learning rate

11 until stopping criterion is met

See also

Bibliography

External links

This page was last edited on 13 July 2022, at 18:06
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.