Home / Study library / Machine Learning Techniques / End Term · Jan 2026 Machine Learning Techniques · End Term · Jan 2026 · AN
Machine Learning Techniques · End Term · Jan 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 / 17 published solutions
Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18
Question 2 NAT · 3.0 marks Consider a dataset for a binary classification problem with five features, each of which is binary. If
we go for a generative model that satisfies the class-conditional independence assumption, then
how many free parameters do we need to learn?
A published solution is not available for this question yet.
Report a correction for Q2
Question 3 NAT · 3.0 marks Consider a regression problem in which we use a neural network with the following architecture:
• Input layer has
neurons
• Two hidden layers, each with
neurons
• Output layer with one neuron
Find the total number of parameters in the network. Ignore the biases.
A published solution is not available for this question yet.
Report a correction for Q3
Question 4 NAT · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q4
Question 5 MCQ · 3.0 marks In the context of bagging, consider a dataset of size
. A bag is a set of
points that is obtained by
sampling uniformly at random from the dataset with replacement. Which of the following
represents the probability that a data-point
is not a part of the bag?
A. B. C. D. A published solution is not available for this question yet.
Report a correction for Q5
Question 6 MCQ · 3.0 marks Consider a dataset for a binary classification problem with features in
as shown in the figure.
The red points belong to class
while the green points belong to class
. Which of the
following classifiers is the most appropriate choice?
A. Hard-margin, Linear SVM
B. Hard-margin, Kernel SVM, with a suitable kernel
C. Soft-margin, Linear SVM
D. Soft-margin, Kernel SVM, with a suitable kernel
A published solution is not available for this question yet.
Report a correction for Q6
Question 7 NAT · 2.0 marks Consider a soft-margin SVM that has been trained on a dataset with
, where
is the
hyperparamter that controls the tradeoff between the margin and the hinge loss. Let
be the
optimal weight vector. Consider a data-point
in the dataset for which
.
is
the slack corresponding to this point and
is the multiplier corresponding to the primal
constraint for this point.
Based on the above data, answer the given subquestions.
Find the value of
. Enter your answer correct to one decimal place.
A published solution is not available for this question yet.
Report a correction for Q7
Question 8 NAT · 2.0 marks Consider a soft-margin SVM that has been trained on a dataset with
, where
is the
hyperparamter that controls the tradeoff between the margin and the hinge loss. Let
be the
optimal weight vector. Consider a data-point
in the dataset for which
.
is
the slack corresponding to this point and
is the multiplier corresponding to the primal
constraint for this point.
Based on the above data, answer the given subquestions.
Find the value of
. Enter your answer correct to one decimal place.
A published solution is not available for this question yet.
Report a correction for Q8
Question 9 MSQ · 3.0 marks Consider a polynomial kernel,
of degree
. Let
. Which of the
following is/are true?
A. If
is an even number, then
for all
.
B. If
and
are orthogonal, then
.
C. can never be zero.
D. for all
.
A published solution is not available for this question yet.
Report a correction for Q9
Question 10 MSQ · 3.0 marks Two loss functions are plotted in this graph. What are the two?
A published solution is not available for this question yet.
Report a correction for Q10
Question 11 MSQ · 3.0 marks Let
be the covariance matrix of a centered dataset with
data-points in
, where
is the
data-matrix of shape
. Let
be the
principal component. Which of the following is/are
true?
A. is the variance of the dataset along
B. C. , for
A published solution is not available for this question yet.
Report a correction for Q11
Question 12 NAT · 4.0 marks Consider the following decision tree for a binary classification problem with features in
and
labels in
.
If
denotes the set of all points in
for which the decision tree outputs
as the predicted label,
find the area corresponding to the region
. Enter the nearest integer as your answer.
A published solution is not available for this question yet.
Report a correction for Q12
Question 13 NAT · 4.0 marks Consider a logistic regression classifier trained on a dataset for a binary classification problem
with features in
and labels in
. The weight vector learnt by the classifier is
. Given
a test data-point
, the probability
, where
is the base of the
natural logarithm. Find the value of
and enter the nearest integer as your answer.
A published solution is not available for this question yet.
Report a correction for Q13
Question 14 NAT · 2.0 marks Consider a linearly separable dataset,
, for a binary classification problem with features in
and labels in
that has a positive margin.
has ten data-points out of which five of them
belong to the class
. Assume that all ten data-points occupy distinct locations in
.
Let
be the optimal weight vector output by a hard-margin SVM. Consider three subsets of
as given below:
denotes the cardinality of the set. Note that
. Answer the given sub-questions.
What is
? If you cannot compute this value with the given information, enter
as the
answer.
A published solution is not available for this question yet.
Report a correction for Q14
Question 15 NAT · 2.0 marks Consider a linearly separable dataset,
, for a binary classification problem with features in
and labels in
that has a positive margin.
has ten data-points out of which five of them
belong to the class
. Assume that all ten data-points occupy distinct locations in
.
Let
be the optimal weight vector output by a hard-margin SVM. Consider three subsets of
as given below:
denotes the cardinality of the set. Note that
. Answer the given sub-questions.
What is
? If you cannot compute this value with the given information, enter
as the
answer.
A published solution is not available for this question yet.
Report a correction for Q15
Question 16 MSQ · 2.0 marks Consider a linearly separable dataset,
, for a binary classification problem with features in
and labels in
that has a positive margin.
has ten data-points out of which five of them
belong to the class
. Assume that all ten data-points occupy distinct locations in
.
Let
be the optimal weight vector output by a hard-margin SVM. Consider three subsets of
as given below:
denotes the cardinality of the set. Note that
. Answer the given sub-questions.
Which of the following is/are true?
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 dataset with two data-points for a binary classification problem with features in
.
is a data-point from the positive class while
is from the negative class. We now
consider three linear classifiers: perceptron, logistic regression and SVM.
If
is the weight vector with the largest margin, which of the following is true?
A. All three classifiers output
B. Only SVM outputs
C. Only SVM and perceptron output
D. Only perceptron and logistic regression output
A published solution is not available for this question yet.
Report a correction for Q17
Question 18 MSQ · 4.0 marks Consider a dataset consisting of
datapoints
, where each
. Let the four
features be denoted by
and
.Suppose the features satisfy the following linear
relationship:
That is, one of the features is an exact linear combination of others. A linear regression model is
trained to predict a target variable
using these features. Consider the following statements:
Consider the following statements: Which of the following is (are) true?
A. Linear regression without regularization will achieve training MSE less than or
equal to that of ridge regression.
B. The solution for linear regression without regularization may not be unique.
C. Ridge regression (L2 regularization) will always set at least one coefficient
exactly to zero.
D. Lasso regression (L1 regularization) can force some feature weights to
become exactly zero.
A published solution is not available for this question yet.
Report a correction for Q18