Quiz
Stochastic optimization algorithms
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (39)
1A mathematical function f(x) has always only one global minimum.
- ATrue
- BFalse
2Local optima occur only where f'(x) = 0.
- ATrue
- BFalse
3What is the feasible set (In connection with constrained optimization)? (Pick oneanswer!)
- AThe set of all points for which the function reaches its optimum.
- BThe set of all points that fulfil the constraints.
- CThe set of all points for which f(x) = 0.
4Which property applies to the Hessian matrix H (of a function f)? Pick one answer!
- AIt is symmetric
- BOnly the diagonal elements are non-zero
- CAll its elements are always non-zero
5Consider a 2x2 matrix in which all elements are equal to 1. Is this matrix positive definite?
- ATrue
- BFalse
6In an iterative method, once the search direction has been found, the problem of finding a suitable step length is one-dimensional.
- ATrue
- BFalse
7Newton-Raphson's method will always converge to a local minimum.
- ATrue
- BFalse
8An optimization problem is always convex if f(x) is convex.
- ATrue
- BFalse
9Consider the level curves of a function f = f(x1,x2) and a constraint h(x1,x2) = 0. At the localoptima of f (subject to h), the following holds:
- AThe gradients of f and h are perpendicular
- BThe gradient of h is equal to the zero vector
- CThe gradients of f and h are parallel
10Stochastic optimization methods can be applied even if the objective function f(x) is non-differentiable.
- ATrue
- BFalse
11 If two individuals are able to have offspring, they must be of the same species.
- ATrue
- BFalse
12Acquired traits (i.e. things learned) can be transmitted to the next generation.
- ATrue
- BFalse
13Humans have more chromosomes than any other known species.
- ATrue
- BFalse
14All processes in Darwinian evolution are random and without direction.
- ATrue
- BFalse
15In an evolutionary algorithm, the fact that chromosomes are initialized randomlyslows down the process of finding the optimum.
- ATrue
- BFalse
16It is important to make the right choice between binary and real-number encoding,for a givenoptimizationproblem.
- ATrue
- BFalse
17In tournament selection, the number of individuals participating in a tournamentis always equal to two.
- ATrue
- BFalse
18In some cases, after selecting two individuals, one does not carry out crossover.
- ATrue
- BFalse
19During mutations (in GAs) each gene is considered separately, so that the number of mutations can, in principle, be anythingfrom 0 to m(= the number of genes).
- ATrue
- BFalse
20The function f(j) = j(m-j), where j is the number of ones in the chromosome,is an example of a function of unitation.
- ATrue
- BFalse
21There are various methods to avoid premature convergence. However, another good option is simply to rerun the GA a couple of times.
- ATrue
- BFalse
22In LGP, regarding constants, oneis stuck with only the predefined ones,which are stored in the constant registers.
- ATrue
- BFalse
23In interactive evolutionary computation (IEC) one should try to present (on the screen) as many solution candidates (to the user) as possible.
- ATrue
- BFalse
24Biological neural networks are able to carry out complex tasks because neuronsoperate really fast.
- ATrue
- BFalse
25Gene regulation plays a role in long-term memory and learning.
- ATrue
- BFalse
26Feedforward neural networks require backpropagation for training.
- ATrue
- BFalse
27When fitting a model (e.g. a neural network) to a given data set, one shouldrun the training procedure for as long as possible.
- ATrue
- BFalse
28Ants have skilled leaders and are capable of long-distance communication
- ATrue
- BFalse
29What is a stigmergy
- AA mechanism for long-range communication using sound.
- BA mechanism for indirect communication bymeans of (local)modification of the environment.
- CA mechanism for long-range communication using vision.
30The movement of ants is always in the direction of the strongest pheromone scent.
- ATrue
- BFalse
31The change in the artificial pheromone level (in AS, applied to the TSP) on edge (i,j) dependsonlyon the (inverse of) the length of that edge.
- ATrue
- BFalse
32In ACO, the artificial ants always follow the edge for which the probability p(eij|S) is highest.
- ATrue
- BFalse
33In MMAS, one can prove that the probability of finding the best solution at least once in the first kiterations, tends to 1 as ktends to infinity. The reason that onecan prove this is the fact that (in MMAS) all edges have positivepheromone levels.
- ATrue
- BFalse
34In robot swarms (such as Harvard's 1000-robot swarm), only local communication(e.g. communication within the line of sight) is used.
- ATrue
- BFalse
35In PSO, both velocities and positions are restricted to a given range.
- ATrue
- BFalse
36In the simple analytical model of PSO (Appendix B.4), in which no random numbers are used (and where there is no velocity restriction), the swarm remains bounded if and only if c_1+ c_2< 4.
- ATrue
- BFalse
37In variable truncation PSO, all variables areintegers at all times.
- ATrue
- BFalse
38When comparing the performance of different settings for a stochastic optimizationalgorithm, one should make sure to use the same number of iterations (generations)for each setting.
- ATrue
- BFalse
39For the n-parity problem, one can separate the two classes (output = 0 and output = 1) using a single hyperplane.
- ATrue
- BFalse
Information
- Description
- Stochastic optimization algorithms Quiz on Stochastic optimization algorithms, created by David Larsson on 04/09/2019.
- Author
- David Larsson
- Language
- English
- Views
- 5
- Tags
- Rating
- No ratings yet Rate this quiz