Suppose that a neural network has millions of parameters (weights and biases). A team decides to
use an optimization algorithm with a learning rate scheme that is **local** to each parameter in the
network. Moreover, the learning rate changes in each iteration such that it should decrease on the
steep surface and increase on the gentle surface. Which of the following optimization algorithms
satisfy the team’s requirements?
6406532335128.
GD with an exponentially decaying learning rate scheduler
6406532335129.
AdaGrad
6406532335130.
AdaM
6406532335131.
NADAM
6406532335132.
RMSProp
6406532335133.
SGD with line search
A published solution is not available for this question yet.
Suppose we divide the available training samples into mini batches of size 32 to train a model with
mini-batch gradient descent. Assume that we have 33 different machines to train the model. One
out of 33 machines acts as a master machine. The actual weight update happens in the master
machine. The master machine can send one sample for the rest of the machines along with a copy
of the model in its current state to compute the gradients. We call this entire set-up parallelization.
Which of the following deep learning architectures can be trained in parallel then?
6406532335155.
Fully connected Feed forword neural network
6406532335156.
Convolutional Neural network
6406532335157.
Reccurent Neural Network
6406532335158.
Transformers
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
How many neurons are there in the network? Every neuron in the network has bias associated
with it?
Note: A neuron is a computation unit that takes in some inputs and produces an output.
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
Suppose we consider the three words (wood,woodchuck, much). Assume we use one-hot encoded
vector representation for all these words. The statement that,“The cosine similarity between the
pair (wood,woodchuck) is greater than the pair (wood,much)” is
6406532335149.
True
6406532335150.
False
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions.
Suppose we train the model using the BPTT algorithm for 200 iterations. In each iteration, we feed
the input sentence and make a prediction, compute the loss, back-propagate through time and
update the parameter. How many times does the parameter matrix W get updated over 200
iterations?
A published solution is not available for this question yet.