Question 4
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?
GD with an exponentially decaying learning rate scheduler
AdaGrad
AdaM
NADAM
RMSProp
SGD with line search