Quiz Space

January 2023 term · Deep Learning · BSCS3004

Deep Learning Quiz 2: 2 April 2023, Set QPE3 (January 2023 term)

The IIT Madras BS Deep Learning (Deep Learning) Quiz 2 paper sat on 2 Apr 2023, in the January 2023 term, set QPE3: 17 questions for 45 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
17
Marks
45
Duration
120 min
MCQ
5
MSQ
3
Numerical
9

Updated

Official paper: IIT M DEGREE AN3 EXAM QPE3 02 Apr 2023 · No negative marking.

Question 1

+3 marksOne correct option
  1. A

    AdaGrad takes lesser number of iterations than vanilla Gradient Descent toconverge

  2. B

    AdaGrad takes more number of iterations than vanilla Gradient Descent toconverge

  3. C

    Both the algorithms will converge in equal number of iterations

  4. D

    Both the algorithms will keep oscillating around the minimum

Show answer

Correct answer

  • B

    AdaGrad takes more number of iterations than vanilla Gradient Descent toconverge

Question 2

+3 marksOne correct option
  1. A

    True, due to the presence of noise in the target

  2. B

    True, due to the high variance of the prediction model

  3. C

    False, due to the high variance of the prediction model

  4. D

    False, due to zero mean of the noise added to the target

Show answer

Correct answer

  • C

    False, due to the high variance of the prediction model

Question 3

+2 marksOne or more correct options

Which of the following statement(s) is (are) true about adaptive gradient descent algorithms?

Select all that apply.

  1. A

    They are more suitable for sparse data

  2. B

    They are more suitable for dense data

  3. C

    They add additional computational complexity to the vanilla gradient descentalgorithm

  4. D

    They are guranteed to converge to global minimum

Show answer

Correct answers

  • A

    They are more suitable for sparse data

  • C

    They add additional computational complexity to the vanilla gradient descentalgorithm

Question 4

+2 marksOne correct option

Consider the assertion and the corresponding reason,
Assertion (A): The effective learning rate in RMSprop may increase or decrease Reason (R): This is due to exponential averaging of squared gradients

  1. A

    A is true but R is not the correct reason

  2. B

    A is True and R is the correct reason

  3. C

    A is False and therefore R

Show answer

Correct answer

  • B

    A is True and R is the correct reason

Question 5

+2 marksOne correct option

Suppose that we modify the update equation of ADAM optimizer as follows

Suppose that we modify the update equation of ADAM optimizer as follows

  1. A

    TRUE

  2. B

    FALSE

Show answer

Correct answer

  • B

    FALSE

Question 6

+3 marksOne or more correct options

Select all that apply.

  1. A

    High bias

  2. B

    High variance

  3. C

    Low bias

  4. D

    Low variance

Show answer

Correct answers

  • A

    High bias

  • D

    Low variance

Question 7

+3 marksOne or more correct options

Suppose that we have a deep neural network with sigmoid neurons at all layers. Which of the following approaches, in general, help the network to overcome the vanishing gradient problem?

Select all that apply.

  1. A

    Replace sigmoid neuron by tanh

  2. B

    Replace sigmoid neuron by GELU

  3. C

    Use unsupervised layerwise pretraining and finally train the entire networkwith supervised objective

  4. D

    Use supervised training one-layer at a time with sigmoid functions andgradually add layers

  5. E

    Use Residual connections

  6. F

    Constrain the weight values with an appropriate regularization technique

Show answer

Correct answers

  • B

    Replace sigmoid neuron by GELU

  • C

    Use unsupervised layerwise pretraining and finally train the entire networkwith supervised objective

  • E

    Use Residual connections

  • F

    Constrain the weight values with an appropriate regularization technique

Question 8

+2 marksNumerical answer

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.

Suppose that we pad zeros of size 1 (p = 1) around the sides of the image (in all channels). Assume stride 2 for all 10 convolution filters on the input image. All the 10 filters have bias associated with it. What is the dimension of the output volume? Enter the number of elements in the output volume.

Show answer

Correct answer: 7290

Question 9

+2 marksNumerical answer

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.

How many number of parameters are there in the convolution layer?

Show answer

Correct answer: 760

Question 10

+3 marksNumerical answer

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.

Show answer

Correct answer: 8071

Question 11

+3 marksOne correct option

An input image of dimension 55 × 55 × 3 is to be convolved with 10 filters (kernels) of spatial dimension 5 × 5. In all the sub-questions, assume a bias term for kernels.

Suppose we applied 1D convolution operation with 10 kernels on the output of the first convolution layer and then applied the rest of the operations as in the previous question (flattening followed by fully connected layer), then the number of parameters in the network would have

  1. A

    Increased

  2. B

    Decreased

  3. C

    Remained same

  4. D

    Insufficient information

Show answer

Correct answer

  • A

    Increased

Question 12

+2 marksNumerical answer
Show answer

Correct answer: 12

Question 13

+2 marksNumerical answer
Show answer

Correct answer: 10.0

Question 14

+2 marksNumerical answer
Show answer

Correct answer: 10.0

Question 15

+4 marksNumerical answer
Show answer

Correct answer: 4

Question 16

+3 marksNumerical answer

Enter the sum of updated bias (exclude weights).

Show answer

Correct answer: -3

Question 17

+4 marksNumerical answer
Show answer

Correct answer: 0