Lecture 2 Flashcards

1
Q

when is a function called unimodal?

A

f is called unimodal if it has exactly one maximum or minimum (eg. parabool)

if it has multiple (local) minima or maxima, it is called multimodal

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

what does parameter fitting mean?

A

tuning the model parameters to minimize the distance between the target of a certain data point and the outcome of the model for that data point

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

what are the 7 key features of Genetic Algorithms?

A
  • discrete representations
  • emphasis on crossover
  • no self-adaptation
  • larger population sizes
  • probabilistic selection
  • developed in the US
  • theory focused on schema processing
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what are the 7 key features of Evolution Strategies?

A
  • mixed-integer capabilities
  • emphasis on mutation
  • self-adaptation
  • smaller population sizes
  • deterministic selection
  • developed in Europe
  • theory focused on convergence speed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are the 7 main components of EAs?

A
  • representation of individuals (coding)
  • evaluation method for individuals (fitness)
  • initialization procedure for first generation
  • definition of variation operators (mutation, crossover)
  • parent (mating) selection mechanism
  • survivor (environmental) selection mechanism
  • technical parameters (hyperparameters)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what are 6 advantages of EAs?

A
  • widely applicable, also in cases where no good solution techniques are available
  • no presumptions w.r.t. search space
  • low development costs
  • solutions have straightforward interpretations
  • can run interactively, always deliver solutions
  • self-adaptation of strategy parameters
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what are 3 disadvantages of EAs?

A
  • no guarantee for finding optimal solutions within a finite amount of time (this is true for all global optimization methods)
  • no complete theoretical basis (yet), but much progress is being made
  • parameter tuning sometimes based on trial and error
How well did you know this?
1
Not at all
2
3
4
5
Perfectly