Unit 1: Foundations of Machine Learning - Practice Quiz

INT394 — Machine Learning Algorithms 50 Questions
0 Correct 0 Wrong 50 Left
0/50

1 According to Tom Mitchell's definition of machine learning, a computer program is said to learn from experience with respect to some class of tasks and performance measure if:

A. Its performance at tasks in , as measured by , improves with experience .
B. It minimizes the complexity of the code required for .
C. It can execute tasks in without any errors.
D. It can generate new tasks based on performance .

2 Which of the following best distinguishes Machine Learning from traditional programming?

A. Traditional programming deals with numbers, while Machine Learning deals with images.
B. Machine Learning does not require a compiler.
C. Traditional programming uses data and rules to produce answers; Machine Learning uses data and answers to produce rules.
D. Traditional programming is faster than Machine Learning.

3 In the context of Supervised Learning, the dataset consists of:

A. Unstructured text without annotations.
B. Input vectors and associated target labels.
C. Input vectors only.
D. A reward signal only.

4 Which of the following is a classic example of Unsupervised Learning?

A. Spam filtering.
B. Customer segmentation (Clustering).
C. Playing Chess.
D. House price prediction.

5 In Reinforcement Learning, what does the agent maximize to learn the optimal policy?

A. The cumulative future reward.
B. The number of states visited.
C. The immediate reward.
D. The accuracy of prediction.

6 Predicting a continuous output value, such as the temperature tomorrow, is known as:

A. Dimensionality Reduction
B. Clustering
C. Regression
D. Classification

7 Predicting whether an email is 'Spam' or 'Not Spam' is an example of:

A. Policy Search
B. Regression
C. K-Means Clustering
D. Binary Classification

8 Which of the following is a major challenge in Machine Learning where the model learns the training data too well, including the noise, and performs poorly on new data?

A. Convergence
B. Regularization
C. Underfitting
D. Overfitting

9 The Curse of Dimensionality refers to:

A. The computational cost of adding more rows to a dataset.
B. The difficulty of visualizing data in 2D.
C. The exponential increase in data volume required to generalize accurately as the number of features increases.
D. The bias introduced by dimension reduction techniques.

10 In the Statistical Learning Framework, we assume the data is generated by:

A. The learning algorithm itself.
B. An unknown joint probability distribution .
C. A deterministic linear function.
D. A random number generator.

11 The function that measures the penalty for predicting when the true value is is called:

A. The Activation Function
B. The Loss Function
C. The Regularizer
D. The Hypothesis

12 What is Generalization Error (or True Risk)?

A. The error on the training set.
B. The expected value of the loss function over the underlying data distribution.
C. The difference between the predicted value and the average value.
D. The error on the test set.

13 Mathematically, Empirical Risk for a hypothesis on a dataset of size is defined as:

A.
B.
C.
D.

14 Empirical Risk Minimization (ERM) is the principle of:

A. Choosing the hypothesis with the simplest structure.
B. Minimizing the error on the test set.
C. Choosing the hypothesis that minimizes the loss on the training set.
D. Minimizing the computational time.

15 Why is minimizing Empirical Risk not always sufficient to ensure good learning?

A. It can lead to overfitting if the hypothesis space is too complex.
B. It ignores the training labels.
C. It always results in underfitting.
D. It is computationally too expensive.

16 What is Inductive Bias?

A. The error introduced by noise in the data.
B. The set of assumptions a learner makes to predict outputs for unseen inputs.
C. The bias term in the equation .
D. The tendency of a model to underfit the data.

17 Which of the following describes Occam's Razor in the context of Inductive Bias?

A. We should always choose the hypothesis with the highest training error.
B. Data should be sliced into smaller chunks for processing.
C. Complex models are always better.
D. Among competing hypotheses that fit the data equally well, the simplest one should be selected.

18 Restricting the hypothesis space to include only Linear Classifiers is an example of:

A. Restriction Bias (Language Bias)
B. Sampling Bias
C. Confirmation Bias
D. Preference Bias

19 In the context of the No Free Lunch Theorem, which statement is true?

A. Averaged over all possible data generating distributions, every classification algorithm has the same error rate.
B. More data always guarantees a better model.
C. Deep Learning is universally better than Decision Trees.
D. A single algorithm exists that is superior for all possible problems.

20 What does PAC stand for in Learning Theory?

A. Pattern Analysis and Computing
B. Perfectly Accurate Classification
C. Probably Approximately Correct
D. Probabilistic Algorithm Complexity

21 In the PAC framework, the parameter (epsilon) represents:

A. The complexity of the hypothesis space.
B. The accuracy parameter (maximum allowable error).
C. The number of samples.
D. The probability of failure.

22 In the PAC framework, the parameter (delta) represents:

A. The learning rate.
B. The dimensionality of the data.
C. The confidence parameter (probability that the error is high).
D. The error rate.

23 A concept class is PAC-learnable if there exists an algorithm that outputs a hypothesis such that with probability at least :

A.
B.
C.
D.

24 In PAC learning, Sample Complexity refers to:

A. The number of training examples required to guarantee a valid hypothesis with high probability.
B. The complexity of the loss function.
C. The number of features in the dataset.
D. The time complexity of the algorithm.

25 For a finite hypothesis space , the number of samples required for consistent PAC learning is proportional to:

A.
B.
C.
D.

26 Which of the following implies Agnostic PAC Learning?

A. The error must be exactly zero.
B. The target function is assumed to be within the hypothesis space .
C. The target function may not belong to , and we seek the hypothesis with minimum risk.
D. There is no noise in the data.

27 Which type of learning is characterized by the absence of labels but the presence of a goal to discover hidden structures?

A. Supervised Learning
B. Semisupervised Learning
C. Reinforcement Learning
D. Unsupervised Learning

28 Consider a dataset where inputs are images of animals and labels are 'Cat', 'Dog', or 'Bird'. This is a:

A. Regression problem
B. Multi-class Classification problem
C. Clustering problem
D. Multi-label Classification problem

29 Underfitting is often a result of:

A. Training for too many epochs.
B. The model being too simple to capture the underlying trend.
C. The model being too complex.
D. Too much training data.

30 Which of the following is NOT a component of the Statistical Learning Framework?

A. Loss Function
B. Input Space
C. The exact formula of the Target Function
D. Output Space

31 Which statement best describes the Bias-Variance Tradeoff?

A. Ideally, we want high bias and high variance.
B. Increasing model complexity increases bias and decreases variance.
C. Increasing model complexity decreases bias and increases variance.
D. Bias and Variance are independent of model complexity.

32 In the context of PAC learning, a hypothesis is consistent with the training data if:

A. It is a linear function.
B. It is chosen randomly.
C. It has the lowest generalization error.
D. It correctly classifies all training examples (Empirical error is 0).

33 Which of the following represents the Zero-One Loss function for binary classification ()?

A.
B.
C. if , else
D.

34 In Semi-Supervised Learning:

A. No data is labeled.
B. The agent learns from rewards.
C. A small amount of labeled data is used with a large amount of unlabeled data.
D. All data is labeled.

35 Which learning paradigm is most suitable for a robot learning to walk by trial and error?

A. Supervised Learning
B. Unsupervised Learning
C. Reinforcement Learning
D. Transductive Learning

36 What is the primary goal of the Validation Set?

A. To train the model parameters.
B. To increase the size of the training data.
C. To tune hyperparameters and evaluate the model during development to prevent overfitting.
D. To report the final accuracy of the model.

37 If a learning algorithm has high Variance, it implies:

A. The algorithm always produces the same model regardless of the data.
B. The algorithm pays very little attention to the training data.
C. The algorithm is very sensitive to specific sets of training data (small changes in data lead to large changes in the model).
D. The algorithm has high systematic error.

38 The assumption that the training data and future test data are drawn from the same distribution is called:

A. The linearity assumption.
B. The i.i.d. assumption (Independent and Identically Distributed).
C. The Bayesian assumption.
D. The Markov assumption.

39 In the definition of PAC learning, the term 'Probably' refers to:

A. The loss function.
B. The hypothesis space size.
C. The confidence .
D. The error .

40 Which of the following is a potential solution to Overfitting?

A. Regularization (e.g., adding a penalty for complexity).
B. Making the model more complex.
C. Increasing the number of features.
D. Reducing the size of the training set.

41 In Linear Regression, the inductive bias typically includes the assumption that:

A. The data is clustered.
B. The relationship is a high-degree polynomial.
C. The relationship between input and output is linear.
D. The output is a discrete class label.

42 In the equation , the term represents:

A. Bias error.
B. Variance error.
C. Training error.
D. Irreducible error.

43 Which inequality is commonly used in PAC learning derivations to bound the probability of large deviations?

A. Newton's Second Law
B. Pythagorean Theorem
C. Hoeffding's Inequality
D. Euler's Identity

44 A hypothesis space is said to be infinite if:

A. It is empty.
B. It contains continuous parameters (e.g., all possible linear separators in ).
C. It only contains decision trees of depth 3.
D. It contains a finite number of hypotheses.

45 The difference between the True Risk and the Empirical Risk is often called:

A. Generalization Gap
B. Inductive Bias
C. Training Loss
D. Bayes Error

46 Which of the following datasets would be most appropriate for a Regression problem?

A. Emails labeled as spam/ham.
B. Handwritten digits 0-9.
C. Historical data of house sizes and their selling prices.
D. Photos labeled with names of people.

47 In an Unsupervised Learning setting, Dimensionality Reduction aims to:

A. Label the data automatically.
B. Cluster data into groups.
C. Reduce the number of random variables under consideration by obtaining a set of principal variables.
D. Increase the number of features to capture more detail.

48 Why do we need a Test Set that is completely separate from the Training Set?

A. To calculate the gradient.
B. To provide an unbiased evaluation of the final model fit.
C. To use for hyperparameter tuning.
D. To make the training faster.

49 In the context of Machine Learning scope, Computer Vision typically involves:

A. Analyzing text sentiment.
B. Extracting information from images and videos.
C. Predicting stock prices.
D. Optimizing database queries.

50 The 'Realizability Assumption' in PAC learning states that:

A. There exists a hypothesis in the hypothesis space such that .
B. The learning algorithm is efficient.
C. The data is noiseless.
D. The sample size is infinite.