QuizLander
← 所有公开测验

Machine Learning — Core Concepts

作者 Jude · 14/05/2026 · 136 次浏览 · 0 次分享

Supervised learning, regularization, gradient descent, overfitting, classical models. Great prep for associate-level ML exams (AWS ML / GCP ML Engineer).
30
题目
🇬🇧 English
语言
困难
难度
开始测验(游客或账户)
分享为图片

测验题目

  1. 1. Statement 1| Linear regression estimator has the smallest variance among all unbiased estimators.
    Statement 2| The coefficients α assigned to the classifiers assembled by AdaBoost are always non-negative.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  2. 2. Statement 1| RoBERTa pretrains on a corpus that is approximate 10x larger than the corpus BERT pretrained on.
    Statement 2| ResNeXts in 2018 usually used tanh activation functions.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  3. 3. Statement 1| Support vector machines, like logistic regression models, give a probability distribution over the possible labels given an input example.
    Statement 2| We would expect the support vectors to remain the same in general as we move from a linear kernel to higher order polynomial kernels.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  4. 4. A machine learning problem involves four attributes plus a class. The attributes have 3, 2, 2, and 2 possible values each. The class has 3 possible values. How many maximum possible different examples are there?
    1. 12
    2. 24
    3. 48
    4. 72
  5. 5. As of 2020, which architecture is best for classifying high-resolution images?
    1. convolutional networks
    2. graph networks
    3. fully connected networks
    4. RBF networks
  6. 6. Statement 1| The log-likelihood of the data will always increase through successive iterations of the expectation maximation algorithm.
    Statement 2| One disadvantage of Q-learning is that it can only be used when the learner has prior knowledge of how its actions affect its environment.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  7. 7. Let us say that we have computed the gradient of our cost function and stored it in a vector g. What is the cost of one gradient descent update given the gradient?
    1. O(D)
    2. O(N)
    3. O(ND)
    4. O(ND^2)
  8. 8. Statement 1| For a continuous random variable x and its probability distribution function p(x), it holds that 0 ≤ p(x) ≤ 1 for all x.
    Statement 2| Decision tree is learned by minimizing information gain.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  9. 9. Consider the Bayesian network given below. How many independent parameters are needed for this Bayesian Network H -> U <- P <- W?
    1. 2
    2. 4
    3. 8
    4. 16
  10. 10. As the number of training examples goes to infinity, your model trained on that data will have:
    1. Lower variance
    2. Higher variance
    3. Same variance
    4. None of the above
  11. 11. Statement 1| The set of all rectangles in the 2D plane (which includes non axisaligned rectangles) can shatter a set of 5 points.
    Statement 2| The VC-dimension of k-Nearest Neighbour classifier when k = 1 is infinite.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  12. 12. _ refers to a model that can neither model the training data nor generalize to new data.
    1. good fitting
    2. overfitting
    3. underfitting
    4. all of the above
  13. 13. Statement 1| The F1 score can be especially useful for datasets with class high imbalance.
    Statement 2| The area under the ROC curve is one of the main metrics used to assess anomaly detectors.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  14. 14. Statement 1| The back-propagation algorithm learns a globally optimal neural network with hidden layers.
    Statement 2| The VC dimension of a line should be at most 2, since I can find at least one case of 3 points that cannot be shattered by any line.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  15. 15. High entropy means that the partitions in classification are
    1. pure
    2. not pure
    3. useful
    4. useless
  16. 16. Statement 1| Layer Normalization is used in the original ResNet paper, not Batch Normalization.
    Statement 2| DCGANs use self-attention to stabilize training.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  17. 17. In building a linear regression model for a particular data set, you observe the coefficient of one of the features having a relatively high negative value. This suggests that
    1. This feature has a strong effect on the model (should be retained)
    2. This feature does not have a strong effect on the model (should be ignored)
    3. It is not possible to comment on the importance of this feature without additional information
    4. Nothing can be determined.
  18. 18. For a neural network, which one of these structural assumptions is the one that most affects the trade-off between underfitting (i.e. a high bias model) and overfitting (i.e. a high variance model):
    1. The number of hidden nodes
    2. The learning rate
    3. The initial choice of weights
    4. The use of a constant-term unit input
  19. 19. For polynomial regression, which one of these structural assumptions is the one that most affects the trade-off between underfitting and overfitting:
    1. The polynomial degree
    2. Whether we learn the weights by matrix inversion or gradient descent
    3. The assumed variance of the Gaussian noise
    4. The use of a constant-term unit input
  20. 20. Statement 1| As of 2020, some models attain greater than 98% accuracy on CIFAR-10.
    Statement 2| The original ResNets were not optimized with the Adam optimizer.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  21. 21. The K-means algorithm:
    1. Requires the dimension of the feature space to be no bigger than the number of samples
    2. Has the smallest value of the objective function when K = 1
    3. Minimizes the within class variance for a given number of clusters
    4. Converges to the global optimum if and only if the initial means are chosen as some of the samples themselves
  22. 22. Statement 1| VGGNets have convolutional kernels of smaller width and height than AlexNet's first-layer kernels.
    Statement 2| Data-dependent weight initialization procedures were introduced before Batch Normalization.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  23. 23. What is the rank of the following matrix? A = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]
    1. 0
    2. 1
    3. 2
    4. 3
  24. 24. Statement 1| Density estimation (using say, the kernel density estimator) can be used to perform classification.
    Statement 2| The correspondence between logistic regression and Gaussian Naive Bayes (with identity class covariances) means that there is a one-to-one correspondence between the parameters of the two classifiers.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  25. 25. Suppose we would like to perform clustering on spatial data such as the geometrical locations of houses. We wish to produce clusters of many different sizes and shapes. Which of the following methods is the most appropriate?
    1. Decision Trees
    2. Density-based clustering
    3. Model-based clustering
    4. K-means clustering
  26. 26. Statement 1| In AdaBoost weights of the misclassified examples go up by the same multiplicative factor.
    Statement 2| In AdaBoost, weighted training error e_t of the tth weak classifier on training data with weights D_t tends to increase as a function of t.
    1. True, True
    2. False, False
    3. True, False
    4. False, True
  27. 27. MLE estimates are often undesirable because
    1. they are biased
    2. they have high variance
    3. they are not consistent estimators
    4. None of the above
  28. 28. Computational complexity of Gradient descent is,
    1. linear in D
    2. linear in N
    3. polynomial in D
    4. dependent on the number of iterations
  29. 29. Averaging the output of multiple decision trees helps _.
    1. Increase bias
    2. Decrease bias
    3. Increase variance
    4. Decrease variance
  30. 30. The model obtained by applying linear regression on the identified subset of features may differ from the model obtained at the end of the process of identifying the subset during
    1. Best-subset selection
    2. Forward stepwise selection
    3. Forward stage wise selection
    4. All of the above
答题并查看我的分数

评论

登录后即可评论。

加载中…