Quizes Flashcards
A mathematical function always has a global minimum
No
local optima only occurs when f’(x) = 0
No. can also occur when f’(x) not defined.
What is a feasable set?
A set that satisfies the constraints on the objective function.
What properties does the Hessian(f) Matrix have?
A. Symmetric
B. Diag(H) != 0
C. No elements are zero
A. Symmetric.
Consider a 2x2 matrix if 1s. Is semi-definite?
Yes. Since all eigenvals are >= 0
Once the search direction has been find in an iterative opt. method, the problem of finding the step size is one-dimensional.
Yes. Step size is a scalar.
Newton-Rapson method always finds a minima.
No. It finds a stationary point s.t f’(x) = 0. Second order derivative test can settle (if it exists) if the point is max/min/saddle
An optimization problem is convex if f(x) is convex
No. It also requires the set of feasable solutions to be convex.
At a local minima of f(x) s.t h(x) = 0 what of the following conditions hold?
A. grad(fx) and grad(hx) are paralell
B. grad(fx) and grad(hx) are orthogonal
C. grad(hx) = 0
A. grad(fx) and grad(hx) are paralell. (see, lagrange multipliers)
If two individuals are to have offspring they must be of the same species
No. Counterexample: Mules and Ligers.
Humans have more chromosomes than other species
No. Human 48~ and carp 100+.
Why must codons consist of at least three letters?
Because there are 20 amino acids and 4^x where x < 3 doesn’t have enough combinations to encode all 20 different amino acids.
Because of random initialization stochastic algorithms converges at a slower rate.
False
In tournament selection, the competing number of individuals is always two
No. Sometimes more.
After selection of two individuals, crossover is always performed.
No. This step depends on crossover probability.
How many possible mutations can occur given m genes and p_m mut prob?
m number of mutations.
In connection to the schema theorem and GAs, what is a building block?
A building block is fixed number of genes that:
A. Short defining length, i.e distance between first and last non-wild card symbol
B. “Low order”, nr of non-wildcard symbols.
C. High fitness
f(j) = j(m-j) is a function of unitation.
Unitation is a function whose value only depends on the number of ones in the chromosome. This depends on only on the number of ones in the chromosome since m is a constant.
Good option to avoid premature convergence is to rerun the GA a couple of times.
Yes. This is equivalent to island modelling, where crossover only happens between invdividuals on the same island.
Why use two point crossover in LGP?
Dont know.
In LGP, you have a limited number of constants that cannot be changed (TRUE/FALSE)
TRUE. Constants are set once and only once. New constants can be formed by using the others as building blocks.
In Interactive Evoluationary Computation, as many pictures as possible should be presented to the evaluator
FALSE. This will cause user fatigue
Biological neural networks are able to carry out complex tasks because neurons are fast?
FALSE. Neurons have a firing capacity of 1khz, which is not that fast compared to a modern computers 3 ghz. Its the combination of many computational units that makes the animal brain so good at complex tasks.
Gene regulation plays a role in long-term memory learning tasks.
TRUE. Gene regulation causes neurons to permanently change state whereas
