🌍 Data Science · subject
Data Science Deep Learning Syllabus
The Deep Learning syllabus for Data Science in full: 6 chapters, 21 topics and 63 sub-topics, every one listed below, plus 52 Deep Learning flashcards with answers.
Deep Learning syllabus: all 6 chapters
Expand any chapter to see its topics and sub-topics.
-
Introduction to Deep Learning
2 topics- What is Deep Learning?
- Definition and Overview
- History and Evolution
- Applications in Data Science
- Neural Networks Basics
- Perceptron
- Activation Functions
- Feedforward Neural Networks
- What is Deep Learning?
-
Mathematical Foundations
4 topics- Linear Algebra
- Vectors and Matrices
- Matrix Multiplication
- Eigenvalues and Eigenvectors
- Calculus
- Derivatives and Integrals
- Partial Derivatives
- Chain Rule
- Probability and Statistics
- Probability Distributions
- Bayes' Theorem
- Statistical Measures
- Optimization Techniques
- Gradient Descent
- Stochastic Gradient Descent
- Advanced Optimization Algorithms
- Linear Algebra
-
Deep Learning Frameworks
3 topics- TensorFlow
- Introduction to TensorFlow
- Building Neural Networks with TensorFlow
- TensorFlow APIs
- PyTorch
- Introduction to PyTorch
- Building Neural Networks with PyTorch
- PyTorch APIs
- Keras
- Introduction to Keras
- Building Neural Networks with Keras
- Keras APIs
- TensorFlow
-
Types of Neural Networks
4 topics- Convolutional Neural Networks (CNNs)
- Convolution Operation
- Pooling Layers
- CNN Architectures
- Recurrent Neural Networks (RNNs)
- Recurrent Layers
- LSTM and GRU
- Applications of RNNs
- Generative Adversarial Networks (GANs)
- GAN Architecture
- Training GANs
- Applications of GANs
- Autoencoders
- Encoder-Decoder Architecture
- Variational Autoencoders
- Applications of Autoencoders
- Convolutional Neural Networks (CNNs)
-
Advanced sub-topics in Deep Learning
4 topics- Transfer Learning
- Concept of Transfer Learning
- Pre-trained Models
- Fine-Tuning
- Deep Reinforcement Learning
- Introduction to Reinforcement Learning
- Deep Q-Learning
- Policy Gradient Methods
- Natural Language Processing (NLP)
- Word Embeddings
- Sequence-to-Sequence Models
- Attention Mechanisms
- Computer Vision
- Image Classification
- Object Detection
- Image Segmentation
- Transfer Learning
-
Practical Implementation
4 topics- Data Preprocessing
- Data Cleaning
- Data Augmentation
- Feature Scaling
- Model Evaluation
- Loss Functions
- Evaluation Metrics
- Cross-Validation
- Hyperparameter Tuning
- Grid Search
- Random Search
- Bayesian Optimization
- Deployment
- Model Serialization
- Serving Models
- Monitoring and Maintenance
- Data Preprocessing
Data Science Deep Learning flashcards — 52 questions with answers
What is Deep Learning, and how does it relate to machine learning?
Deep Learning is a subfield of machine learning that uses artificial neural networks with multiple hidden layers (deep architectures) to automatically learn hierarchical feature representations from raw data, removing the need for manual feature engineering.
What distinguishes a "deep" neural network from a "shallow" one?
A deep network has two or more hidden layers between input and output, allowing it to learn hierarchical, increasingly abstract features; a shallow network typically has zero or one hidden layer.
What is an artificial neuron (perceptron), and what computation does it perform?
A unit that computes a weighted sum of its inputs plus a bias, then applies an activation function: $y = f\left(\sum_{i} w_i x_i + b\right)$.
State the ReLU activation function and one advantage it has over sigmoid.
$\mathrm{ReLU}(x) = \max(0, x)$. It mitigates the vanishing-gradient problem and is computationally cheap because its derivative is 0 or 1.
Write the sigmoid activation function and its output range.
$\sigma(x) = \dfrac{1}{1 + e^{-x}}$, with output range $(0, 1)$.
Write the softmax function for a vector of logits $z$ and state its purpose.
$\text{softmax}(z)_i = \dfrac{e^{z_i}}{\sum_{j} e^{z_j}}$. It converts logits into a probability distribution over classes that sums to 1, used in multi-class output layers.
What is the tanh activation function and its range?
$\tanh(x) = \dfrac{e^{x} - e^{-x}}{e^{x} + e^{-x}}$, with output range $(-1, 1)$; it is zero-centered, unlike sigmoid.
What is backpropagation?
An algorithm that computes gradients of the loss with respect to every network weight by applying the chain rule of calculus backward through the layers, enabling gradient-based optimization.
What is a dot product of two vectors $\vec{a}$ and $\vec{b}$, and why is it central to neural networks?
$\vec{a} \cdot \vec{b} = \sum_{i} a_i b_i$. Each neuron's pre-activation is the dot product of its weight vector and the input vector, making it the core operation in forward propagation.
What are the dimensions of the product of an $m \times n$ matrix and an $n \times p$ matrix?
$m \times p$. Matrix multiplication requires the inner dimensions ($n$) to match.
What is the identity matrix and what property does it have?
A square matrix $I$ with 1s on the main diagonal and 0s elsewhere; for any compatible matrix $A$, $AI = IA = A$.
Define the transpose of a matrix $A$.
$A^{T}$ is the matrix obtained by swapping rows and columns, so $(A^{T})_{ij} = A_{ji}$.
What are eigenvalues and eigenvectors of a matrix $A$?
A nonzero vector $\vec{v}$ is an eigenvector with eigenvalue $\lambda$ if $A\vec{v} = \lambda \vec{v}$; the matrix scales the vector without changing its direction.
What is the derivative, and what does it represent geometrically?
$f'(x) = \lim_{h \to 0} \dfrac{f(x+h) - f(x)}{h}$; it represents the instantaneous rate of change, i.e., the slope of the tangent line to the curve at $x$.
State the chain rule for $\frac{d}{dx} f(g(x))$.
$\dfrac{d}{dx} f(g(x)) = f'(g(x)) \cdot g'(x)$. It is the foundation of backpropagation.
What is a gradient $\nabla f$, and in which direction does it point?
The vector of partial derivatives $\nabla f = \left(\dfrac{\partial f}{\partial x_1}, \dots, \dfrac{\partial f}{\partial x_n}\right)$; it points in the direction of steepest increase of $f$.
What is a partial derivative $\frac{\partial f}{\partial x}$?
The derivative of a multivariable function with respect to one variable, treating all other variables as constants.
State Bayes' theorem.
$P(A \mid B) = \dfrac{P(B \mid A)\, P(A)}{P(B)}$.
What is the expected value of a discrete random variable $X$?
$E[X] = \sum_{i} x_i\, P(x_i)$, the probability-weighted average of all possible values.
Define variance and standard deviation of a random variable.
Variance $\sigma^{2} = E[(X - \mu)^{2}]$ measures spread; standard deviation $\sigma = \sqrt{\sigma^{2}}$ is its square root in the original units.
Show the other 32 Deep Learning flashcards
Write the probability density function of the normal (Gaussian) distribution.
$f(x) = \dfrac{1}{\sigma\sqrt{2\pi}} \, e^{-\frac{(x-\mu)^{2}}{2\sigma^{2}}}$.
What is cross-entropy loss for binary classification?
$L = -\big[y \log(\hat{y}) + (1 - y)\log(1 - \hat{y})\big]$, where $y$ is the true label and $\hat{y}$ the predicted probability.
Write the mean squared error (MSE) loss for $n$ samples.
$\text{MSE} = \dfrac{1}{n}\sum_{i=1}^{n} (y_i - \hat{y}_i)^{2}$.
State the gradient descent parameter update rule.
$\theta \leftarrow \theta - \eta\, \nabla_{\theta} J(\theta)$, where $\eta$ is the learning rate and $J$ the cost function.
What is the difference between batch, mini-batch, and stochastic gradient descent?
Batch GD uses the entire dataset per update; SGD uses one sample per update; mini-batch GD uses a small subset (batch) per update, balancing stability and speed.
What does the Adam optimizer combine, and why is it popular?
Adam (Adaptive Moment Estimation) combines momentum (first moment of gradients) with RMSProp-style adaptive per-parameter learning rates (second moment), giving fast, robust convergence with little tuning.
What is the role of the learning rate $\eta$, and what happens if it is too large or too small?
It scales each gradient step. Too large causes divergence or oscillation; too small causes very slow convergence and possible trapping in poor minima.
What is momentum in optimization?
A technique that accumulates an exponentially decaying moving average of past gradients to accelerate descent and dampen oscillations: $v_t = \gamma v_{t-1} + \eta \nabla J$, then $\theta \leftarrow \theta - v_t$.
What is TensorFlow, and who developed it?
TensorFlow is an open-source deep learning framework developed by Google Brain that represents computations as dataflow graphs of tensors and supports CPU/GPU/TPU execution and production deployment.
What is a tensor in the context of deep learning frameworks?
A multi-dimensional array (generalization of scalars, vectors, and matrices) that is the fundamental data structure passed through neural networks.
What is PyTorch, and what is its defining computational feature?
PyTorch is an open-source deep learning framework developed by Meta (Facebook) AI that uses dynamic computation graphs (define-by-run), making debugging and variable-length models more flexible.
What is autograd in PyTorch?
PyTorch's automatic differentiation engine that records operations on tensors with requires_grad=True and computes gradients automatically via .backward().
What is Keras, and how does it relate to TensorFlow?
Keras is a high-level neural-network API focused on ease of use; it is the official high-level API of TensorFlow (tf.keras), providing simple model-building abstractions like Sequential and Functional APIs.
Compare the default computation-graph style of TensorFlow 1.x versus PyTorch.
TensorFlow 1.x used static graphs (define-then-run, compiled before execution); PyTorch uses dynamic graphs (define-by-run, built on the fly). TensorFlow 2.x adopted eager execution by default to match this.
What is a Convolutional Neural Network (CNN) primarily used for?
A CNN is a neural network using convolutional layers to extract spatial/local features; it is primarily used for image and grid-structured data tasks such as classification, detection, and segmentation.
In a CNN, what do the convolution operation and filters/kernels do?
A filter (kernel) slides over the input computing dot products to produce a feature map, detecting local patterns like edges or textures; weight sharing reduces parameters.
What is the purpose of a pooling layer in a CNN, and name a common type.
Pooling downsamples feature maps to reduce spatial dimensions and computation while adding translation invariance; max pooling (taking the maximum in each window) is most common.
Given input size $W$, filter size $F$, padding $P$, and stride $S$, what is the output spatial size of a convolution?
$O = \dfrac{W - F + 2P}{S} + 1$.
What is a Recurrent Neural Network (RNN), and what data is it suited for?
An RNN processes sequences by maintaining a hidden state passed across time steps, $h_t = f(W_h h_{t-1} + W_x x_t + b)$, making it suited for sequential/temporal data like text, speech, and time series.
What problem do LSTMs and GRUs solve compared to vanilla RNNs?
They mitigate the vanishing/exploding gradient problem over long sequences by using gating mechanisms (e.g., LSTM's input, forget, and output gates) to control information flow and retain long-term dependencies.
Name the three gates of an LSTM cell and their roles.
Forget gate (decides what to discard from cell state), input gate (decides what new information to store), and output gate (decides what to expose as the hidden state).
What is a Generative Adversarial Network (GAN), and what are its two components?
A GAN is a generative model with two networks trained adversarially: a Generator that creates fake samples from noise, and a Discriminator that tries to distinguish real from fake; they compete in a minimax game.
Write the GAN minimax objective.
$\min_{G}\max_{D}\; \mathbb{E}_{x \sim p_{\text{data}}}[\log D(x)] + \mathbb{E}_{z \sim p_{z}}[\log(1 - D(G(z)))]$.
What is an autoencoder, and what are its two main parts?
An unsupervised neural network that learns to reconstruct its input through a bottleneck; it has an encoder that compresses input to a latent representation and a decoder that reconstructs the input from it.
How does a Variational Autoencoder (VAE) differ from a standard autoencoder?
A VAE encodes inputs into a probability distribution (mean and variance) over latent space rather than a fixed vector, enabling generative sampling; it adds a KL-divergence regularization term to the reconstruction loss.
What is Transfer Learning?
A technique that reuses a model pre-trained on a large source task as the starting point for a related target task, leveraging learned features to reduce data and training requirements.
What is fine-tuning in transfer learning, and how does it differ from feature extraction?
Fine-tuning unfreezes some/all pre-trained layers and continues training them on the new task; feature extraction freezes the pre-trained backbone and trains only a new classifier head on top.
What is Deep Reinforcement Learning?
The combination of reinforcement learning with deep neural networks, where an agent learns a policy to maximize cumulative reward by interacting with an environment, using networks to approximate value functions or policies.
State the Bellman optimality equation for the action-value function $Q$.
$Q^{*}(s, a) = \mathbb{E}\big[r + \gamma \max_{a'} Q^{*}(s', a')\big]$, where $\gamma$ is the discount factor.
What is word embedding in NLP, and name one classic method?
A learned dense vector representation of words that captures semantic and syntactic relationships in a continuous space; Word2Vec (skip-gram / CBOW) and GloVe are classic methods.
What is the attention mechanism, and write the scaled dot-product attention formula used in Transformers?
Attention lets a model weigh the relevance of different input positions when producing each output. Scaled dot-product attention: $\text{Attention}(Q, K, V) = \text{softmax}\!\left(\dfrac{QK^{T}}{\sqrt{d_k}}\right)V$.
Why is data preprocessing (normalization/standardization) important before training, and write the standardization formula.
It puts features on comparable scales, speeding and stabilizing gradient descent and preventing features with large ranges from dominating. Standardization: $x' = \dfrac{x - \mu}{\sigma}$.
Data Science Deep Learning FAQ
What is in the Data Science Deep Learning syllabus?
Data Science Deep Learning is split into 6 chapters: Introduction to Deep Learning, Mathematical Foundations, Deep Learning Frameworks, Types of Neural Networks, Advanced sub-topics in Deep Learning and Practical Implementation. Together they contain 21 topics and 63 sub-topics.
How many chapters are in Data Science Deep Learning?
6 chapters, containing 21 topics and 63 sub-topics. The largest chapter is Mathematical Foundations, with 4 topics.
Are there flashcards for Data Science Deep Learning?
Yes — a 52-card Deep Learning deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.