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