Home / Study library / Machine Learning Techniques / End Term · May 2026 Machine Learning Techniques · End Term · May 2026 · AN
Machine Learning Techniques · End Term · May 2026 AN
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 18 published solutions
Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19
Question 2 MCQ · 3.0 marks Which of the following statements correctly distinguishes the hard-margin SVM from the soft-
margin SVM?
A. The hard-margin SVM has a feasible solution only when the training data is
linearly separable, whereas the soft-margin SVM always has a feasible solution.
B. The hard-margin SVM allows some training points to violate the margin,
whereas the soft-margin SVM forbids all margin violations.
C. Increasing the regularisation parameter
in the soft-margin SVM makes it
behave less like the hard-margin SVM.
D. Unlike the hard-margin SVM, the soft-margin SVM can only be used with non-
linear kernels.
A published solution is not available for this question yet.
Report a correction for Q2
Question 3 MCQ · 3.0 marks Given a linearly separable dataset with margin
and radius
, which of the
following statements about the perceptron algorithm are true?
A. At a misclassified point
, a single application of the update rule is guaranteed
to classify
correctly immediately after that step.
B. For any linearly separable data with margin
, the perceptron always
converges to one unique separating hyperplane, independent of the order in which misclassified
points are presented.
C. Let
(points in
,
examples) and
(points in
,
examples) be two
linearly separable datasets with
and
. The perceptron's worst-case mistake count
is always larger for
than for
.
A published solution is not available for this question yet.
Report a correction for Q3
Question 4 MCQ · 3.0 marks Assume that for a certain linear regression problem involving
features, the following weight
vectors all produce an equal mean squared error:
Which of the weight vectors is likely to be chosen by ridge regression?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q4
Question 5 MCQ · 3.0 marks Consider the following dataset with two binary features
and binary label
:
Consider the following three claims about this dataset:
(i) Logistic regression (using the raw features
, with or without a bias term) can achieve zero
training error.
(ii) A decision tree of depth at most
, using axis-aligned splits on
, can achieve zero training
error.
(iii)
-nearest-neighbour, evaluated on this training set, achieves zero training error. Consider each
point is its own nearest neighbour.
Select the option that lists exactly the claims that are true.
A published solution is not available for this question yet.
Report a correction for Q5
Question 6 MCQ · 3.0 marks Suppose the dataset is initially linearly separable. Later, the data-generating process changes and
the class boundary becomes highly nonlinear, for example:
for one class and
for the other.
Without manually creating nonlinear features, which classifier among the three is most naturally
capable of representing this type of decision boundary?
A published solution is not available for this question yet.
Report a correction for Q6
Question 7 MCQ · 3.0 marks Suppose the true data-generating process is a polynomial of degree
. You fit three models to the
data: linear regression, polynomial regression of degree
, and polynomial regression of degree
.
Which option correctly characterizes the bias and variance of each fitted model relative to the true
model?
A. Linear: low bias, low variance; degree-
: low bias, high variance; degree-
:
high bias, high variance.
B. Linear: high bias, high variance; degree-
: low bias, low variance; degree-
:
high bias, low variance.
C. Linear: low bias, high variance; degree-
: high bias, low variance; degree-
:
low bias, high variance.
D. Linear: high bias, low variance; degree-
: low bias, low variance; degree-
: low
bias, high variance.
A published solution is not available for this question yet.
Report a correction for Q7
Question 8 NAT · 2.0 marks Consider logistic regression on one-dimensional data, with
(the
model is
). The current weight is
, the training set is a single
example
, and the step size is
. Gradient ascent is performed directly on the
log-likelihood of the data. Compute
after one gradient-ascent step. (Round to
decimal
places; enter
if it cannot be determined.)
A published solution is not available for this question yet.
Report a correction for Q8
Question 9 NAT · 2.0 marks In logistic regression, a point is classified positive only if
. What
score threshold
(with
at the boundary of this rule) does this correspond to? (Round to
decimal places.)
A published solution is not available for this question yet.
Report a correction for Q9
Question 10 NAT · 2.0 marks You build a fully-connected feed-forward neural network. The input is a
-dimensional vector; the
network has two hidden layers of
and
neurons respectively, followed by an output layer of
neurons. Every layer is densely connected to the next.
, compute the
total number of weight parameters in the network. (Enter
if it cannot be determined.)
A published solution is not available for this question yet.
Report a correction for Q10
Question 11 NAT · 3.0 marks Consider one-dimensional linear regression with no bias term,
. The squared-error
objective over the training set is
.
The dataset is
. Starting from
with learning rate
perform one gradient-descent step. What is the model's prediction at
?
A published solution is not available for this question yet.
Report a correction for Q11
Question 12 NAT · 3.0 marks Consider a soft-margin SVM in
with
and
. Two of the training points
strictly violate the margin constraint, these two points are
with
, and
with
. All other points lie strictly beyond the margin. Compute the
perpendicular distance between the margin hyperplanes
and
. (Round to
decimal places.)
A published solution is not available for this question yet.
Report a correction for Q12
Question 13 NAT · 3.0 marks A decision-tree node contains
training examples:
positive and
negative. A candidate split
divides them into two children: one child with
positive and
negative, the other with
positive
and
negative. Using entropy (base-
logarithms), compute the information gain of this split.
(Round to
decimal places.)
A published solution is not available for this question yet.
Report a correction for Q13
Question 14 MCQ · 1.0 marks
For the covariance matrix , compute the variance captured along the first principal
component.
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q14
Question 15 MCQ · 4.0 marks The figure below shows the training points of a soft-margin SVM in
, together with its decision
boundary
and its two margin hyperplanes
and
(dashed). Each
point is marked with its true label,
or
. For how many points is it possible that
lie in the
range
?
(Enter
if it cannot be determined from the figure.)
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q15
Question 16 MCQ · 4.0 marks Consider a dataset with six datapoints
, with labels
and
. A hard-margin linear SVM is trained on this dataset.
Which ONE of the following sets is a possible set of support vectors?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q16
Question 17 MCQ · 4.0 marks Consider a binary classification problem in
with positive examples
and
negative examples
. Apply the feature map
and a linear
model
. Which of the following weight vectors
gives a maximum-margin
decision surface separating the two classes?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q17
Question 18 MCQ · 2.0 marks In
-nearest-neighbours, as the hyperparameter
is increased from
towards
(the size of the
training set), which of the following best describes the trend in the model's bias and variance?
A. Bias increases, variance decreases.
B. Bias decreases, variance increases.
C. Both bias and variance increase.
D. Both bias and variance decrease.
A published solution is not available for this question yet.
Report a correction for Q18
Question 19 MCQ · 2.0 marks Suppose
are i.i.d. samples from the uniform distribution
with unknown
parameter
. Which of the following is the maximum-likelihood estimate of
?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q19