Repository navigation
19. Gradient Descent Optimization
Today's optimization method is the machine at the heart of data science, machine learning, and artificial intelligence. We will study it on
Remember, the key fact about the gradient is that it points in the direction of steepest ascent. This means
The basic steps of the algorithm are:
- Start at a point on a surface.
- Compute the gradient at that point.
- Take a small step in the direction opposite the gradient (a small step downhill).
- Repeat until we reach a minimum.
Note: we could use
Here are a few illustrations of the method:
The basic steps above, when converted to our math notation, look like this:
- Pick an initial point
$\large \left(x_0,y_0\right)$ . - Compute
$\large \nabla f\left(x_0,y_0\right)$ . - Move a small distance in the direction
$\large -\nabla f\left(x_0,y_0\right)$ . Call this new point$\large \left(x_1,y_1\right)$ . - Repeat until
$\large \left|\nabla f\right|$ is small.
In a more abbreviated form, the algorithm looks like this:
The parameter
In the video below, we go through a few steps of the algorithm:
- Some of the potential issues and difficulties
- Practice doing the algorithm by hand
I can:
- Do 1-2 steps of the gradient descent algorithm
- Visualize the algorithm on a plot
- Run the algorithm in Python (this will be Lab #7)
Calculus of Vector Valued Functions
Kepler's Laws of Orbital Motion
Gradient and Directional Derivative
Least Squares Best Fitting Line
Double Integrals on Rectangular Regions
Double Integrals on General Domains
Double Integrals in Polar Coordinates
Triple Integrals in Cylindrical/Spherical Coordinates
Line Integrals in Vector Fields
Fundamental Theorem of Line Integrals