Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Lecture 4 Part 2: Nonlinear Root Finding, Optimization, and Adjoint Gradient Methods
Play lesson

MIT 18.S096 Matrix Calculus For Machine Learning And Beyond, IAP 2023 - Lecture 4 Part 2: Nonlinear Root Finding, Optimization, and Adjoint Gradient Methods

5.0 (0)
16 learners

What you'll learn

This course includes

  • 13.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

MIT 18.S096 Matrix Calculus For Machine Learning And Beyond, IAP 2023 Instructors: Alan Edelman, Steven G. Johnson View the complete course: https://ocw.mit.edu/courses/18-s096-matrix-calculus-for-machine-learning-and-beyond-january-iap-2023/ YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP62EaLLH92E_VCN4izBKK6OE Description: Nonlinear root finding by Newton’s method and optimization by gradient descent. “Adjoint” methods (reverse-mode/backpropagation) lets us find gradients efficiently for large-scale engineering optimization. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu Support OCW at http://ow.ly/a1If50zVRlQ We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere