Numerical Methods for Machine Learning: Course Notes

Joe McEwen and Jesse Loi

version 0.2 (the typo edition) 2025

Help! This is an early version of the notes, if you find an error, please let us know. Thank you.

• 1. What is this?
• 2. Guidance
  • 2.1. Do You Want a Job?
  • 2.2. Good Coding
  • 2.3. Psuedo Code Exercise
• 3. Array Basics
  • 3.1. Arrays in Numpy
  • 3.2. Broadcasting Examples
  • 3.3. Dot Product
  • 3.4. Matrix Multiplication
  • 3.5. Solving Systems of Equations
  • 3.6. Should You Directly Invert a Matrix in Numerical Methods? (Hint: almost always No)
  • 3.7. Inversion for \(3\times3\) Matrices
• 4. Differential Calculus
  • 4.1. Single Variable Calculus
  • 4.2. Multivariable Calculus
  • 4.3. Automatic Differentiation with Jax
  • 4.4. Derivatives, a Helpful Lesson
• 5. Matrices
  • 5.1. Transpose, Inverse, and Norm
  • 5.2. Linear Transformations
  • 5.3. Matrix Determinant
  • 5.4. Orthogonal Matrix (Unitary for Real Matrices)
  • 5.5. Matrix Rank
  • 5.6. Matrix Condition Number
  • 5.7. EigenValues and Principle Component Analysis
  • 5.8. Matrix Factorization Methods
  • 5.9. SVD and PCA
• 6. Numerical Optimization
  • 6.1. Introduction to Optimization via Linear Regression
  • 6.2. Convex Functions and Optimization
  • 6.3. The Nelder-Mead Algorithm, Downhill Simplex, or the Amoeba
  • 6.4. Particle Swarm and the Eggholder Challenge
  • 6.5. Newton’s method for Root Finding
  • 6.6. Newton’s Method for Optimization
  • 6.7. Logistic Regression with Newton’s Method via Jax (Assignment)
  • 6.8. Introduction to Gradient Descent
  • 6.9. Gradient Descent in 1-Dimension