Home > Machine Learning 101 > Quizzes > Machine Learning 101 Practice Test: Stochastic Gradient Descent
Machine Learning 101 Practice Test: Stochastic Gradient Descent
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “Given a function y = (x + 30)2. How many iterations does it need to reach the fi…”
Quiz on optimization algorithms, specifically focusing on Stochastic Gradient Descent (SGD), its variants, the standard Gradient Descent Algorithm, and Subgradient Descent. Stochastic Gradient Descent (SGD) is a gradient-based optimization algorithm that finds the optimal parameter configuration for a machine learning algorithm. It's a variant of the Gradient Descent algorithm.  SGD iteratively updates a model's parameters one sample or batch at a time. This makes SGD models computationally efficient and able to handle large datasets.  SGD is one of three types of gradient descent learning... Show more
Machine Learning 101 Practice Test: Stochastic Gradient Descent
Time left 00:00
25 Questions

1. The step size rules in Subgradient are determined before the algorithm is run.
2. Given an example from a dataset (x1, x2) = (4, 1), observed value y = 2 and the initial weights w1, w2, bias b as -0.015, -0.038 and 0. What will be the prediction y’.
3. Given the example from a data set x1 = 3, x2 = 1, observed value y = 2 and predicted value y’ = -0.05. What will be the gradient if you are using a squared difference method?
4. Which of the following statements is false about choosing learning rate in gradient descent?
5. Given a function y = (x + 30)2. How many iterations does it need to reach the first negative value of the function starting from the point x = 1 using gradient descent (Assume the learning rate is 0.01)?
6. Given an example from a dataset (x1, x2) = (2,8) and the dependent variable y = -14, and the model prediction y’ = -11. What will be the loss function if we are using a squared difference method?
7. Subgradient methods can be much slower than interior-point methods.
8. Which of the following is not a variant of stochastic gradient descent?
9. Projection step is used to overcome the problem while maintaining the same convergence rate.
10. Which of the following statements is not true about Subgradient method?
11. Which of the following statements is true about stochastic gradient descent?
12. More sophisticated averaging schemes can improve the convergence speed in the case of strongly convex functions.
13. Which of the following statements is not true about the stochastic gradient descent?
14. The Subgradient is a descent method.
15. Given a function y = (x + 4)2. What is the local minima of the function starting from the point x = 3 and the value of x after the first iteration using gradient descent (Assume the learning rate is 0.01)?
16. Given the current bias b = 0, learning rate = 0.01 and gradient = -4.2. What will be the b’ value after the update?
17. Which of the following statements is not true about two-step update rule?
18. Stochastic gradient descent cannot be used for risk minimisation.
19. What is the gradient of the function 2x2 – 3y2 + 4y – 10 at point (0, 0)?
20. Stochastic gradient descent (SGD) methods handle redundancy in the data much more efficiently than batch methods.
21. Stochastic gradient descent can be used for convex-smooth learning problems.
22. Subgradient descent can be used at points where derivative is not defined.
23. Which of the following statements is not true about stochastic gradient descent for regularised loss minimisation?
24. The main difference between gradient descents variants are based on the amount of data.
25. Stochastic gradient descent has the possibility of escaping from local minima.