Gradient Descent
Gradient Descent
Additionally, they are blindfolded. So, what approach do you think would make you reach
the lake?
The best way is to observe the ground and find where the land descends.
From that position, take a step in the descending direction and iterate this process until we
reach the lowest point.
Plotting a scatterplot in statistics and ‰finding the line of best fit, which required calculating
the error between the actual output and the predicted output (y-hat) using the mean squared
error formula.
The gradient descent algorithm behaves similarly, but it is based on a convex function, such
as the one below:
High learning rates result in larger steps but risks overshooting the minimum.
While it has the advantage of more precision, the number of iterations compromises overall
efficiency as this takes more time and computations to reach the minimum.