Data Fundamentals (H) - Week 06 Quiz
1. I want to find the shape of an object, with constant surface area, that holds the least water. What is the objective function?
The surface area of the object.
The colour of the surface.
The amount of water the object holds.
None of the above.
The shape of the object.
2. A convex constraint is equivalent to a restriction to a portion of the parameter space:
where the parameter vector has a fixed \(L_\infty\) norm.
within a torus of fixed radius.
where the minima are.
defined by a collection of planes.
inside an axis-aligned box.
3. An objective function is nonconvex, iff:
It is discontinuous.
It more than one minimum.
It is incomputable.
It has two maxima.
It is partially differentiable.
4. The
feasible set
in an optimisation problem is:
a kind of metaheuristic
the best solutions to the problem
the possible values of the objective function
the most distant configurations in the parameter space
the possible configurations of the parameters
5. In an approximation problem, we'd often have a loss function of the form:
\(L(\theta) = \frac{\theta}{f(\vec{x}-\vec{\theta})}\)
\(L(\theta) = \theta \vec{x}\)
\(L(\theta) = \|f(\vec{x};\theta)-y\|\)
\(L(\theta) = \frac{1}{\theta}\)
\(L(\theta) = \|\theta - \vec{x}\|\)
6. The definition of an eigenvector is:
\(A\vec{x} = \lambda x\)
\(\lambda = \|\vec{x}\|_2\)
\(A\lambda = \vec{x}A\)
\(A^{-1}\vec{x} = A^{+}\lambda\)
\(A\vec{x} = x\)
Submit Quiz