🌍 Machine Learning · subject

Machine Learning Deep Learning and Neural Network Syllabus

The Deep Learning and Neural Network syllabus for Machine Learning in full: 6 chapters, 13 topics and 39 sub-topics, every one listed below, plus 50 Deep Learning and Neural Network flashcards with answers.

6Chapters
13Topics
39Sub-topics
50Flashcards

Deep Learning and Neural Network syllabus: all 6 chapters

Expand any chapter to see its topics and sub-topics.

  1. Introduction to Deep Learning

    1 topic
    • Overview of Deep Learning
      • Definition and History
      • Difference Between Machine Learning and Deep Learning
      • Applications of Deep Learning
  2. Introduction to Neural Networks

    overview

    No separate topics listed for this chapter.

  3. Neural Networks

    3 topics
    • Basic Concepts
      • Perceptron
      • Activation Functions
      • Feedforward Neural Networks
    • Training Neural Networks
      • Loss Functions
      • Gradient Descent
      • Backpropagation
    • Improving Neural Networks
      • Regularization Techniques
      • Optimization Algorithms
      • Hyperparameter Tuning
  4. Deep Learning Architectures

    3 topics
    • Convolutional Neural Networks (CNNs)
      • Convolutional Layers
      • Pooling Layers
      • Applications of CNNs
    • Recurrent Neural Networks (RNNs)
      • Recurrent Layers
      • Long Short-Term Memory (LSTM)
      • Gated Recurrent Unit (GRU)
    • Generative Adversarial Networks (GANs)
      • Generator and Discriminator
      • Training GANs
      • Applications of GANs
  5. Advanced Topics in Deep Learning

    3 topics
    • Transfer Learning
      • Pre-trained Models
      • Fine-tuning
      • Applications of Transfer Learning
    • Reinforcement Learning
      • Markov Decision Process
      • Q-Learning
      • Deep Q-Networks (DQN)
    • Natural Language Processing (NLP)
      • Word Embeddings
      • Sequence-to-Sequence Models
      • Transformers
  6. Practical Implementation

    3 topics
    • Deep Learning Frameworks
      • TensorFlow
      • PyTorch
      • Keras
    • Model Deployment
      • Saving and Loading Models
      • Serving Models
      • Scalability and Performance
    • Case Studies and Projects
      • Image Classification
      • Natural Language Processing
      • Reinforcement Learning Projects

Machine Learning Deep Learning and Neural Network flashcards — 50 questions with answers

  1. 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, rather than relying on hand-engineered features.

  2. What is the universal approximation theorem?

    It states that a feedforward neural network with a single hidden layer containing a finite number of neurons and a non-linear activation can approximate any continuous function on a compact subset of $\mathbb{R}^{n}$ to arbitrary accuracy, given enough hidden units.

  3. Write the equation for a single artificial neuron's output (forward computation).

    $$y = \phi\left(\sum_{i=1}^{n} w_{i} x_{i} + b\right) = \phi(\vec{w}^{\top}\vec{x} + b)$$ where $\phi$ is the activation function, $\vec{w}$ the weights, $\vec{x}$ the inputs, and $b$ the bias.

  4. Define the sigmoid activation function and its output range.

    $$\sigma(x) = \frac{1}{1 + e^{-x}}$$ Its output lies in the range $(0, 1)$, making it useful for representing probabilities.

  5. Define the hyperbolic tangent (tanh) activation function and its range.

    $$\tanh(x) = \frac{e^{x} - e^{-x}}{e^{x} + e^{-x}}$$ Its output range is $(-1, 1)$, and it is zero-centered, unlike the sigmoid.

  6. Define the ReLU activation function and state one key advantage.

    $$\text{ReLU}(x) = \max(0, x)$$ It mitigates the vanishing gradient problem for positive inputs and is computationally cheap, which speeds up training.

  7. What problem does Leaky ReLU solve, and what is its formula?

    It addresses the 'dying ReLU' problem where neurons output zero permanently. $$\text{LeakyReLU}(x) = \begin{cases} x & x > 0 \\ \alpha x & x \leq 0 \end{cases}$$ with a small constant such as $\alpha = 0.01$.

  8. Write the softmax function used for multi-class classification output.

    $$\text{softmax}(z_{i}) = \frac{e^{z_{i}}}{\sum_{j=1}^{K} e^{z_{j}}}$$ It converts a vector of $K$ logits into a probability distribution summing to $1$.

  9. What is the cross-entropy loss for multi-class classification?

    $$L = -\sum_{i=1}^{K} y_{i} \log(\hat{y}_{i})$$ where $y_{i}$ is the true (one-hot) label and $\hat{y}_{i}$ the predicted probability for class $i$.

  10. Write the mean squared error (MSE) loss formula used in regression.

    $$\text{MSE} = \frac{1}{n}\sum_{i=1}^{n}(y_{i} - \hat{y}_{i})^{2}$$ where $y_{i}$ is the true value and $\hat{y}_{i}$ the prediction.

  11. What is backpropagation?

    An algorithm that computes gradients of the loss with respect to every weight by applying the chain rule of calculus backward through the network, layer by layer, enabling gradient-based optimization.

  12. State the gradient descent weight update rule.

    $$w \leftarrow w - \eta \frac{\partial L}{\partial w}$$ where $\eta$ is the learning rate and $\frac{\partial L}{\partial w}$ the gradient of the loss with respect to the weight.

  13. Compare batch, stochastic, and mini-batch gradient descent.

    Batch GD uses the entire dataset per update (stable but slow); Stochastic GD (SGD) uses one sample per update (noisy, fast); Mini-batch GD uses a small subset (e.g. 32-256 samples), balancing efficiency and stability.

  14. What is the role of the learning rate $\eta$, and what happens if it is too large or too small?

    It controls step size in parameter updates. Too large causes divergence or oscillation around the minimum; too small causes very slow convergence and risk of getting stuck.

  15. Describe the momentum optimization update.

    $$v_{t} = \gamma v_{t-1} + \eta \nabla L, \qquad w \leftarrow w - v_{t}$$ Momentum accumulates a velocity term (typically $\gamma = 0.9$) to accelerate descent in consistent directions and dampen oscillations.

  16. What is the Adam optimizer and what does it combine?

    Adam (Adaptive Moment Estimation) combines momentum (first moment of gradients) and RMSProp (second moment / adaptive per-parameter learning rates), using bias-corrected estimates $\hat{m}_{t}$ and $\hat{v}_{t}$ for the update $w \leftarrow w - \eta \frac{\hat{m}_{t}}{\sqrt{\hat{v}_{t}} + \epsilon}$.

  17. What is the vanishing gradient problem?

    In deep networks, gradients shrink exponentially as they propagate backward through many layers (especially with sigmoid/tanh), so early layers learn extremely slowly or not at all.

  18. What is the exploding gradient problem and one common remedy?

    Gradients grow exponentially during backpropagation, causing unstable, divergent updates. A common remedy is gradient clipping, which rescales gradients when their norm exceeds a threshold.

  19. Distinguish overfitting from underfitting.

    Overfitting: model fits training data too closely (low train error, high test error) capturing noise. Underfitting: model is too simple to capture the underlying pattern (high train and test error).

  20. How does L2 regularization modify the loss, and what is its effect?

    $$L_{\text{total}} = L + \lambda \sum_{i} w_{i}^{2}$$ It penalizes large weights (weight decay), encouraging smaller weights and reducing overfitting; $\lambda$ controls regularization strength.

Show the other 30 Deep Learning and Neural Network flashcards
  1. What is the difference between L1 and L2 regularization?

    L1 ($\lambda \sum |w_{i}|$) promotes sparsity, driving some weights exactly to zero (feature selection); L2 ($\lambda \sum w_{i}^{2}$) shrinks weights smoothly toward zero without making them exactly zero.

  2. What is dropout and why does it reduce overfitting?

    Dropout randomly deactivates a fraction $p$ of neurons during each training step, preventing co-adaptation of features and acting like training an ensemble of subnetworks, which improves generalization.

  3. What is batch normalization and what are its benefits?

    It normalizes layer inputs per mini-batch to zero mean and unit variance, then scales/shifts with learnable parameters $\gamma$ and $\beta$. Benefits: faster, more stable training, higher learning rates, and mild regularization.

  4. What is early stopping?

    A regularization technique that halts training when validation performance stops improving (begins to degrade), preventing the model from overfitting the training data.

  5. What is the purpose of a convolutional layer in a CNN?

    It applies learnable filters (kernels) that slide across the input to detect local spatial features (edges, textures, shapes) while sharing weights, drastically reducing parameters and exploiting spatial locality.

  6. Give the output size formula for a convolution layer.

    $$O = \left\lfloor \frac{W - F + 2P}{S} \right\rfloor + 1$$ where $W$ is input size, $F$ filter size, $P$ padding, and $S$ stride.

  7. What is the role of a pooling layer (e.g. max pooling) in a CNN?

    Pooling downsamples feature maps to reduce spatial dimensions and computation, provides translation invariance, and controls overfitting. Max pooling outputs the maximum value within each window.

  8. What are the two key properties that make CNNs efficient for images?

    Parameter sharing (the same filter is reused across all spatial positions) and local connectivity / sparse interactions (each neuron connects only to a local receptive field).

  9. What is a recurrent neural network (RNN) designed for?

    RNNs process sequential data by maintaining a hidden state that carries information across time steps, making them suited for time series, text, and speech where order matters.

  10. Write the basic RNN hidden state update equation.

    $$h_{t} = \phi(W_{hh} h_{t-1} + W_{xh} x_{t} + b)$$ where $h_{t}$ is the hidden state at time $t$, $x_{t}$ the input, and $\phi$ a non-linear activation.

  11. Why do vanilla RNNs struggle with long-term dependencies?

    Repeated multiplication during backpropagation through time causes gradients to vanish or explode, so the network cannot retain information across long sequences.

  12. What problem do LSTMs solve and what are their three gates?

    LSTMs solve the long-term dependency / vanishing gradient problem using a cell state and three gates: the forget gate, input gate, and output gate, which regulate information flow over time.

  13. How does a GRU differ from an LSTM?

    A GRU (Gated Recurrent Unit) uses two gates (reset and update) and merges the cell and hidden state, making it simpler and faster with fewer parameters, often achieving comparable performance to LSTMs.

  14. What is a Generative Adversarial Network (GAN) composed of?

    A GAN consists of two networks trained adversarially: a Generator $G$ that creates fake samples from noise, and a Discriminator $D$ that tries to distinguish real from fake samples.

  15. 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)))]$$

  16. What is mode collapse in GANs?

    A failure mode where the generator produces only a limited variety of outputs (or a single output) that fool the discriminator, failing to capture the full diversity of the real data distribution.

  17. What is transfer learning?

    A technique that reuses a model pre-trained on a large source task as a starting point for a related target task, transferring learned features to reduce data and training requirements.

  18. What is fine-tuning in the context of transfer learning?

    Taking a pre-trained network and continuing training (all or some layers) on the new target dataset, usually with a small learning rate, to adapt the learned features to the new task.

  19. When freezing layers in transfer learning, which layers are typically frozen and why?

    Early/lower layers are frozen because they capture generic features (edges, textures) transferable across tasks, while later layers are retrained to learn task-specific high-level features.

  20. What is reinforcement learning?

    A learning paradigm where an agent learns to take actions in an environment to maximize cumulative reward through trial-and-error interaction, guided by a reward signal rather than labeled data.

  21. Define the return (discounted cumulative reward) in reinforcement learning.

    $$G_{t} = \sum_{k=0}^{\infty} \gamma^{k} r_{t+k+1}$$ where $\gamma \in [0,1]$ is the discount factor weighting future rewards.

  22. Write the Q-learning update rule.

    $$Q(s,a) \leftarrow Q(s,a) + \alpha\left[r + \gamma \max_{a'} Q(s',a') - Q(s,a)\right]$$ where $\alpha$ is the learning rate and $\gamma$ the discount factor.

  23. What is the exploration-exploitation tradeoff?

    The dilemma between exploiting known high-reward actions to maximize immediate reward versus exploring new actions to discover potentially better long-term strategies; often balanced with an $\epsilon$-greedy policy.

  24. What is a word embedding in NLP?

    A dense, low-dimensional vector representation of a word that captures semantic and syntactic relationships, so that similar words have nearby vectors (e.g. Word2Vec, GloVe).

  25. What is the attention mechanism's core idea?

    It lets a model dynamically weight the relevance of different input elements when producing each output, computing a weighted sum of values based on query-key similarity rather than treating all inputs equally.

  26. Write the scaled dot-product attention formula used in Transformers.

    $$\text{Attention}(Q,K,V) = \text{softmax}\!\left(\frac{QK^{\top}}{\sqrt{d_{k}}}\right)V$$ where $Q$, $K$, $V$ are query, key, value matrices and $d_{k}$ the key dimension.

  27. What architectural innovation defines the Transformer, and why is it advantageous over RNNs?

    The Transformer relies entirely on self-attention (no recurrence), enabling full parallelization across sequence positions and better capture of long-range dependencies than sequential RNNs.

  28. Compare TensorFlow and PyTorch in terms of computation graphs.

    PyTorch uses dynamic (define-by-run) computation graphs built on the fly, favored for research flexibility; TensorFlow historically used static graphs (define-then-run) for deployment efficiency, though TF 2.x added eager execution.

  29. What are common challenges and techniques in deploying deep learning models to production?

    Challenges include latency, model size, and resource limits. Techniques: quantization (reduce numeric precision), pruning (remove redundant weights), knowledge distillation (train a smaller student model), and serving via formats like ONNX or TensorFlow Serving.

  30. In an image classification case study, why is data augmentation used and give examples?

    Data augmentation artificially expands the training set and improves generalization/robustness by applying label-preserving transformations such as rotation, flipping, cropping, scaling, and color jittering to input images.

Machine Learning Deep Learning and Neural Network FAQ

What is in the Machine Learning Deep Learning and Neural Network syllabus?

Machine Learning Deep Learning and Neural Network is split into 6 chapters: Introduction to Deep Learning, Introduction to Neural Networks, Neural Networks, Deep Learning Architectures, Advanced Topics in Deep Learning and Practical Implementation. Together they contain 13 topics and 39 sub-topics.

How many chapters are in Machine Learning Deep Learning and Neural Network?

6 chapters, containing 13 topics and 39 sub-topics. The largest chapter is Neural Networks, with 3 topics.

Are there flashcards for Machine Learning Deep Learning and Neural Network?

Yes — a 50-card Deep Learning and Neural Network 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.