A multi-armed bandit-based dynamic pruning method for decision trees is proposed, reporting improved generalization over greedy cost-complexity and reduced-error pruning on benchmark datasets.
Rudin, ``Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,'' Nature Machine Intelligence, vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Armed Bandits-Based Optimization of Decision Trees
A multi-armed bandit-based dynamic pruning method for decision trees is proposed, reporting improved generalization over greedy cost-complexity and reduced-error pruning on benchmark datasets.