Research map / Learning theory and algorithms / Prediction and decision losses
Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference
Salim I. Amoukou, Saumitra Mishra, Manuela Veloso
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace Hoeffding bound split test with betting-based anytime-valid test | Hoeffding Tree · 12 data streams | prequential accuracy / MAE | Improved |
| use anytime-valid betting test instead of Hoeffding test | Hoeffding Tree · abalone | prequential MAE | Hurt |
| replace HT base learner with AVT in the ensemble | ARF · 12 data streams | prequential performance | Improved |
| replace HT base learner with AVT in the ensemble | ARF · 12 data streams | average tree depth | Improved |
| use anytime-valid betting test | Hoeffding Tree · RandomTree synthetic stream (i.i.d.) | generalisation error over time | Improved |
| use strong-hypothesis test instead of weak (average-based) test (ablation) | AVT · RandomTree synthetic stream | generalisation performance | Improved |
| use anytime-valid betting test | Hoeffding Tree · RandomTree synthetic stream | number of leaves: caps leaves at 8 | Improved |
| use anytime-valid betting test | Hoeffding Tree · bike, fried, hyper100k | prequential performance vs ARF | Improved |
| use anytime-valid betting test | Hoeffding Tree · 12 data streams | tree depth | Hurt |
| use betting test | Hoeffding Tree · 12 data streams | update time (ms): 0.608 -> 25.82 (nzenergy) | Hurt |
| use betting test | Hoeffding Tree · 12 data streams | inference time (ms): 0.028 -> 0.010 (airlines) | No clear effect |
| use betting-based AVT base learner in ensemble | ARF · nzenergy | update time (ms): 0.074 -> 3.06 | Hurt |
Closest papers by meaning
- Adaptive Random Forests from Online Learning and Testing by Betting (NeurIPS 2026 · similarity 0.89)
- Random Composite Forests (AAAI 2016 · similarity 0.88)
- Hierarchical Shrinkage: Improving the accuracy and interpretability of tree-based models. (ICML 2022 · similarity 0.87)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.87)
- Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again (NeurIPS 2026 · similarity 0.86)
- Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithm (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
