Concave impurity gives non-negative information gain
ProofIntermediate⏱ 30 minClassical MLentropyginiconcavitysplitting
Problem
Prove that for concave on the simplex, any split has non-negative gain , and that strict concavity gives strict gain unless . Then explain why misclassification error is a poor splitting criterion.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Gradient boosting fits the negative functional gradient | Classical ML | Proof | 30 min | ||
| The bagging variance formula | Classical ML | Proof | 30 min | ||
| The irreducible loss is the conditional entropy | LLMs | Proof | 30 min | ||
| AdaBoost as exact line search on the exponential loss | Classical ML | Proof | 30 min | ||
| AdaBoost drives training error to zero exponentially | Classical ML | Proof | 1 hour |