A hybrid MO-MCTS plus SAT-verification algorithm synthesizes decision-tree interpretations of black-box models with verified local Pareto-optimality guarantees, scaling to benchmarks where the global Pareto-optimal solver times out.
Title resolution pending
1 Pith paper cite this work, alongside 14 external citations. Polarity classification is still indexing.
1
Pith paper citing it
14
external citations · OpenAlex
citation-role summary
dataset 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
dataset 1polarities
use dataset 1representative citing papers
citing papers explorer
-
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
A hybrid MO-MCTS plus SAT-verification algorithm synthesizes decision-tree interpretations of black-box models with verified local Pareto-optimality guarantees, scaling to benchmarks where the global Pareto-optimal solver times out.