Consider the following statements P and Q regarding AlexNet and choose the correct option:
**(P)** In AlexNet, a trainable Local Response Normalization Layers were introduced to emulate the
competitive nature of real neurons, where highly active neurons suppress the activity of
neighboring neurons, creating competition among different kernel outputs.
**(Q)** In AlexNet, a total of 8 Convolutional layers contain only about 6-7% of the total parameters
hence account for the least computation.
6406534459605.
Only statement P is true
6406534459606.
Only statement Q is true
6406534459607.
Both statements are true
6406534459608.
None of these statements is true
A published solution is not available for this question yet.
Consider two bounding boxes in an image:
- Box A: top-left at (0, 0), bottom-right at (12, 12) - Box B: top-left at (4, 4), bottom-right at (16, 16)
What is the Intersection over Union (IoU) between these two boxes ____________(in %)
A published solution is not available for this question yet.
Which of the following techniques help mitigate the **vanishing gradient problem** in recurrent
neural networks?
1. Gradient clipping
2. Use of ReLU activation to preserve gradient flow
3. Use of LSTM units
4. Data augmentation (e.g., reversing input sequence)
6406534459626.
1 and 2 only
6406534459627.
2 and 3 only
6406534459628.
3 and 4 only
6406534459629.
1, 2, and 3 only
A published solution is not available for this question yet.
Which of the following techniques help mitigate the **exploding gradient problem** in recurrent
neural networks?
1. Gradient clipping
2. Use of Sigmoid activation to prevent gradient growth
3. Use of LSTM units
4. Data augmentation (e.g., reversing input sequence)
6406534459630.
1 and 2 only
6406534459631.
1 and 3 only
6406534459632.
1, 2, and 3
6406534459633.
All of these
A published solution is not available for this question yet.
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 256 and 128 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.
A published solution is not available for this question yet.
Suppose you want to build an encoder-decoder recurrent model with attention. The context vector
at time step t is given by:
where αtj refers to the alignment score between the decoder state at time t _____________and the
encoder state at time _____________. Note: Please write your answer using variables
Based on the above data, answer the given subquestions.
Decoder state at time t : _______________
A published solution is not available for this question yet.
Suppose you want to build an encoder-decoder recurrent model with attention. The context vector
at time step t is given by:
where αtj refers to the alignment score between the decoder state at time t _____________and the
encoder state at time _____________. Note: Please write your answer using variables
Based on the above data, answer the given subquestions.
Encoder state at time: _______________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
Hidden state ht−1______________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
Hidden state ht_____________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
Current Input xt________________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
Update gate zt_______________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
Reset gate rt ______________
A published solution is not available for this question yet.
Consider a Gated Recurrent Unit (GRU) cell at time step ’t’.
For each of the entities in the given subquestions, enter the appropriate number from the figure
that corresponds to it:
Based on the above data, answer the given subquestions.
New hidden state content eh____________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation).
Calculate the number of parameters and computational cost for this convolution layer.
Based on the above data, answer the given subquestions.
Number of Parameters:_____________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation).
Calculate the number of parameters and computational cost for this convolution layer.
Based on the above data, answer the given subquestions.
Computational Cost:___________________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation),
calculate the number of parameters and computational cost, but make use of **Depthwise**
**Seperable convolution** and **pointwise convolution** instead of standard convolution.
Based on the above data, answer the given subquestions.
Number of parameters for depthwise seperable convolution:_______________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation),
calculate the number of parameters and computational cost, but make use of **Depthwise**
**Seperable convolution** and **pointwise convolution** instead of standard convolution.
Based on the above data, answer the given subquestions.
Computational Cost for depthwise seperable convolution:____________________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation),
calculate the number of parameters and computational cost, but make use of **Depthwise**
**Seperable convolution** and **pointwise convolution** instead of standard convolution.
Based on the above data, answer the given subquestions.
Number of parameters for pointwise convolution:___________________
A published solution is not available for this question yet.
Let input have size Df × Df × M where Df = 10 and M = 256 and output feature map (after passing
input through conv layer) has Df × Df × N size where N = 512. Assume padded convolution. Let
width of the square kernel in conv layer be k where k = 7 (Ignore the bias term in the calculation),
calculate the number of parameters and computational cost, but make use of **Depthwise**
**Seperable convolution** and **pointwise convolution** instead of standard convolution.
Based on the above data, answer the given subquestions.
Computational cost for pointwise convolution:__________________
A published solution is not available for this question yet.