从决策树到扩散模型及逆向过程:决策树与扩散模型的统一
Trees to Flows and Back: Unifying Decision Trees and Diffusion Models

原始链接: https://arxiv.org/abs/2605.00414

在《Trees to Flows and Back》一文中,作者 Sai Niranjan Ramachandran 和 Suvrit Sra 弥合了两个看似无关范式之间的鸿沟:层次化决策树与连续扩散模型。该论文建立了这两类模型之间的形式化数学对应关系,揭示出两者均受名为“全局轨迹分数匹配”(GTSM)的共同优化原则支配。通过该框架,作者论证了理想化的梯度提升是这些模型的一种渐进最优方法。 这一理论统一带来了两项重要的实际应用: 1. **TreeFlow**:一种用于表格数据的生成模型,在提升保真度的同时实现了 2 倍的计算加速。 2. **DSMTree**:一种蒸馏技术,可有效地将层次化决策逻辑迁移至神经网络中,在多个基准测试中均能稳定地达到教师模型性能的 98% 以上。 通过证明决策树与扩散过程是同一事物的两个侧面,该研究为增强表格数据生成和模型可解释性提供了一个强有力的新视角。

Hacker News 最新 | 过往 | 评论 | 提问 | 展示 | 招聘 | 提交 登录 从树到流及往复:决策树与扩散模型的统一(arxiv.org) 9 分 | rsn243 发布于 3 小时前 | 隐藏 | 过往 | 收藏 | 讨论 | 帮助 指南 | 常见问题 | 列表 | API | 安全 | 法律 | 申请 YC | 联系 搜索:
相关文章

原文

View a PDF of the paper titled Trees to Flows and Back: Unifying Decision Trees and Diffusion Models, by Sai Niranjan Ramachandran and Suvrit Sra

View PDF
Abstract:Decision trees and diffusion models are ostensibly disparate model classes, one discrete and hierarchical, the other continuous and dynamic. This work unifies the two by establishing a crisp mathematical correspondence between hierarchical decision trees and diffusion processes in appropriate limiting regimes. Our unification reveals a shared optimization principle: \emph{Global Trajectory Score Matching (GTSM)}, for which gradient boosting (in an idealized version) is asymptotically optimal. We underscore the conceptual value of our work through two key practical instantiations: \treeflow, which achieves competitive generation quality on tabular data with higher fidelity and a 2\times computational speedup, and \dsmtree, a novel distillation method that transfers hierarchical decision logic into neural networks, matching teacher performance within 2\% on many benchmarks.
From: Sai Niranjan Ramachandran [view email]
[v1] Fri, 1 May 2026 05:19:54 UTC (8,277 KB)
[v2] Thu, 21 May 2026 04:49:57 UTC (8,277 KB)
联系我们 contact @ memedata.com