02-02Notes
A working library of the mathematics behind the analysis.
524 notes in 7 areas, from notation to machine learning. Each takes one formula: what it says, a small worked example, and code that runs. Revised in place. Page 10 of 22.
IndexAll notes
02-02-217Vector representation02-02-218Zero Vector02-02-219Adam Optimizer (first moment)02-02-220Adam Optimizer (parameter update)02-02-221Adam Optimizer (second moment)02-02-222Learning-Rate Schedules02-02-223Momentum (SGD with momentum)02-02-224Stochastic Gradient Descent (SGD)02-02-225Conjugate dual mapping02-02-226Lagrangian Formulation02-02-227Saddle-Point Min-Max duality02-02-228Convex Conjugate (Legendre-Fenchel transformation)02-02-229Convex Function (Definition)02-02-230Convex Set02-02-231Operations preserving convexity02-02-232Gradient Descent with Momentum (Update Rule)02-02-233Learning Rate (step size)02-02-234Objective02-02-235Saddle Points in Loss Landscapes02-02-236Update Rule02-02-237Floating-Point Precision02-02-238Gradient Clipping02-02-239Log-Sum-Exp Trick (prevents underflowoverflow)02-02-240Mixed Precision Training