Stanford Root

Schedule

Stanford Root

Schedule

CS 205L

Continuous Mathematical Methods with an Emphasis on Machine Learning

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

A survey of numerical approaches to the continuous mathematics used throughout computer science with an emphasis on machine and deep learning. Although motivated from the standpoint of machine learning, the course will focus on the underlying mathematical methods including computational linear algebra and optimization, as well as special topics such as automatic differentiation via backward propagation, momentum methods from ordinary differential equations, CNNs, RNNs, etc. Written homework assignments and (straightforward) quizzes focus on various concepts; additionally, students can opt in to a series of programming assignments geared towards neural network creation, training, and inference. (Replaces CS 205A, and satisfies all similar requirements.) Prerequisites: Math CS 51; Math104 or MATH 113 or equivalent or comfort with the associated material.

Syllabus for selected term:
View Winter 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 1942
0 / 675 enrolled
DAYS:Tuesday, Thursday
TIME:12 PM – 1:20 PM
LOCATION:TBD
INSTRUCTOR:
Yan, Bobby, Grannen, Jennifer, Anderson, Noah, Worden, Katherine, Huh, Jinhyo+14 more
3units

CS 205L: Continuous Mathematical Methods with an Emphasis on Machine Learning

3 units · Letter or Credit/No Credit

A survey of numerical approaches to the continuous mathematics used throughout computer science with an emphasis on machine and deep learning. Although motivated from the standpoint of machine learning, the course will focus on the underlying mathematical methods including computational linear algebra and optimization, as well as special topics such as automatic differentiation via backward propagation, momentum methods from ordinary differential equations, CNNs, RNNs, etc. Written homework assignments and (straightforward) quizzes focus on various concepts; additionally, students can opt in to a series of programming assignments geared towards neural network creation, training, and inference. (Replaces CS205A, and satisfies all similar requirements.) Prerequisites: Math 51; Math104 or MATH113 or equivalent or comfort with the associated material.

Offered in Winter 2027 at Stanford University.

Winter 2027 sections

  • Lecture — Tuesday Thursday 12:00 PM – 1:20 PM — Yan, Bobby, Grannen, Jennifer, Anderson, Noah, Worden, Katherine, Huh, Jinhyo, Lyles, Nikhil, Huang, Felicity, Shu, Lei, Mancarella, Alberto, Joyner, Charles, Ocran, Kwame, Agarwal, Anshika, Bempong, Andrew, Mardin, Ismail, Birikorang, George Kojo Frimpong, Smith, Mack, Islam, Noah, Baddepudi, Anavi, Fedkiw, Ron (Graduate)

More CS courses

  • CS 198: Teaching Computer Science
  • CS 198B: Additional Topics in Teaching Computer Science
  • CS 199: Independent Work
  • CS 199P: Independent Work
  • CS 202: Law for Computer Science Professionals
  • CS 204: Computational Law
  • CS 206: Exploring Computational Journalism (COMM 281)
  • CS 210A: Industry Innovation Lab
  • CS 210B: Industry Innovation Lab
  • CS 212: Operating Systems and Systems Programming
  • CS 214: Selected Reading of Computer Science Research
  • CS 217: Hardware Accelerators for Machine Learning (EE 244)

All CS courses · All departments