arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04042cs.LGstat.MEstat.ML

分区树:在一般结果空间上的条件密度估计

Partition Tree: Conditional Density Estimation over General Outcome Spaces

Independent Researcher(独立研究者);INSA Rouen Normandy(里昂大学鲁昂分校);Normandy University(诺曼底大学);LITIS Rouen(鲁昂LITIS实验室)

Felipe Angelim, Alessandro Leite

AI总结:

本文提出分区树,一种基于树的框架,用于在一般结果空间上进行条件密度估计,支持连续和分类变量。通过数据自适应的分区建模条件分布,并直接最小化条件负对数似然,实现非参数方法。分区森林通过平均条件密度进行扩展,实验显示优于CART树且与现有概率树方法和随机森林竞争。

摘要:

我们提出Partition Tree,一种新颖的基于树的框架,用于在一般结果空间上进行条件密度估计,支持连续和分类变量的统一建模。我们的方法将条件分布建模为数据自适应分区上的分段常数密度,并通过直接最小化条件负对数似然来学习树结构。这提供了一种可扩展的非参数替代方案,无需对目标分布做出参数假设。我们进一步引入Partition Forest,通过平均条件密度进行袋外扩展。实验证明,相较于CART风格的树,Partition Tree在概率预测上有所改进,且在与现有概率树方法和随机森林的比较中表现具有竞争力。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑