Concept guide · Classical algorithms
Why can a random forest generalise better than one decision tree?
A slower explanation for when the short interview answer is not enough. Start with the intuition, then connect it to the technical idea and the way an interviewer expects you to reason about it.
ML area
Classical algorithms → Core interview concept
Interview format
Core
Question
ML-049
Start with the idea
In simple terms
This question is asking you to explain Why can a random forest generalise better than one decision tree in a way that connects the idea to a real machine-learning decision. Start with the role this concept plays, then explain what changes when the data, target, or deployment situation changes.
Build the answer
How to reason about it
- 1Define the concept before naming algorithms or implementation details.
- 2Connect it to the data, target, decision, or failure mode in the question.
- 3State the assumption or evaluation check that would make the explanation trustworthy.
Go one level deeper
The technical explanation
A random forest trains many trees on bootstrap samples while considering random feature subsets, then averages or votes their predictions. Each tree is noisy, but the errors are less correlated, so averaging reduces variance. The forest is not immune to leakage, poor features, or distribution shift, and its extra trees cost memory and inference time. The safest way to understand this topic is to connect the definition to assumptions, data available at prediction time, the decision it supports, and how you would evaluate whether the result is useful.
Say this in the interview
A random forest trains many trees on bootstrap samples while considering random feature subsets, then averages or votes their predictions. Each tree is noisy, but the errors are less correlated, so averaging reduces variance. The forest is not immune to leakage, poor features, or distribution shift, and its extra trees cost memory and inference time.
Keep preparing