Deep Learning
From multi-layer perceptrons to transformers, large language models and diffusion models.
Overview
This course covers the foundations of deep learning and the modern architectures behind today’s AI systems. It starts with multi-layer networks, back-propagation, optimization and generalization, then studies convolutional networks for vision, recurrent networks and attention, and the Transformer. The second half covers large language models, state-space models, deep generative models (VAEs, GANs and diffusion models), self-supervised learning and image–text foundation models.
Homeworks combine theoretical problems with practical notebooks in Python and PyTorch. TA workshops on PyTorch, parameter-efficient fine-tuning (PEFT) and multi-modal models complement the lectures.
Topics
- Foundations: MLPs, universal approximation, back-propagation, optimization, generalization, training techniques
- Vision: convolutional networks, CNN architectures and visualization, segmentation and detection
- Sequences: RNNs and LSTMs, word embeddings and language modeling, attention and Transformers (BERT, T5, GPT, ViT)
- Large language models: adapting LLMs to new tasks, from LLMs to assistants; state-space models (Mamba)
- Generative models: VAEs, GANs, diffusion models
- Representation learning: self-supervised learning, image–text models (CLIP, DALL·E)
Instructors & Teaching Assistants
Teaching assistants
Schedule & Materials
The schedule is tentative and may change. Slides and recordings are posted after each session.
| # | Date | Topic | Materials |
|---|---|---|---|
| 1 | Sat Feb 212 Esfand | Introduction to Deep Learning & ML Review | |
| 2 | Mon Feb 234 Esfand | MLP I: Neural Networks & Universal Approximation | |
| 3 | Sat Apr 415 Farvardin | MLP II: Training Neural Networks & Back-Propagation | |
| 4 | Sat Apr 1122 Farvardin | Optimization I | |
| 5 | Mon Apr 1324 Farvardin | Optimization II | |
| 6 | Sat Apr 1829 Farvardin | Generalization | |
| 7 | Mon Apr 2031 Farvardin | Training Techniques: Practical Issues | |
| 8 | Sat Apr 255 Ordibehesht | Convolutional Neural Networks (CNNs) | |
| 9 | Mon Apr 277 Ordibehesht |
CNN Architectures & Visualization
Quiz 1 (lectures 1–6) |
|
| 10 | Sat May 212 Ordibehesht |
CNNs in Vision Problems
Segmentation, object detection, … |
|
| 11 | Mon May 414 Ordibehesht | RNN I: Recurrent Networks & LSTM | |
| 12 | Sat May 919 Ordibehesht | RNN II: Word Embeddings & Language Modeling | |
| 13 | Mon May 1121 Ordibehesht | Attention & Transformers I | |
| 14 | Sat May 1626 Ordibehesht |
Transformers II: BERT, T5, GPT, ViT
Quiz 2 (lectures 7–12) |
|
| 15 | Mon May 1828 Ordibehesht | Large Language Models I: Adapting to New Tasks | |
| 16 | Sat May 232 Khordad | Large Language Models II: From LLMs to Assistants | |
| 17 | Mon May 254 Khordad | Large Language Models III | |
| 18 | Sat May 309 Khordad |
Recent State-Space Models (Mamba)
Quiz 3 (lectures 13–16) |
|
| 19 | Mon Jun 111 Khordad | Generative Models I: FVBN & VAE | |
| Sat Jun 616 Khordad | Exam Midterm exam | ||
| 20 | Mon Jun 818 Khordad | Generative Models II: GANs | |
| 21 | Sat Jun 1323 Khordad | Generative Models III: Diffusion Models | |
| 22 | Mon Jun 1525 Khordad | Generative Models IV: Diffusion Models | |
| 23 | Sat Jun 2030 Khordad | Generative Models V: Diffusion Models | |
| 24 | Mon Jun 221 Tir |
Self-Supervised Learning
Pretext tasks, contrastive learning |
|
| 25 | Sat Jun 276 Tir |
Image–Text Foundation Models: CLIP
Quiz 4 (lectures 19–23) |
|
| 26 | Mon Jun 298 Tir | Text-to-Image Foundation Models: DALL·E, … | |
| 27 | — | Graph Neural Networks (GNNs) | |
| 28 | — | Understanding Deep Networks I | |
| 29 | — | Understanding Deep Networks II | |
| Sat Jul 1827 Tir | Exam Final exam |
Assignments & Exams
| Title | Released | Due | Weight | Materials |
|---|---|---|---|---|
|
Homework
HW1: Neural networks from scratch & optimization
PyTorch basics, implementing a neural network from scratch, optimization methods; plus theoretical problems. |
Apr 19 | May 8, 23:59 | — | |
|
Homework
HW2: CNNs & RNNs
Emoji classification, CAPTCHA segmentation, implementing an RNN; plus theoretical problems. |
May 9 | May 29, 23:59 | — | |
|
Homework
HW3: Large language models
Parameter-efficient fine-tuning, inference techniques, retrieval-augmented generation (RAG); plus theoretical problems. |
May 30 | Jun 12, 23:59 | — | |
|
Homework
HW4: Generative models
VAE, DDPM and VQ-VAE; plus theoretical problems. |
Jun 13 | Jun 30, 23:59 | — | |
|
Homework
HW5: Self-supervised & multi-modal models
SimCLR, analysing CLIP, diffusion-based image editing. Theoretical part due Jul 7; practical part due Jul 22. |
Jul 1 | Jul 22, 23:59 | — | |
|
Quiz
Quiz 1
Lectures 1–6. |
— | Apr 27 | — | |
|
Quiz
Quiz 2
Lectures 7–12. |
— | May 16 | — | |
|
Quiz
Quiz 3
Lectures 13–16. |
— | May 30 | — | |
|
Quiz
Quiz 4
Lectures 19–23. |
— | Jun 27 | — | |
| Midterm exam Midterm exam | — | Jun 6 | 4 / 20 | |
| Final exam Final exam | — | Jul 18 | 6 / 20 |
Resources
Related courses
- CS231n: Deep Learning for Computer Vision , Stanford University Many of the slides are adapted from this course.
- 11-785: Introduction to Deep Learning , Carnegie Mellon University Many of the slides are adapted from this course.
- CS224n: Natural Language Processing with Deep Learning , Stanford University Many of the slides are adapted from this course.
Grading & Policies
Grading
| Component | Points (out of 20) |
|---|---|
| Homeworks | 8 (+1 bonus) |
| Quizzes | 2 |
| Midterm exam | 4 |
| Final exam | 6 |
| Total | 20 (+1 bonus) |
Homeworks do not necessarily carry equal weight; each one’s share depends on its importance. With the homework bonus points, the total can exceed 20.
Course policies
- Announcements and questions: all announcements are posted on Quera; check it regularly. Ask your questions about the course and the homeworks on Quera as well.
- Quera invitations are sent to the email you registered with the university. If you have not received one by the end of the add/drop period, email the head TA with your name and student number.
- Session feedback: a short feedback form (QR code) is shared in each session. Filling it in earns a small bonus.
- Programming: homeworks are done in Python, using PyTorch.
- Late days: you have 8 free late days in total for the homeworks; this cannot be extended. The maximum lateness for each homework is stated in the homework. It may be shorter for homeworks just before an exam, since their solutions must be released in time.
- Late penalty: after the free late days are used, a penalty of 0.5% per hour applies. Lateness is not counted linearly: a submission between 1 AM and 12 noon counts as submitted at noon, so staying up late does not save late time. Free late days are distributed across homeworks so as to minimize your penalty.
- Deadlines are firm. Homework workload is designed for the given time, so please do not ask for extensions; plan early and use your late days wisely.
- Submission is through Quera. Practical homeworks also have an in-person delivery session.
- Academic integrity: enrolling in the course means accepting the homework honor code and the code of conduct for using AI tools (part B). Cheating, including copying code or answers from other students or online sources, is dealt with through the strictest formal procedures.
- Special circumstances: if you face special difficulties during the term, discuss them with the instructor or the head TA when they happen.
- Workshops and TA sessions cover prerequisites for the homeworks and topics beyond the lectures. If you need an extra problem-solving session, ask the instructor or the head TA.
- Office hours: the instructor and the TAs hold weekly office hours (with prior arrangement). Bring ideas, research questions and general questions to the instructor; ask detailed questions about the material or methods from the TAs.
- Bonus practical exercises can also be submitted at the end of the term, after the final exams, at half weight.
Last updated October 12, 2026.