Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference 事件

Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference arXiv:2605.31239v1 Announce Type: cross Abstract: Bagging-based ensembles, most notably Adaptive Random Forests, are among the strongest performers for learning from data streams. A common denominator across these methods is their reliance on Hoeffding Trees as base learners, which grow decision trees incrementally by testing whether a candidate split is significantly better than its alternatives using concentration