cd /news/machine-learning/trees-to-flows-and-back-unifying-dec… · home topics machine-learning article
[ARTICLE · art-23373] src=arxiv.org pub= topic=machine-learning verified=true sentiment=· neutral

Trees to Flows and Back: Unifying Decision Trees and Diffusion Models

Researchers have established a mathematical correspondence between hierarchical decision trees and diffusion processes, unifying the two model classes under a shared optimization principle called Global Trajectory Score Matching. The work yields two practical applications: TreeFlow, which achieves competitive tabular data generation with higher fidelity and 2× speedup, and DSMTree, a distillation method that transfers decision logic into neural networks within 2% of teacher performance. The unification reveals gradient boosting as asymptotically optimal for the shared framework, bridging discrete and continuous machine learning approaches.

read2 min publishedJun 6, 2026
[Submitted on 1 May 2026 (

[v1](https://arxiv.org/abs/2605.00414v1)), last revised 21 May 2026 (this version, v2)]# Title:Trees to Flows and Back: Unifying Decision Trees and Diffusion Models

[View PDF](/pdf/2605.00414)

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.

Submission history #

From: Sai Niranjan Ramachandran [[view email](/show-email/4bd0d387/2605.00414)]

**Fri, 1 May 2026 05:19:54 UTC (8,277 KB)**

[[v1]](/abs/2605.00414v1)**[v2]** Thu, 21 May 2026 04:49:57 UTC (8,277 KB)

Current browse context:

cs.LG

Change to browse by:

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?)# Code, Data and Media Associated with this Article alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?)# Demos Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) IArxiv Recommender

(What is IArxiv?)# arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #machine-learning 4 stories · sorted by recency
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/trees-to-flows-and-b…] indexed:0 read:2min 2026-06-06 ·