Good Papers

Partition Tree: Conditional Density Estimation over General Outcome Spaces

Partition Tree is a tree-based framework for conditional density estimation over general outcome spaces that learns by minimizing negative log-likelihood. It yields a scalable nonparametric alternative to probabilistic trees with improved predictive performance.

Felipe Lourenco Angelim Vieira, Alessandro Leite

Published 2026Paris Poster Session 4 · Thu, Dec 10, 5:30 PM–7:30 PM local time · Paris Poster HallarXiv ↗OpenReview ↗

70%
OverallHighly rated
?
OverallHighly ratedVote to see the scoreThe exact score shows once you've voted, so every vote is your own call. The first half of each home page shelf shows its scores.
Readers
–

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel4/20reviewers recommend it
lenient 3/5
medium 1/10
strict 0/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

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.