A) Offers a balance between the efficiency of batch GD and the robustness of SGD. B) Does not require a loss function. C) Is guaranteed to converge faster than any other method. D) Is only applicable to linear models.
A) Training a model from scratch on every new problem. B) Forgetting everything a model has learned. C) Taking a model pre-trained on a large dataset (e.g., ImageNet) and fine-tuning it for a new, specific task with a smaller dataset. D) Using only unsupervised learning techniques.
A) Supervised classification of images. B) Unsupervised learning tasks like dimensionality reduction and data denoising.b C) Predicting continuous values in a regression task. D) Reinforcement learning.
A) A single output neuron with a linear activation. B) Only a single layer of perceptrons. C) A convolutional layer followed by an RNN layer. D) An encoder that compresses the input and a decoder that reconstructs the input from the compression.
A) The harmonic mean of precision and recall. B) The proportion of positive identifications that were actually correct. C) The proportion of actual positives that were identified correctly. D) The proportion of total predictions that were correct.
A) You need a single metric that combines precision and recall. B) The cost of false positives is high (e.g., in spam detection, where you don't want to flag legitimate emails as spam). C) The cost of false negatives is high (e.g., in disease screening, where you don't want to miss a sick patient). D) You are evaluating a regression model.
A) You need a single metric that combines precision and recall. B) The cost of false positives is high (e.g., in spam detection). C) The cost of false negatives is high (e.g., in disease screening, where you don't want to miss a sick patient). D) You are evaluating a clustering model.
A) The difference between precision and recall. B) A metric used exclusively for regression. C) The arithmetic mean of precision and recall. D) The harmonic mean of precision and recall, providing a single score that balances both concerns.
A) The average of the squares of the errors between predicted and actual values. B) The accuracy of a classification model. C) The variance of the input features. D) The total number of misclassified instances.
A) The clustering quality of a K-means algorithm. B) The architecture of a neural network. C) The performance of a binary classification model at various classification thresholds. D) The loss of a regression model over time.
A) -1.0. B) 0.0. C) 1.0. D) 0.5.
A) Replace the need for a separate test set. B) Increase the size of the training dataset. C) Visualize high-dimensional data. D) Obtain a more robust estimate of model performance by training and evaluating the model K times on different splits of the data.
A) The majority vote among its K closest neighbors in the feature space. B) The output of a linear function.u C) A random selection from the training set. D) A single, pre-defined rule.
A) Is the number of features in the dataset. B) Controls the model's flexibility. A small K can lead to overfitting, while a large K can lead to underfitting. C) Is always set to 1 for the best performance. D) Is the learning rate for the algorithm.
A) Finding new, uncorrelated dimensions (principal components) that capture the maximum variance in the data.u B) Clustering data into K groups. C) Predicting a target variable using linear combinations of features. D) Classifying data using a decision boundary.
A) Is randomly oriented. B) Is perpendicular to all other components. C) Captures the least possible variance in the data. D) Captures the greatest possible variance in the data.
A) The within-cluster variance is minimized. B) The data is projected onto a single dimension. C) The between-cluster variance is minimized. D) The data is perfectly classified into known labels.
A) Evaluate the accuracy of a classification model. B) Help choose the optimal number of clusters K by looking for a "bend" in the plot of within-cluster variance. C) Determine the learning rate for gradient descent. D) Initialize the cluster centroids.
A) Do not use probability in their predictions. B) Always have the lowest possible accuracy. C) Are very simple and cannot handle complex data. D) Make a strong (naive) assumption that all features are conditionally independent given the class label.
A) Clustering algorithm for grouping unlabeled data. B) Regression algorithm for predicting continuous values. C) Dimensionality reduction technique. D) Classification algorithm that models the probability of a binary outcome using a logistic function.
A) Distance to the decision boundary. B) Number of features in the input. C) Exact value of the target variable. D) Probability that the input belongs to a particular class.
A) Decision Trees to reduce overfitting and improve generalization. B) Linear Regression models. C) K-NN models. D) Support Vector Machines.
A) Reduce bias by making trees more complex. B) Reduce variance by training individual trees on random subsets of the data and averaging their results C) Increase the speed of a single decision tree. D) Perform feature extraction like PCA.
A) Build all models independently and average them. B) Build models sequentially, where each new model corrects the errors of the previous ones. C) Are exclusively used for unsupervised learning. D) Do not require any parameter tuning.
A) The evaluation of a model's final performance. B) The process of using domain knowledge to create new input features that make machine learning algorithms work better. C) The process of deleting all features from a dataset. D) The automatic learning of features by a deep neural network.
A) Cluster similar data points together. B) Convert categorical variables into a binary (0/1) format that can be provided to ML algorithms. C) Reduce the dimensionality of image data. D) Normalize continuous numerical features.
A) Are used for association rule learning. B) Are based on distance calculations or gradient descent, such as SVM and Neural Networks. C) Are used for clustering only. D) Are based on tree-based models like Decision Trees and Random Forests.
A) There are never enough features to train a good model. B) Dimensionality reduction always improves model performance. C) All datasets should have as many features as possible. D) As the number of features grows, the data becomes increasingly sparse, making it harder to find meaningful patterns.
A) Prevent overfitting by adding a penalty term to the loss function that discourages complex models. B) Make models more complex to fit the training data better. C) Speed up the training time of a model. D) Increase the variance of a model.
A) A decrease in model interpretability. B) Sparse models where the weights of less important features are driven to zero, effectively performing feature selection. C) Increased model complexity. D) All features having non-zero weights.
A) Configuration settings for the learning algorithm that are not learned from the data and must be set prior to training (e.g., learning rate, K in K-NN). B) The parameters that the model learns during training (e.g., weights in a neural network). C) The output predictions of the model. D) The input features of the model.
A) Training the model's internal weights. B) Cleaning the raw data. C) Searching for the best combination of hyperparameters that results in the best model performance. D) Deploying the final model.
A) Randomly sampling hyperparameter combinations from a distribution. B) Using a separate neural network to predict the best hyperparameters. C) Exhaustively searching over a specified set of hyperparameter values. D) Ignoring hyperparameters altogether.
A) Stopping the training after a fixed, very short number of epochs. B) Halting the training process when performance on a validation set starts to degrade, indicating the onset of overfitting. C) Using a very small learning rate. D) Starting the training process later than scheduled.
A) Convolutional layers for processing images. B) A single layer of neurons. C) Recurrent layers for processing sequences. D) Fully connected layers, where each neuron in one layer is connected to every neuron in the next layer.
A) Unsupervised learning problems. B) Regression problems. C) Multi-class classification problems, as it outputs a probability distribution over the possible classes. D) Binary classification problems.
A) Combines the advantages of two other extensions of stochastic gradient descent, AdaGrad and RMSProp. B) Is guaranteed to find the global minimum for any function. C) Does not require any hyperparameters. D) Is only used for unsupervised learning.
A) Improve the stability and speed of neural network training by normalizing the inputs to each layer. B) Replace the need for an activation function. C) Normalize the entire dataset before feeding it into the network. D) Increase the batch size during training.
A) Clustering algorithm's group assignments. B) Regression model's accuracy. C) Classification model on a set of test data for which the true values are known. D) Dimensionality reduction technique's effectiveness.
A) The model correctly predicted the negative class. B) The model incorrectly predicted the negative class. C) The model correctly predicted the positive class. D) The model incorrectly predicted the positive class.
A) The model is too complex for the data. B) The learning rate is set too high. C) The features are not scaled properly. D) One class in the training data has significantly more examples than another, which can bias the model.
A) Generates synthetic examples for the minority class to balance the dataset. B) Ignores the minority class completely. C) Combines all classes into one. D) Deletes examples from the majority class at random.
A) It requires a fully labeled dataset for training. B) It learns by interacting with an environment and receiving rewards or penalties for actions, without a labeled dataset. C) It is a simpler and less powerful approach. D) It is only used for clustering unlabeled data.
A) A clustering of possible actions. B) A decision tree for classification. C) The principal components of a state space. D) A policy that tells an agent what action to take under what circumstances by learning a value function.
A) Reducing the dimensionality of word vectors. B) Generating new, original text without any input. C) Sentiment analysis, where text is classified as positive, negative, or neutral. D) Grouping similar news articles without labels.
A) Are used only for image classification. B) Are a type of clustering algorithm. C) Represent words as simple one-hot encoded vectors. D) Represent words as dense vectors in a continuous space, capturing semantic meaning.
A) Two identical Convolutional Neural Networks. B) An Encoder and a Decoder for compression. C) A single, large Regression network. D) A Generator and a Discriminator, which are trained in opposition to each other.
A) Creating new, synthetic data that is indistinguishable from real data. B) Classifying input images into categories. C) Reducing the dimensionality of the input. D) Discriminating between real and fake data.
A) Clustering algorithm grouping similar images. B) Dimensionality reduction technique. C) Binary classifier that tries to correctly label data as real (from the dataset) or fake (from the generator). D) Regression model predicting a continuous value. |