For functions with optimal decision tree of size s, max depth D_opt and avg depth Δ_opt, greedy builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under product distributions.
Information and Computation , volume=
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
-
Decision Tree Learning on Product Spaces
For functions with optimal decision tree of size s, max depth D_opt and avg depth Δ_opt, greedy builds an ε-approximating tree of size at most exp(Δ_opt D_opt log(e/ε)) under product distributions.