mlsanityData to 13 Oct 2026

Partition Tree: Conditional Density Estimation over General Outcome Spaces

arXiv 2602.04042 ↗First posted 3 Feb 2026cs.LG stat.ME stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional distributions as piecewise-constant densities on data-adaptive partitions and learns trees by directly minimizing conditional negative log-likelihood. This yields a scalable, nonparametric alternative to existing probabilistic trees that does not make parametric assumptions about the target distribution. We further introduce Partition Forest, a bagging extension obtained by averaging conditional densities. Empirically, we demonstrate improved probabilistic prediction over CART-style trees and competitive performance compared to state-of-the-art probabilistic tree methods and Random Forests.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 3 of its 33 references that are in the map. First posted on arXiv 3 Feb 2026.

Builds on

3 of 33 references.

References · 3

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,472
  2. 2018Probabilistic supervised learningcited by 4
  3. 2024Conditional Density Estimation with Histogram Treescited by 4

Built on by

Not cited yet.