MIT · Mathematics & Statistics

18.065 Matrix Methods in Data Analysis, Signal Processing, and Machine Learning

Gilbert Strang · 2018 · 34 free video lectures

Linear algebra concepts are key for understanding and creating machine learning algorithms, especially as applied to deep learning and neural networks. This course reviews linear algebra with applications to probability and statistics and optimization–and above all a full explanation of deep…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1: the column space of a contains all vectors ax
  2. Lecture 2: multiplying and factoring matrices
  3. Lecture 3: orthonormal columns in q give q2019q i
  4. Lecture 4: eigenvalues and eigenvectors
  5. Lecture 5: positive definite and semidefinite matrices
  6. Lecture 6: singular value decomposition svd
  7. Lecture 7: eckart young the closest rank k matrix to a
  8. Lecture 8: norms of vectors and matrices
  9. Lecture 9: four ways to solve least squares problems
  10. Lecture 10: survey of difficulties with ax b
  11. Lecture 11: minimizing 2016x2016 subject to ax b
  12. Lecture 12: computing eigenvalues and singular values
  13. Lecture 13: randomized matrix multiplication
  14. Lecture 14: low rank changes in a and its inverse
  15. Lecture 15: matrices a t depending on t derivative da dt
  16. Lecture 16: derivatives of inverse and singular values
  17. Lecture 17: rapidly decreasing singular values
  18. Lecture 18: counting parameters in svd lu qr saddle points
  19. Lecture 19: saddle points continued maxmin principle
  20. Lecture 20: definitions and inequalities
  21. Lecture 21: minimizing a function step by step
  22. Lecture 22: gradient descent downhill to a minimum
  23. Lecture 23: accelerating gradient descent use momentum
  24. Lecture 24: linear programming and two person games
  25. Lecture 25: stochastic gradient descent
  26. Lecture 26: structure of neural nets for deep learning
  27. Lecture 27: backpropagation find partial derivatives
  28. Lecture 30: completing a rank one matrix circulants
  29. Lecture 31: eigenvectors of circulant matrices fourier matrix
  30. Lecture 32: imagenet is a cnn the convolution rule
  31. Lecture 33: neural nets and the learning function
  32. Lecture 34: distance matrices procrustes problem first project
  33. Lecture 35: finding clusters in graphs second project handwriting
  34. Lecture 36: third project alan edelman and julia language

From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights