4 ms·
These are (false) claims, therefor not proofs. Deep trees will fortunately overfit your dataset. Any binary tree of depth log2(P) can completely separate your
by rq1 7y ago
These are (false) claims, therefor not proofs.
Deep trees will fortunately overfit your dataset.
Any binary tree of depth log2(P) can completely separate your P points.
- ramraj07 7y agoBut we are merging hundreds of trees each of which has been handicapped by removal of multiple features and a fraction of the data. Sounds to me like overfitting is not easy (no single data point or feature contributes to every tree so it can't be represented all the time). False claims as they maybe, these are claims I've seen in at least two of the most commonly studied statistical learning text books, so given that it makes sense and that it's in the text books, it seems reasonably not false to me. Someone else posted that if too many features or data points are very similar then it will overfit, and that totally makes sense. Whatever you say doesnt. Clarification would be useful.
- yters 7y agoAdding bunches of trees will overfit the accidental patterns in your data. I have an explanation here why reducing variance is not the same as reducing overfitting: https://news.ycombinator.com/item?id=20089890 https://news.ycombinator.com/item?id=20089890
- thom 7y agoYeah, at a certain point it's just playing 20 questions with your data.