arXiv Machine Learning
Beyond Point Prediction: Artificial Representative Trees with Uncertainty
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
2d ago
Beyond Point Prediction: Artificial Representative Trees with Uncertainty
Random forests (RFs) predict well but are opaque, whereas single decision trees are interpretable but unstable. Artificial representative trees (ARTs) were developed as interpretable surrogate models...
arXiv Machine Learning
Jun 11
Projected random forests and conformal prediction of circular data
arXiv:2410. 24145v3 Announce Type: replace-cross Abstract: We apply conformal prediction techniques to regression problems with circular responses, producing prediction sets with adaptive arc length and finite-sample coverage guarantees for any circular predictive model under the assumption of data exchangeability.
arXiv Machine Learning
Jun 4
Ternary Decision Trees with Locally-Adaptive Uncertainty Zones
arXiv:2605. 22740v2 Announce Type: replace Abstract: Decision trees assign identical confidence to instances near and far from each split threshold.
arXiv Machine Learning
Jun 2
Decision-Path Patterns as Tree Reliability Signals: Path-based Adaptive Weighting for Random Forest Classification
arXiv:2605. 20716v5 Announce Type: replace Abstract: Random forests construct each tree with a different, randomised representation of the feature space.
arXiv Machine Learning
Aug 5
LoBoost: Fast Model-Native Local Conformal Prediction for Gradient-Boosted Trees
arXiv:2602. 22432v2 Announce Type: replace-cross Abstract: Gradient-boosted decision trees are among the strongest off-the-shelf predictors for tabular regression, but point predictions alone do not quantify uncertainty.
arXiv Machine Learning
Jul 1
Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again
arXiv:2606. 30995v1 Announce Type: new Abstract: Recent work has shown that well-optimized individual decision trees can match complex black box models in some settings, primarily in noisy domains.