CS 462: Introduction to Deep Learning

Spring 2026.

Description

As stated on the department website:

This is an introductory course to deep learning. The course will cover theories, principles, and practices of traditional neural networks and modern deep learning. The topics of the course can be split into four sections: (1) Fundamentals of Machine Learning, (2) Neural Networks, (3) Modern Deep Learning, and (4) Applications and Advanced Topics.

Details

Course material will be posted on the course website.

The course text book is “Understanding Deep Learning” by Simon J. D. Prince (udlbook.com).

This course will cover a large swathe of deep learning, corresponding to the first 15 chapters of the book (although topics may be adjusted to better fit the students’ preparedness for the topics). The list of topics is, in a rough summary, the principles of training deep networks (chapters 1-9), convolutional networks (chapter 10), residual networks (chapter 11), transformers (chapter 12), graph neural networks (chapter 13), unsupervised learning (chapter 14), and generative adversarial networks (chapter 15). The list of topics are somewhat aspirational; if more preparation is needed to better cover some fundamentals then not every topic will be reached.

Course Overview

Deep learning is an incredibly approachable field, with tools, datasets, and tutorials widely available. This tricks many people into believing that it is an easy topic to grasp and put into practice. It is not. The pitfalls are plentiful, and mistakes are often made in the very first steps.

This course aims to prepare students to put deep learning into practice by teaching the fundamentals of deep learning. Truly practicing deep learning requires millions of training samples and weeks of time, so an extensive grasp of the topic is beyond reach of this course. This course is an introduction, hence the word appears in the name. However, a proper grasp of the fundamentals is required to advance in this field. This course will prepare students to apply deep learning and will forewarn them of both weaknesses and solutions.

Evaluation

Implementation is an important component of the course, so 40% of the course grade will be based upon individual assignments. Recitation work is meant to prepare students for assignments and examinations, and may consist of shorter quizzes and in-recitation work.

Month Lecture Topic Exams and Assignment Starts
January 20 Tuesday L1 Introduction
22 Thursday (miss)
27 Tuesday L2 Supervised Learning
29 Thursday L3 Shallow Neural Nets HW1: Load and multiply matrices (mini HW)
February 3 Tuesday L4 Deeper Neural Nets
5 Thursday L5 Loss Functions Quiz 1
10 Tuesday L6 Model Fitting
12 Thursday L7 Computing Gradients HW2: Bad Apple HW (with linear nets, will involve cross validation type approaches)
17 Tuesday L8 Initialization
19 Thursday L9 Performance Quiz 2
24 Tuesday L10 Simple Regularization
26 Thursday L11 Convnets HW3: Load and multiply convnet weights (mini HW)
March 3 Tuesday L12 ConvNets
5 Thursday Midterm (in class)
10 Tuesday L13 Advanced convnets
12 Thursday L14 Advanced convents HW4: Convnet Bad Apples
24 Tuesday L15 Transformers
26 Thursday L16 Transformers HW5: Feature Highlighting
31 Tuesday L17 Transformers
April 2 Thursday L18 Unsupervised Quiz 3
7 Tuesday L19 Unsupervised
9 Thursday L20 Unsupervised HW6: Pruning
14 Tuesday L21 Generators
16 Thursday L22 Generators Quiz 4
21 Tuesday L23 Advanced Regularization
23 Thursday L24 Modern Architectures HW7: Digit Generation
28 Tuesday L25 Modern Architectures
30 Thursday L26 Modern Architectures
May 12 Tuesday Final 12:00 - 3:00 PM

The homeworks are meant to solidify understanding of key concepts and are not intended to be excessively complicated. Some of them will quite simple, so don’t be intimidated by the number of assignments.

Quizzes will be mostly multiple choice questions. Their primary purpose is to give feedback on your current mastery rather than to finalize your score in the class. Full credit will be awarded at 50% and above, and 50% credit will be awarded if any questions are correct.