0% found this document useful (0 votes)
24 views5 pages

Deep Learning Syllabus Fall 2025

Uploaded by

irasedusa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
24 views5 pages

Deep Learning Syllabus Fall 2025

Uploaded by

irasedusa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Deep Learning 25–26 Fall Syllabus

Şafak Özden

September 2025

Primary Textbooks

ˆ Simon J. D. Prince, Understanding Deep Learning (MIT Press, 2023/24, Open Access).
ˆ Ramon M.R., Deep Learning: A Practical Introduction (Wiley, 2024).
ˆ Howard J., Deep Learning for Coders with fastai and PyTorch (O’Reilly, 2020).

Course Overview

An applications-focused introduction built on UDL’s core chapters (MLPs, training, CNNs, ResNets,
unsupervised and generative models) with hands-on labs. We omit transformers, GNNs, GANs,
and normalizing flows to create room for transfer learning, YOLO, AEs/VAEs, and diffusion.

Software

Python 3.x, PyTorch, and Jupyter/Colab.

Assessment

ˆ Homework (weekly labs): 30%


ˆ Midterm (Weeks 1–7): 30%
ˆ Final project (proposal + demo/report): 40%

Course Plan (with Full Ingredients)

Week 1 – Linear Models


ˆ Linear regression: model, closed-form vs gradient descent.
ˆ Logistic regression for binary classification.
ˆ Loss functions: mean squared error, log-likelihood.
ˆ Evaluation metrics: accuracy vs loss.

1
Week 2 – Multilayer Perceptrons (MLPs)
ˆ Architecture: layers, weights, biases.
ˆ Forward propagation mechanics.
ˆ Backpropagation: gradient computation.
ˆ Activation functions: sigmoid, tanh, ReLU (brief intro).
ˆ Small toy dataset examples.

Week 3 – Neural Nets as Regression and Classification


ˆ Viewing linear/logistic regression as 1-layer neural networks.
ˆ Gradient descent and stochastic gradient descent in practice.
ˆ Batch vs mini-batch updates.
ˆ Implementation in PyTorch.
ˆ Training simple classifiers from scratch.

Week 4 – Nonlinearity and Activation


ˆ The XOR problem as motivation for nonlinearity.
ˆ Deeper networks vs shallow ones.
ˆ Activation families: sigmoid, tanh, ReLU, Leaky ReLU.
ˆ Vanishing gradient problem (early glimpse).
ˆ Hands-on: solving XOR with a small MLP.

Week 5 – Dense Neural Networks and Training Basics


ˆ Fully connected (dense) architectures: depth, width choices.
ˆ Loss functions: cross-entropy vs MSE for classification.
ˆ PyTorch training loop: forward pass, backward pass, optimizer step.
ˆ Batching and shuffling data.
ˆ MNIST classification with dense networks.
ˆ Early stopping and monitoring validation accuracy.

Week 6 – Optimization and Regularization


ˆ Overfitting vs generalization.
ˆ Regularization: weight decay (L2), dropout.
ˆ Optimizers: SGD, SGD+momentum, Adam.
ˆ Learning rate schedules and warm restarts.

2
ˆ Visualizing optimization with TensorBoard.
ˆ Comparing models with and without regularization.

Week 7 – Convolutional Neural Networks (CNNs)


ˆ Convolution operation: kernels, strides, padding.
ˆ Pooling: max pooling, average pooling.
ˆ CNN architectures: LeNet-style network.
ˆ MNIST digit recognition with CNN.
ˆ Visualizing feature maps and filters.
ˆ CNN vs dense net performance.

Week 8 – Transfer Learning and Finetuning


ˆ Concept of transfer learning and pretrained models.
ˆ ImageNet and common backbones (ResNet, VGG).
ˆ Layer freezing and unfreezing.
ˆ Fastai finetuning: discriminative learning rates.
ˆ Advanced tricks: progressive resizing, mixed precision.
ˆ Training ResNet on CIFAR-10 with GPU.

Week 9 – Object Detection (YOLO)


ˆ Detection vs classification.
ˆ Bounding boxes, anchor boxes, intersection-over-union.
ˆ YOLO architecture overview.
ˆ Custom dataset preparation.
ˆ Finetuning YOLOv5 on a small dataset.
ˆ Evaluating with mean average precision (mAP).

Week 10 – Autoencoders and Variational Autoencoders


ˆ Autoencoder structure: encoder, bottleneck, decoder.
ˆ Applications: dimensionality reduction, denoising.
ˆ Variational autoencoder: probabilistic latent space.
ˆ Reparameterization trick.
ˆ Training VAEs on MNIST.
ˆ Latent space interpolation.

3
Week 11 – Diffusion Models: Theory
ˆ Generative modeling motivation.
ˆ Forward noising process.
ˆ Reverse process intuition.
ˆ Links to VAEs and score-based models.
ˆ Equations of denoising diffusion probabilistic models.
ˆ Visualizing image degradation.

Week 12 – Diffusion Models: Practice


ˆ Implementing forward and reverse steps in PyTorch.
ˆ Training a toy diffusion model on MNIST.
ˆ Hugging Face diffusers library basics.
ˆ Sampling and denoising.
ˆ Visualizing the denoising trajectory.
ˆ Conditional vs unconditional sampling.

Week 13 – Diffusion Models: Advanced Techniques


ˆ Conditioning mechanisms (text, class labels).
ˆ Classifier guidance and classifier-free guidance.
ˆ Finetuning Stable Diffusion on custom data.
ˆ Scaling laws and compute requirements.
ˆ Evaluating generative quality: FID, qualitative inspection.
ˆ Comparing different guidance strategies.

Week 14 – Special Topic: Physics-Informed Neural Networks (PINNs)


ˆ Quick recap of ODEs and PDEs.
ˆ Using neural networks to approximate solutions.
ˆ Loss design: data loss + PDE residual loss.
ˆ Simple ODE example (u′ (x) = −u).
ˆ Extension to PDEs (e.g., 1D heat equation).
ˆ Applications in scientific computing.

4
Attendance Policy

Active participation is essential in this course, as lectures combine theoretical exposition with
hands-on coding.
ˆ Students are required to attend at least 80% of the class sessions in order to be eligible for
the final exam.
ˆ Each student may miss up to two sessions without excuse; additional absences require doc-
umented justification (e.g., medical or official reasons).
ˆ Attendance will be recorded at the beginning of each lecture.
ˆ Participation and attendance together may contribute to the final grade.

Common questions

Powered by AI

The reparameterization trick in VAEs is used to facilitate backpropagation by allowing the gradient to pass through stochastic nodes in the network. Instead of sampling directly from the learned latent distribution, the reparameterization trick expresses the distribution as a deterministic transformation of a noise vector, typically sampled from a standard normal distribution. This transformation enables the use of standard backpropagation since the gradient can now flow through the deterministic transformation rather than the stochastic node, solving the problem of non-differentiability in sample generation .

Convolution operations in CNNs apply a set of filters across the input data to extract local features, such as edges and textures, at various spatial hierarchies. Unlike fully connected networks, CNNs take advantage of spatial hierarchies by maintaining spatial information and reducing the number of parameters through weight sharing. This localized feature extraction enables CNNs to be more efficient and effective in image and pattern recognition tasks compared to fully connected networks, which treat all input units independently without considering spatial patterns .

Overfitting occurs when a neural network learns the noise in the training data rather than the underlying pattern, resulting in poor generalization to new data. Generalization refers to the model's ability to perform well on unseen data. Regularization techniques like dropout and weight decay help mitigate overfitting by discouraging complex models. Dropout randomly deactivates neurons during training, which prevents co-adaptation of hidden units, while weight decay penalizes large weights by adding a regularization term to the loss function, encouraging simpler models .

Diffusion models present an alternative approach to traditional generative methods like GANs and VAEs by introducing a gradual generative process. They work through a series of forward steps, adding noise to data in a controlled manner, and reverse steps, denoising and recreating samples. This stepwise process contrasts with GANs' adversarial training and VAEs' latent variable approximation, providing a more stable training method that avoids mode collapse, a common GAN issue. The reverse diffusion process can be seen as a gradual refinement of the image, making it particularly effective for high-quality image generation and providing flexibility in model conditioning .

Transfer learning is important in deep learning for leveraging previously learned features on large datasets, like ImageNet, to improve training efficiency and performance on new, smaller datasets. Models like ResNet and VGG, pretrained on extensive datasets, can be fine-tuned by freezing the initial layers to retain their learned features and only updating the final layers for specific tasks. This approach significantly reduces the computational resources and data required for training while improving accuracy and robustness, particularly when high-quality labeled data is limited .

Bounding boxes in the YOLO object detection system define the spatial location of detected objects in an image, and intersection-over-union (IoU) is a metric used to evaluate the overlap between the predicted and ground-truth boxes. IoU facilitates the effectiveness of YOLO by quantifying how well the model's predictions match the actual locations of objects, which is crucial for determining true positives during training and evaluation. High IoU scores indicate precise localization, thereby improving the system's accuracy in object detection tasks .

Discriminative learning rates allow for setting different learning rates for different layers within a neural network during finetuning, which is especially beneficial in transfer learning. The primary advantage is that it enables fine-tuning of the neural network more precisely by allowing early layers, which tend to learn more general features, to change less, while later layers, which learn task-specific features, adapt faster to the new data. This focused training approach helps in preserving the valuable features learned from the initial dataset while allowing for quick adaptation to the new problem, improving model efficiency and performance .

Mean average precision (mAP) is a performance metric used to evaluate object detection models by averaging precision scores across different recall levels. In the context of models like YOLO, mAP assesses the quality of detections by taking into account both the precision (accuracy of positive detections) and recall (ability to find all positive instances). mAP provides a comprehensive measure of the model's ability to accurately locate and identify objects across various categories, facilitating a more nuanced understanding of performance beyond simple accuracy metrics .

Physics-Informed Neural Networks (PINNs) play a significant role in scientific computing by embedding physics-based constraints into the training process. They use a loss design that combines data loss, which ensures agreement with empirical observations, and PDE residual loss, enforcing adherence to differential equations governing the system's physics. This integration allows PINNs to learn representations that are not only statistically sound but also physically plausible, making them powerful tools for solving complex scientific problems like PDEs in computational physics .

Activation functions in Multilayer Perceptrons introduce non-linearity by transforming the weighted sum of inputs through a non-linear function like sigmoid, tanh, or ReLU. This is critical for solving the XOR problem, which is not linearly separable. Non-linearity allows MLPs to capture complex patterns that single-layer networks cannot, enabling them to solve problems like XOR by creating boundaries that are not straight lines .

You might also like