Lecture 3 Flashcards

1
Q

Why is (standard) crossover not a good idea for real-valued problems?

A

The range of possible values for a single gene is way too large to keep selecting genes from the initialised genotypes. Hence we need to create new gene values based on the genotypes in each generation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Explain how Classic Differential Evolution creates new solutions

A
  1. You start by initialising values within the range for each gene.
  2. In order to generate new values you do the following steps:
  3. You pick a main individual as a base.
  4. Then you randomly select 3 other individuals from the same population.
  5. You perform v = x0 + F(x1 - x2) in order to create a new temporary solution.
  6. Then you can perform uniform crossover between genes of the base individual and the temporary solution.
    ( 7. Now it is selection time )
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

In Classic Differential Evolution, what is the variable ‘Cr’ and how does it operate?

A

The crossover possibility.
The chance that the newly generated solution is picked over the base solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What type (of structures) are the genotype of real valued solutions?

A

Vectors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

In Classic Differential Evolution, does the increase of parameter F mean an increase in diversity?

A

Generally yes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the most affecting parameters in Classic Differential Evolution?

A
  • population size
  • how the individuals are samples.
  • scale factor F
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does topology mean for CPSO?

A

The way that the neighbourhoods are set up; which individual can see which other individual.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does CPSO mean?

A

Classic Particle Swarm Optimalisation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

For what type of problem is the CPSO very efficient?

A

Many local optima

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is one of the biggest problems with CPSO?

A

Due to their parameters, they can either oscilate very heavily, or be too rigid (which both result in more generations and more computation time.)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the three components of CPSO?

A

inertia-, cognitive-, and social component

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Which component(s) of CPSO are influenced by randomness and why?

A

cognitive and social, the randomness is introduced in how heavy these components weight. This leads to more diversity in the next generation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

In CPSO what does the z_{i,g}_ variable mean and in which component is it ?

A

It means the best ever found solution in the current population. it can be found in the social component

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In CPSO, how are new solutions generated?

A

It takes the inertia from its parent, and adds the (weighted) cognitive and social component. Then it adds this new velocity (or inertia) and adds this to the genotype of it’s parent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

How many parents does offspring have in CPSO?

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Which parameters for CPSO have the most influence?

A
  • swarm size
  • neighborhood topology
  • Coefficients (i.e. inertia weight and acceleration constants)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What does convex combinations mean?

A

If you imagine a triangle, then the convex combination lays within the surface of that triange.

Or in case of EA:
A new solution does not ponder outside of the solution space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Does CSPO exist of convex combinations and why so?

A

Yes, the new solution is created from the three components of it’s parent.
These components are weighted between [0,1) and thus stay within the search space of the problem.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What is the problem with CSPO?

A

The algorithm really aims to convolute its population fast. Although** this increases diversity,** this means that it is very likely that the algorithm convolutes on local optima, as the real solution gets out of reach of the search space.

20
Q

How can you tell that variation conciders covariance when looking at the Gaussian plot of that variation?

A

When the gaussian shows an angled eclipse.

21
Q

What does a (standing) ecplise mean in gaussian variation?

A

It represents how much each individual is allowed to vary when sampled with it. : It basically shows the bounds of variation for each gene.

22
Q

In what EA branch/variant is normal distribution varation central?

A

Evolutionary Strategies (ES)

23
Q

What is the similarity and difference between mutation and crossover?

A

They are both forms of variation. Crossover uses multiple ‘parents’ to draw new solutions.
Mutation uses a probability model on a singular parent’s genotype in order to create a new sample.

24
Q

What are the properties of ES genotypes?

A

They do not only contain a solution,
But more importantly it includes parameters that encode its normal distribution (for mutation)

25
Q

What are the three variants in ES?

A
  1. One variance, no covariances
    (𝑥0, 𝑥1, … , 𝑥ℓ−1, 𝜎)
  2. ℓ variances, no covariances
    (𝑥0, 𝑥1, … , 𝑥ℓ−1, 𝜎0, 𝜎1, … , 𝜎ℓ−1)
  3. Full covariance matrix (general ellipsoidal density contours)
    (𝑥0, 𝑥1, … , 𝑥ℓ−1, 𝜎0, 𝜎1, … , 𝜎ℓ−1, 𝛼1, 𝛼2, … , 𝛼ℓ(ℓ−1)/2)
    (note: 𝛼𝑖 are rotation angles)
26
Q

What variant of ES would create elipsoidal mutation distributrions?

A

Variant 2: ℓ variances, no covariances.
(𝑥0, 𝑥1, … , 𝑥ℓ−1, 𝜎0, 𝜎1, … , 𝜎ℓ−1)

27
Q

For the third ES variant, why do we sample angles and not covairances?

A

Because covariance matrix must remain
.positive definite.
So the variance encode the stretching and the rotation ensure the convairance matrix is always ‘proper’: we can sample it.

28
Q

For the third ES variant,
how many rotation angles do we expect in each genotype?

A

ℓ(ℓ−1)/2

Because each genotype has covariance with all genotypes apart from itself, and we dont need double definitions (hence the 2)

29
Q

How do we represent the genotype of an individual in ES?

A

(𝒙, 𝒔), where
* 𝒙 is the vector of encoded problem variables and
* 𝒔 is the decoded vector of (normal) strategy parameters

30
Q

In ES, why do the strategy parameters also need to undergo mutation?

A

This is to better control the search space: It can have a high variance in early generations, but we want low variance in later generations. “meaning mutation”

31
Q

In ES, what does 𝜓(𝒔) represent?

A

It is the encoded
covariance matrix that is generated from the strategy parameters (𝒔). Such that (𝒙, 𝒔) → (𝒙 + ∆𝒙, 𝒔) where
∆𝒙 ~ 𝒩(0, 𝜓 𝒔 )

32
Q

What is self adaption (in ES)?

A

The mechanism to control own mutability.

33
Q

In ES what does selection influence?

A

fitness directly,
distribution quality indirectly

34
Q

The mathematical definition of log-normal multiplicatively mutated variance in ES variant 1.

A

𝜎 → max {𝜎𝑒^𝑧, 𝜀_𝜎_}
where𝑧 ~ 𝒩(0, 𝜏0^2)

35
Q

The mathematical definition of log-normal multiplicatively mutated variance in ES variant 2 & 3.

A

𝜎 → max {𝜎𝑒^{𝑧+𝑧i}, 𝜀_𝜎_}
where 𝑧 ~ 𝒩(0, 𝜏0^2) and 𝑧i ~ 𝒩(0, 𝜏”0^2)

36
Q

What are the reasons to prefer lognormal mutation?

A

– Standard deviations remain positive
– Median equals one (for 𝜇 = 0)
– Smaller modifications more likely than larger ones

37
Q

In ES variant 3, how are the covariance and rotation angle mutated?

A

lognormal multiplcatively &
normal additvely
(𝛼𝑗 ← 𝛼𝑗 + 𝑧𝑗 where 𝑧𝑗 ~ 𝒩(0, 𝛽2))

38
Q

What is recombination in ES?

A

The act of creating a singular offspring by selectiong components from the genotype of parents.

39
Q

What is Global intermediary recombination?

A

Average genotype over all parents

40
Q

What is Local intermediary recombination?

A

A Convex combination of 2 parents

41
Q

What is discrete recombination?

A

Pick one of the parents.

42
Q

In ES, what symbol do they use for population size and offspring size?

A

𝜇 and 𝜆

43
Q

Does ES have high selection presure?

A

Yes. Selection presure can be set using the parameters, but usually it is set very high. The selection pressure occurs because you take multiple samples for a single variable, of which only the fittest survives.

44
Q

In what cases do ES variant 1 and 2 excel?

A

Real value problems where there is no strong correlation between variables.

45
Q

Where does variant 3 of ES excel at?

A

It can be more thorough, but often it does not hold up because of the slow self-adaptation.

46
Q

Why does ES variant 3 have slow self adaptation?

A

Imagine if you have a gene that has a variance a million times larges than another gene. When you rotate that covariance matrix (by mutating the rotation variable), the sampling space of that variable becomes incredibly skewed. Hence it will take a very long time for the ES to adapt all these variables.