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