Regional tree regularization applies an L0-style penalty on the average decision path length of region-specific decision trees, using SparseMax to make optimization practical.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Regional Tree Regularization for Interpretability in Black Box Models
Regional tree regularization applies an L0-style penalty on the average decision path length of region-specific decision trees, using SparseMax to make optimization practical.