Skip to main content

M08 · Optimization

A free, illustrated L2 to L3 course of 11 modules in the Mathematics track. Modules include: Optimization problems and their geometry; Convex sets and convex functions; Gradient descent and step sizes.

M08 L2 to L3 · Intermediate to Advanced 11 modules · about 44 lessons Planned · Ring 3

Part of the Mathematics track. Ships in Ring 3 (Breadth) of the roadmap.

Modules

  1. Optimization problems and their geometry
  2. Convex sets and convex functions
  3. Gradient descent and step sizes
  4. Momentum, Nesterov and adaptive methods
  5. Newton and quasi-Newton methods
  6. Stochastic gradient descent and variance
  7. Constrained optimization and Lagrange multipliers
  8. KKT conditions and duality
  9. Linear and quadratic programming
  10. Proximal methods and non-smooth problems
  11. Non-convex landscapes: saddles, plateaus and minima

Signature illustrations

The pictures a learner should still see in their head a year later:

Optimizer paths on contour plots, convexity chord test, Lagrange tangency picture, duality gap diagram, escaping a saddle.

Status

This course is planned, not written yet. It ships with Ring 3 (Breadth).

Every lesson will follow the same twelve-part blueprint with at least three purpose-made figures. Watch the repository to hear when modules ship, or help write and review it.

Back to top