Gradient Descent Explained. A comprehensive guide to Gradient... | by Daksh Trehan | Towards Data Science

Optimization refers to the task of minimizing/maximizing an objective function f(x) parameterized by x. In machine/deep learning terminology, it’s the task of minimizing the cost/loss function J(w) parameterized by the model’s parameters w ∈ R^d. Optimization algorithms (in the case of minimization) have one of the following goals:
Find the global minimum of the objective function. This is feasible if the objective function is convex, i.e. any local minimum is a global minimum.Find the lowest possible value of the objective function within its neighborhood. That’s usually the case if the objective function is not convex as the case in most deep learning problems.
Find the global minimum of the objective function. This is feasible if the objective function is convex, i.e. any local minimum is a global minimum.
Find the lowest possible value of the objective function within its neighborhood. That’s usually the case if the objective function is not convex as the case in most deep learning problems.
Gradient Descent is an optimizing algorithm used in Machine/ Deep Learning algorithms. The goal of Gradient Descent is to minimize the objective convex function f(x) using iteration.
Gradient Descent on Cost function.
For ease, let’s take a simple linear model.
Error = Y(Predicted)-Y(Actual)
A machine learning model always wants low error with maximum accuracy, in order to decrease error we will intuit our algorithm that you’re doing something wrong that is needed to be rectified, that would be done through Gradient Descent.
We need to minimize our error, in order to get pointer to minima we need to walk some steps that are known as alpha(learning rate).
Randomly initialize values.Update values.
Randomly initialize values.
Update values.
3. Repeat until slope =0
A derivative is a term that comes from calculus and is calculated as the slope of the graph at a particular point. The slope is described by drawing a tangent line to the graph at the point. So, if we are able to compute this tangent line, we might be able to compute the desired direction to reach the minima.
Learning rate must be chosen wisely as:1. if it is too small, then the model will take some time to learn.2. if it is too large, model will converge as our pointer will shoot and we’ll not be able to get to minima.
Vanilla gradient descent, however, can’t guarantee good convergence, due to following reasons:
Picking an appropriate learning rate can be troublesome. A learning rate that is too low will lead to slow training and a higher learning rate will lead to overshooting of slope.
Another key hurdle faced by Vanilla Gradient Descent is it avoid getting trapped in local minima; these local minimas are surrounded by hills of same error, which makes it really hard for vanilla Gradient Descent to escape it.
In simple words, every step we take towards minima tends to decrease our slope, now if we visualize, in steep region of curve derivative is going to be large therefore steps taken by our model too would be large but as we will enter gentle region of slope our derivative will decrease and so will the time to reach minima.
If we consider, Simple Gradient Descent completely relies only on calculation i.e. if there are 10000 steps, then our model would try to implement Simple Gradient Descent for 10000 times that would be obviously too much time consuming and computationally expensive.
In laymen language, suppose a man is walking towards his home but he don’t know the way so he ask for direction from by passer, now we expect him to walk some distance and then ask for direction but man is asking for direction at every step he takes, that is obviously more time consuming, now compare man with Simple Gradient Descent and his goal with minima.
In order to avoid drawbacks of vanilla Gradient Descent, we introduced momentum based Gradient Descent where the goal is to lower the computation time and that can be achieved when we introduce the concept of experience i.e. the confidence using previous steps.
Pseudocode for momentum based Gradient Descent:
update = learning_rate * gradientvelocity = previous_update * momentumparameter = parameter + velocity – update
In this way rather than computing new steps again and again we are averaging the decay and as decay increases its effect in decision making decreases and thus the older the step less effect on decision making.More the history more bigger steps will be taken.
Even in the gentle region, momentum based Gradient Descent is taking large steps due to the momentum it is burdening along.
But due to larger steps it overshoots its goal by longer distance as it oscillate around minima due to steep slope, but despite such hurdles it is faster than vanilla Gradient Descent.
In simple words, suppose a man want to reach destination that is 1200m far and he doesn’t know the path, so he decided that after every 250m he will ask for direction, now if he asked direction for 5 times he would’ve travelled 1250m that’s he has already passed his goal and to achieve that goal he would need to trace his steps back. Similar is the case of Momentum based GD where due to high experience our model is taking larger steps that is leading to overshooting and hence missing the goal but to achieve minima model have to trace back its steps.
To overcome the problems of momentum based Gradient Descent we use NAG, in this we move first and then compute gradient so that if our oscillations overshoots then it must be insignificant as compared to that of Momentum Based Gradient Descent.
Nesterov accelerated Gradient(NAG) is a way to provide history to our momentum. We can now adequately look forward by computing the angle not w.r.t. to our present parameters θ.
In this, learning happens on every example:
Shuffle the training data set to avoid pre-existing order of examples.
Partition the training data set into m examples.
Advantages : —
a. Easy to fit in memoryb. Computationally fastc. Efficient for large dataset
Disadvantages :-
a. Due to frequent updates steps taken towards minima are very noisy.b. Noise can make it large to wait.c. Frequent updates are computationally expensive.
It is a greedy approach where we have to sum over all examples for each update.
Advantages :-
a. Less noisy stepsb. produces stable GD convergence.c. Computationally efficient as all resources aren’t used for single sample but rather for all training samples
Disadvantages :-
a. Additional memory might be needed.b. It can take long to process large database.c. Approximate gradients
Instead of going over all examples, Mini-batch Gradient Descent sums up over lower number of examples based on the batch size.
It is sum of both Batch Gradient Descent and Stochastic Gradient Descent.
Advantages :-
a. Easy fit in memory.b. Computationally efficient.c. Stable error go and convergence.
In case of sparse data, we would experience sparse ON(1) features and more frequent OFF(0) features, now, most of the time gradient update will be NULL as derivative is zero in most cases and when it will be one, the steps would be too small to reach minima.
For frequent features we require low learning rate, but for high features we require high learning rate.
So, in order to boost our model for sparse nature data, we need to chose adaptive learning rate.
If you like this article, please consider subscribing to my newsletter: Daksh Trehan’s Weekly Newsletter.
Hopefully, this article has not only increased your understanding of Gradient Descent but also made you realize machine learning is not difficult and is already happening in your daily life.
As always, thank you so much for reading, and please share this article if you found it useful! :)
To know more about parameters optimization techniques, follow :-
towardsdatascience.com
[1] Gradient Descent Algorithm and Its Variants by Imad Dabbura
[2] Learning Parameters, Part 2: Momentum-Based & Nesterov Accelerated Gradient Descent by Akshay L Chandra
[3] An overview of gradient descent optimization algorithms by Sebastian Ruder
[4] Understanding the Mathematics behind Gradient Descent by Parul Pandey.
[5] Deep Learning (padhAI) by Dr. Mitesh Khapra and Dr. Pratyush Kumar
The cover template is designed by me on canva.com, the source is mentioned on every visual, and the un-mentioned visuals are from my notebook.
Join me at www.dakshtrehan.com
LinkedIN ~ https://www.linkedin.com/in/dakshtrehan/
Instagram ~ https://www.instagram.com/_daksh_trehan_/
Github ~ https://github.com/dakshtrehan
Check my other articles:-
Detecting COVID-19 using Deep Learning.
Logistic Regression Explained
Linear Regression Explained
Determining perfect fit for your ML Model.
Serving Data Science to a Rookie.
Relating Machine Learning techniques to Real Life.
Follow for further Machine Learning/ Deep Learning blogs.
Cheers.
No rights reserved
 by the author.