Decision trees and diffusion models are unified via a shared Global Trajectory Score Matching principle, yielding TreeFlow for tabular generation and DSMTree for distilling tree logic into networks.
The difference between the endpoints is: X ⋆ T −Xm,T = Z T 0 b⋆ rev(X ⋆ τ , τ)−b rev,m(Xm,τ , τ) dτ+ Z T 0 σ(X ⋆ τ , τ)dW ⋆ τ − Z T 0 σ(Xm,τ , τ)dWm,τ
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Trees to Flows and Back: Unifying Decision Trees and Diffusion Models
Decision trees and diffusion models are unified via a shared Global Trajectory Score Matching principle, yielding TreeFlow for tabular generation and DSMTree for distilling tree logic into networks.