Week 3 - Genetic Programming Flashcards

1
Q

What is the algorithm outline for genetic programming?

A
  1. Generate random “programs”.
  2. Evaluate programs using training data.
  3. Selectively modify population of programs using crossover and mutation etc.
  4. If a good program is found, finish, else go to 2.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How does mutation work in genetic programming?

A

Choose a subtree at random, remove it, and generate a new subtree in its place.

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

How does crossover work in genetic programming?

A

Swapping a subtree from 2 chromosomes.

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

What are the 5 major preparatory steps for genetic programming?

A
  1. Determining the set of terminals.
  2. Determining the set of functions.
  3. Determining the fitness measure.
  4. Determining the parameters for the run.
  5. Determining the criterion for terminating a run.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly