Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions.
As the size of{1,2,3,4} D is4 D, the size of all the(c k, s) pairs is also4 D andPDIVMetrictotal complexity isO(4 D)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Woodelf++: A Fast and Unified Partial Dependence Plot Algorithm for Decision Tree Ensembles
Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions.