uiz Space

May 2024 term · Deep Learning for Computer Vision · BSDA5006

Deep Learning for Computer Vision Quiz 2: 4 August 2024 (May 2024 term)

The IIT Madras BS Deep Learning for Computer Vision (Deep Learning for Computer Vision) Quiz 2 paper sat on 4 Aug 2024, in the May 2024 term: 29 questions for 48 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions
29
Marks
48
Duration
120 min
MCQ
16
Numerical
9
Written
1
MSQ
3

Updated

Official paper: IIT M DEGREE AN EXAM QDB2 4 Aug 2024 · No negative marking.

Question 1

+2 marksOne correct option

Which one of the below statements is incorrect?

  1. A

    Global Average Pooling (GAP) technique is used in both CAM and Grad-CAM.

  2. B

    The purpose of GAP is to find an importance score for every feature map, which represents how much that feature map contributes to generate the explanation.

  3. C

    For both CAM and Grad-CAM, explanation can be generated with respect to any layer of a CNN.

  4. D

    For every pixel in the feature map, Grad-CAM++ assigns different weightage, whereas Grad-CAM gives the same weightage.

Show answer

Correct answer

  • C

    For both CAM and Grad-CAM, explanation can be generated with respect to any layer of a CNN.

Question 2

+2 marksOne correct option

Which one of the following statements is false?

  1. A

    In a max pooling layer, the unit that gets selected (maximum entry) in forward propagation gets all the gradient during backpropagation.

  2. B

    Residual blocks are used in ResNets to avoid the vanishing gradient problem.

  3. C

    Feature maps of initial layers of a CNN capture more abstract concepts than the feature maps of final layers.

  4. D

    Dilated convolution increases the receptive field size when compared to the standard convolution operator.

Show answer

Correct answer

  • C

    Feature maps of initial layers of a CNN capture more abstract concepts than the feature maps of final layers.

Question 3

+2 marksOne correct option

Match the following:

  1. A

    1→ v, 2→ iv, 3→ ii, 4 → i

  2. B

    1→ i, 2→ iv, 3 → iii, 4→ ii

  3. C

    1→ i, 2→ v, 3 → iii, 4→ iv

  4. D

    1→ ii, 2→ iii, 3 → i, 4 →iv

Show answer

Correct answer

  • D

    1→ ii, 2→ iii, 3 → i, 4 →iv

Question 4

+2 marksOne correct option

Identify the true statement regarding different loss functions:

  1. A

    The objective of ranking loss is to predict relative distances between inputs.

  2. B

    The contrastive loss takes an anchor example and brings negative examples closer while pushing away positive examples.

  3. C

    The triplet loss always uses a non-negative margin to compare distances of sample representations.

  4. D

    The hinge loss only considers pairwise examples at a time.

Show answer

Correct answer

  • A

    The objective of ranking loss is to predict relative distances between inputs.

Question 5

+2 marksOne correct option

In the context of Variational Autoencoders, the idea of variational inference solves the problem of

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 6

+2 marksOne correct option

Which of the following is incorrect for the reparametrization trick used in a Variational AutoEncoder (VAE)?

  1. A

    This technique is used, since the expected reconstruction error requires estimation by sampling which has very high variance.

  2. B

    It can be applied to any “location-scale” family of distributions where the location (mean) and scale (variance) of the standard version is 0 and 1.

  3. C

    The reparametrization trick is applicable to continuous distributions as well as discrete distributions.

  4. D

    It allows the random variable to be expressed as a different transformation of auxiliary variables which helps the gradient estimation with only one sample

Show answer

Correct answer

  • C

    The reparametrization trick is applicable to continuous distributions as well as discrete distributions.

Question 7

+2 marksOne correct option

In an image classification problem, which of the following is the quantity of interest in a generative model?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 8

+2 marksOne correct option
  1. A

    0.5151

  2. B

    0.6161

  3. C

    0.7171

  4. D

    0.8181

Show answer

Correct answer

  • D

    0.8181

Question 9

+2 marksOne correct option
  1. A

    Sigmoid of alignment scores

  2. B

    Softmax of alignment scores

  3. C

    ReLU of alignment scores

  4. D

    None of these

Show answer

Correct answer

  • B

    Softmax of alignment scores

Question 10

+2 marksOne correct option

Which one of the following statements is true?

  1. A

    The goal of triplet loss is to ensure that the distance between the anchor and the negative sample is at least ’margin’ less than the distance between anchor and positive sample.

  2. B

    Face identification is a multi-class classification problem whereas face verification is a binary classification problem

  3. C

    Both the goal of triplet loss is to ensure that the distance between the anchor and the negative sample is at least ’margin’ less than the distance between anchor and positive sample. & Face identification is a multi-class classification problem whereas face verification is a binary classification problem

  4. D

    None of these

Show answer

Correct answer

  • B

    Face identification is a multi-class classification problem whereas face verification is a binary classification problem

Question 11

+2 marksOne correct option

Which one of the following statements is false?

  1. A

    Attention mechanisms cannot be applied to the bidirectional RNN model

  2. B

    An image captioning network cannot be trained end-to-end even though we are using 2 different modalities to train the network

  3. C

    One of the key components in the vanilla transformer are the recurrent connections that help them to deal with variable input length.

  4. D

    All of these

Show answer

Correct answer

  • D

    All of these

Question 12

+2 marksOne correct option

Consider two 10×10 bounding boxes(one on the upper left and one of the lower right) in an images with an overlapping region of 6 × 6. The Intersection over Union (IoU) between the two boxes is (choose the closest value):

  1. A

    21%

  2. B

    25%

  3. C

    33%

  4. D

    37%

Show answer

Correct answer

  • A

    21%

Question 13

+2 marksOne correct option

A four-dimensional input vector x = [5, 3,−1, 2] is passed to a hidden layer with a single neuron and an activation function a(.) to obtain z. Assume that the corresponding weights (from input to hidden layer) are [0.4, 0.6, 0.8,−0.2] and bias is 0.4. If the activation function a(.) is Sigmoid, Linear, Indicator function, Softplus, ReLU and Leaky-ReLU, what are the corresponding values of z? (Note that Indicator function returns 1 for a positive input, and 0 otherwise. Softplus is defined as: ln(1 + exp(z)).

  1. A

    0.95, 3, 1, 0.35, 3, 3

  2. B

    0.95, 3, 0, 3.05, 3, 3

  3. C

    0.92, 3, 1, 3.5, 3, 3

  4. D

    0.95, 3, 1, 3.05, 3, 3

Show answer

Correct answer

  • D

    0.95, 3, 1, 3.05, 3, 3

Question 14

+2 marksOne correct option
  1. A

    1→ iv, 2→ iii, 3→ ii, 4 → i

  2. B

    1→ ii, 2→ iii, 3 → i, 4 →iv

  3. C

    1→ iv, 2→ iii, 3→ i, 4 → ii

  4. D

    1→ ii, 2→ iv, 3 → iii, 4→ i

Show answer

Correct answer

  • C

    1→ iv, 2→ iii, 3→ i, 4 → ii

Question 15

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • D

Question 16

+2 marksOne correct option
  1. A

    1→ iii, 2→ ii, 3 → vi, 4→ i

  2. B

    1→ v, 2→i, 3 → vi, 4→ iii

  3. C

    1→ ii, 2→ i, 3 → ii, 4 → iii

  4. D

    1→ i, 2 →ii, 3 → vi, 4→ iv

Show answer

Correct answer

  • B

    1→ v, 2→i, 3 → vi, 4→ iii

Question 17

+2 marksNumerical answer

Consider a Faster R-CNN object detection framework, which is being trained with a mini-batch size of 2. The RPN produces 512 proposals, out of which 12 and 14 of them are foreground proposals,corresponding to each image in the mini-batch. For a single mini-batch update, the bounding box regression loss will be computed_____________________ times.

Show answer

Correct answer: 26

Question 18

+2 marksNumerical answer

The feature embeddings obtained from a neural network for an anchor sample, positive sample and negative sample are as given below:

  • Anchor Sample: [4,5,3,7,1][4, 5, 3, 7, 1]
  • Positive Sample: [8,5,6,7,1][8, 5, 6, 7, 1]
  • Negative Sample: [9,1,3,8,0][9, 1, 3, 8, 0]

The triplet loss given that margin α=12\alpha = 12 will be __________
(Hint: Triplet loss uses squared euclidean distance.)

Show answer

Correct answer: -30

Question 19

+2 marksNumerical answer

A Siamese network is trained for face verification. The face image to be verified is passed through the first branch and the anchor image is passed through the second branch. There are 73286 parameters in each of the branches. Triplet loss is used to learn the overall Siamese network. The total number of trainable parameters in the network (assuming there are no other layers or modules) are________________(write your answer as a number).

Show answer

Correct answer: 73286

Question 20

+0.67 marksNumerical answer

Based on the above data, answer the given subquestions.

z1=_________________

Show answer

Correct answer: 0.35

Question 21

+0.67 marksNumerical answer

Based on the above data, answer the given subquestions.

z2=____________________

Show answer

Correct answer: 0.24

Question 22

+0.66 marksNumerical answer

Based on the above data, answer the given subquestions.

z3=_______________

Show answer

Correct answer: 0.18

Question 23

+0.5 marksWritten answer

KL divergence is not a distance metric because KL(P∥Q)\text{KL}(P\|Q) is (a) __________ to KL(Q∥P)\text{KL}(Q\|P). And KL divergence is always ⩾\geqslant (b) __________.
Suppose P∼Bernoulli(0.8)P \sim \text{Bernoulli}(0.8) and Q∼Bernoulli(0.2)Q \sim \text{Bernoulli}(0.2) then
(c) KL(P∥Q)=\text{KL}(P\|Q) = __________ nats and (d) KL(Q∥P)=\text{KL}(Q\|P) = __________ nats.

Hint: You can use these values of natural log: ln⁡(2)=0.69\ln(2) = 0.69, ln⁡(4)=1.38\ln(4) = 1.38, ln⁡(0.6)=−0.510\ln(0.6) = -0.510, ln⁡(8)=2.079\ln(8) = 2.079, ln⁡(0.4)=−0.91\ln(0.4) = -0.91,
Answer upto two decimal places.

Based on the above data, answer the given subquestions.

Enter the correct answer for (a)
**NOTE:**Enter the exact answer without any space in the beginning or at the end.

Show answer

Correct answer: not equal

Question 24

+0.5 marksNumerical answer

KL divergence is not a distance metric because KL(P∥Q)\text{KL}(P\|Q) is (a) __________ to KL(Q∥P)\text{KL}(Q\|P). And KL divergence is always ⩾\geqslant (b) __________.
Suppose P∼Bernoulli(0.8)P \sim \text{Bernoulli}(0.8) and Q∼Bernoulli(0.2)Q \sim \text{Bernoulli}(0.2) then
(c) KL(P∥Q)=\text{KL}(P\|Q) = __________ nats and (d) KL(Q∥P)=\text{KL}(Q\|P) = __________ nats.

Hint: You can use these values of natural log: ln⁡(2)=0.69\ln(2) = 0.69, ln⁡(4)=1.38\ln(4) = 1.38, ln⁡(0.6)=−0.510\ln(0.6) = -0.510, ln⁡(8)=2.079\ln(8) = 2.079, ln⁡(0.4)=−0.91\ln(0.4) = -0.91,
Answer upto two decimal places.

Based on the above data, answer the given subquestions.

Enter the correct answer for (b)

Show answer

Correct answer: 0

Question 25

+0.5 marksNumerical answer

KL divergence is not a distance metric because KL(P∥Q)\text{KL}(P\|Q) is (a) __________ to KL(Q∥P)\text{KL}(Q\|P). And KL divergence is always ⩾\geqslant (b) __________.
Suppose P∼Bernoulli(0.8)P \sim \text{Bernoulli}(0.8) and Q∼Bernoulli(0.2)Q \sim \text{Bernoulli}(0.2) then
(c) KL(P∥Q)=\text{KL}(P\|Q) = __________ nats and (d) KL(Q∥P)=\text{KL}(Q\|P) = __________ nats.

Hint: You can use these values of natural log: ln⁡(2)=0.69\ln(2) = 0.69, ln⁡(4)=1.38\ln(4) = 1.38, ln⁡(0.6)=−0.510\ln(0.6) = -0.510, ln⁡(8)=2.079\ln(8) = 2.079, ln⁡(0.4)=−0.91\ln(0.4) = -0.91,
Answer upto two decimal places.

Based on the above data, answer the given subquestions.

Enter the correct answer for (c)

Show answer

Correct answer: 0.83

Question 26

+0.5 marksNumerical answer

KL divergence is not a distance metric because KL(P∥Q)\text{KL}(P\|Q) is (a) __________ to KL(Q∥P)\text{KL}(Q\|P). And KL divergence is always ⩾\geqslant (b) __________.
Suppose P∼Bernoulli(0.8)P \sim \text{Bernoulli}(0.8) and Q∼Bernoulli(0.2)Q \sim \text{Bernoulli}(0.2) then
(c) KL(P∥Q)=\text{KL}(P\|Q) = __________ nats and (d) KL(Q∥P)=\text{KL}(Q\|P) = __________ nats.

Hint: You can use these values of natural log: ln⁡(2)=0.69\ln(2) = 0.69, ln⁡(4)=1.38\ln(4) = 1.38, ln⁡(0.6)=−0.510\ln(0.6) = -0.510, ln⁡(8)=2.079\ln(8) = 2.079, ln⁡(0.4)=−0.91\ln(0.4) = -0.91,
Answer upto two decimal places.

Based on the above data, answer the given subquestions.

Enter the correct answer for (d)

Show answer

Correct answer: 0.83

Question 27

+2 marksOne or more correct options

Consider generative and discriminative models for a classification task. Generative models learn the data-generating mechanism by modeling class-conditional and prior distributions before making predictions. Discriminative models make predictions based on patterns learned in the training set. Which one of the following is an example of a generative model? Select all that are correct.

Select all that apply.

  1. A

    Convolutional Neural Network

  2. B

    Naive-Bayes

  3. C

    Logistic Regression

  4. D

    Support Vector Machine

  5. E

    Quadratic Discriminant Analysis

Show answer

Correct answers

  • B

    Naive-Bayes

  • E

    Quadratic Discriminant Analysis

Question 28

+2 marksOne or more correct options

Which of the following are true:

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • B
  • D

Question 29

+2 marksOne or more correct options

Which of the following is true regarding Hard Attention and Soft Attention?

Select all that apply.

  1. A

    Soft Attention is smooth and differentiable

  2. B

    Variance reduction techniques are used to train Soft Attention models

  3. C

    Soft Attention is computationally cheaper than Hard Attention when the source input is large

  4. D

    The inference (test time) overhead is low in Hard Attention when compared to Soft Attention models

Show answer

Correct answers

  • A

    Soft Attention is smooth and differentiable

  • C

    Soft Attention is computationally cheaper than Hard Attention when the source input is large