Which algorithm is a popular choice for solving the multi-armed bandit problem when the number of arms is large and some structure can be assumed on the rewards?
- Epsilon-Greedy
- UCB1
- Thompson Sampling
- Greedy
UCB1 (Upper Confidence Bound 1) is a popular choice for the multi-armed bandit problem when you can assume some structure on the rewards and the number of arms is large. UCB1 balances exploration and exploitation effectively by using confidence bounds to select arms.
In ________ learning, the algorithm isn't provided with the correct answers but discovers them through exploration and exploitation.
- Reinforcement
- Semi-supervised
- Supervised
- Unsupervised
Reinforcement learning involves exploration and exploitation strategies, where the algorithm learns by trial and error and discovers correct answers over time. It doesn't start with pre-defined correct answers.
In the context of text classification, Naive Bayes often works well because it can handle what type of data?
- High-Dimensional and Sparse Data
- Images and Videos
- Low-Dimensional and Dense Data
- Numeric Data
Naive Bayes is effective with high-dimensional and sparse data as it assumes independence between features, making it suitable for text data with numerous attributes.
In CNNs, the ________ layer is responsible for detecting features in an image.
- Convolutional
- Pooling
- Fully Connected
- Input
The 'Convolutional' layer in a Convolutional Neural Network (CNN) is responsible for detecting features in an image using convolution operations.
Which ensemble method combines multiple decision trees and aggregates their results for improved accuracy and reduced overfitting?
- Logistic Regression
- Naive Bayes
- Principal Component Analysis (PCA)
- Random Forest
Random Forest is an ensemble method that combines multiple decision trees. It aggregates their results through techniques like bagging and boosting to achieve better accuracy and reduce overfitting. Random Forest is a popular choice for various machine learning tasks.
Imagine you're developing a model to recognize rare bird species from images. You don't have many labeled examples of these rare birds, but you have a model trained on thousands of common bird species. How might you leverage this existing model for your task?
- Fine-tuning the Pre-trained Model
- Random Initialization of Weights
- Training the Model from Scratch
- Using the Model Only for Common Bird Recognition
Fine-tuning involves taking a pre-trained model and adjusting its parameters, typically only in the final layers, to specialize it for your specific task, which is recognizing rare bird species in this case.
Which clustering method assigns data points to the nearest cluster center and recalculates the center until convergence?
- Agglomerative
- DBSCAN
- Hierarchical
- K-Means
K-Means clustering is an iterative algorithm that assigns each data point to the nearest cluster center, recalculating these centers until they converge.
t-SNE is particularly known for preserving which kind of structures from the high-dimensional data in the low-dimensional representation?
- Global Structures
- Local Structures
- Numerical Structures
- Geometric Structures
t-SNE is known for preserving local structures in the low-dimensional representation, making it effective for visualization and capturing fine-grained relationships.
If a classifier predicts the positive class perfectly but struggles with the negative class, the ________ might still be high due to the imbalance.
- AUC-ROC
- Accuracy
- F1 Score
- True Positive Rate
If a classifier predicts the positive class perfectly but struggles with the negative class, the Accuracy might still be high due to class imbalance. Accuracy can be misleading in imbalanced datasets because it doesn't account for the unequal distribution of classes. F1 Score and AUC-ROC are more robust metrics in such cases.
Which component of a GAN is responsible for generating new data samples?
- Discriminator
- Loss Function
- Optimizer
- Generator
The Generator component in a GAN is responsible for generating new data samples. It tries to create data indistinguishable from real data to deceive the Discriminator.