🌍 Machine Learning · flashcards

Machine Learning Deep Learning and Neural Network Flashcards

50 question-and-answer cards covering Deep Learning and Neural Network as it is examined in Machine Learning. 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.

50Cards in deck
24Free preview
13Syllabus topics
~186Chars per answer
FreePrice

24 sample cards from the Deep Learning and Neural Network deck

Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.

  1. 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.

  2. 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).

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

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

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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).

  19. 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.

  20. 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.

  21. 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.

  22. 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.

  23. 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.

  24. 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.

What this deck covers

The Deep Learning and Neural Network deck follows the Machine Learning Deep Learning and Neural Network syllabus — 6 chapters and 13 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 8.3 cards per chapter.

Answers are written to be recallable, not just readable — averaging about 186 characters, which is long enough to carry the reasoning and short enough to say out loud.

A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.

Deep Learning and Neural Network flashcards FAQ

How many Deep Learning and Neural Network flashcards are in this Machine Learning deck?

50 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.

Are these Machine Learning flashcards free?

Yes. The preview here is free to read with no signup, and the full 50-card deck is free inside the Examius app.

What do the Deep Learning and Neural Network cards cover?

They follow the Machine Learning Deep Learning and Neural Network syllabus — 6 chapters and 13 topics — so the questions track what is actually examinable.

How should I use these flashcards?

Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.