Practice
1. Which dimensionality reduction technique is most suitable for visualizing high-dimensional data while preserving local structures?
easy
Solution
Step 1: Understand the purpose of each technique
PCA is used for linear dimensionality reduction, UMAP is similar to t-SNE but faster, and LDA is for supervised dimensionality reduction.Step 2: Identify the technique that preserves local structures
t-SNE is specifically designed to preserve local structures in high-dimensional data.Final Answer:
Option A -> Option AQuick Check:
t-SNE for local structures [OK]
Hint: t-SNE for local structures [OK]
Common Mistakes:
2. In the context of Graph Neural Networks, which component is primarily responsible for aggregating information from neighboring nodes?
easy
Solution
Step 1: Identify the role of each component
The message passing mechanism is designed to aggregate information from neighboring nodes in a graph.Step 2: Eliminate wrong options
Activation functions, dropout layers, and batch normalization do not specifically aggregate information from neighboring nodes.Final Answer:
Option C -> Option CQuick Check:
Message passing aggregates neighbor info in GNNs. [check]
Hint: Message passing aggregates neighbor info in GNNs. [check]
Common Mistakes:
3. In the context of data collection for machine learning, which scenario best describes an offline data collection approach?
easy
Solution
Step 1: Identify offline data collection characteristics
Offline data collection involves gathering data that has already been generated and stored, not in real-time.Step 2: Eliminate real-time options
Options A, C, and D involve real-time or near-real-time data collection, which is characteristic of online data collection.Final Answer:
Option D -> Option DQuick Check:
Offline = historical, stored data. [OK]
Hint: Offline = historical, stored data. [OK]
Common Mistakes:
4. Given the following Python code snippet, what will be the output when calculating the Euclidean distance between two high-dimensional points?
import numpy as np
point1 = np.array([1, 2, 3, ..., 1000])
point2 = np.array([2, 3, 4, ..., 1001])
distance = np.linalg.norm(point1 - point2)
print(distance)easy
Solution
Step 1: Calculate the difference between points.
The difference is [1, 1, 1, ..., 1].Step 2: Calculate the Euclidean distance.
The distance is sqrt(1000) = 31.62.Final Answer:
Option D -> Option DQuick Check:
Euclidean distance in high dimensions is sqrt(n). [OK]
Hint: Euclidean distance in high dimensions is sqrt(n). [OK]
Common Mistakes:
5. You need to label a large dataset for a new domain with minimal existing labeled data. Which strategy should you apply and why?
hard
Solution
Step 1: Understand the domain challenge.
New domains often lack labeled data, making programmatic labeling a flexible choice.Step 2: Evaluate other strategies.
Human annotation is accurate but slow. Weak supervision requires existing data sources, which may not be available. Active learning still requires some initial labeled data.Final Answer:
Option C -> Option CQuick Check:
New domain = Programmatic Labeling [OK]
Hint: New domain = Programmatic Labeling [OK]
Common Mistakes:
