FRM Part I · FRM Exam Part I · Machine Learning and Prediction
A risk analyst fits a single classification tree to predict loan default and lets it grow until every terminal node contains only one class. Training accuracy is 100%, but out-of-sample accuracy is much lower. Which statement best describes the problem and a standard remedy?
The tree is overfitted with high variance, since it memorizes training data and generalizes poorly. Pruning or limiting its depth reduces complexity and is the standard remedy. Standardizing features does not help because tree splits do not depend on feature scale.
- AThe tree is underfitted with high bias; adding more features to the root node is the remedy
- BThe tree is overfitted with high variance; pruning or limiting depth is a standard remedyCorrect
- CThe tree suffers from multicollinearity; dropping correlated predictors is the remedy
- DThe tree is biased because of unscaled inputs; standardizing the features is the remedy
Explanation
A fully grown tree memorizes the training data, giving perfect in-sample fit but poor generalization, which is overfitting (high variance). Pruning, limiting depth, or requiring a minimum node size reduces complexity. Scaling is irrelevant because tree splits are invariant to monotonic feature transformations.
Did you get it right without looking?
One question tells you little. A timed set on Machine Learning and Prediction shows your real accuracy, how long you take and where you lose marks.
More Machine Learning and Prediction questions
- An analyst runs PCA on three unstandardized variables whose variances are 100, 4 and 1, with small covariances between them. The analyst not…
- A single-output neural network uses squared-error loss L = 0.5(y - ŷ)², where ŷ = w·x with no activation and no bias. For one observation, x…
- Two variables are standardized and have a correlation of 0.60. What are the eigenvalues of their correlation matrix, and what proportion of …
- Which statement correctly distinguishes a random forest from plain bagging of decision trees?
- A neural network hidden node receives inputs x1 = 2 and x2 = -1. The weights are w1 = 0.5 and w2 = 1.5, and the bias is 0.25. The node uses …
- In k-fold cross-validation with k = 5 applied to a sample of 500 observations, how many observations are used to train the model in each ite…