mlsanityData to 7 Oct 2026

Building Trees for Probabilistic Prediction via Scoring Rules

arXiv 2402.11052 ↗First posted 16 Feb 2024stat.ME stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study modifying a tree to produce nonparametric predictive distributions. We find the standard method for building trees may not result in good predictive distributions and propose changing the splitting criteria for trees to one based on proper scoring rules. Analysis of both simulated data and several real datasets demonstrates that using these new splitting criteria results in trees with improved predictive properties considering the entire predictive distribution.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 39 references that are in the map. First posted on arXiv 16 Feb 2024.

Builds on

5 of 39 references.

References · 5

  1. 2016Generalized Random Forestscited by 309
  2. 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 254
  3. 2014Consistency of random forestscited by 84
  4. 2020Sparse learning with CARTcited by 12
  5. 2014Building Consistent Regression Trees From Complex Sample Datacited by 4

Built on by

Not cited yet.