Gradient descent

This is the gradient descent algorithm:

a here is considered to be how far the point move from w or b for each move. It is decided from 0 to 1. w and b is the current point and simultaneously, w and b move. The calculus part is accounted for a gradient, and they are repeated till it reaches convergence (the bottom of the bowl).