CPCF, a compact finite-domain CP encoding for tree ensembles, outperforms MaxSAT and MILP for optimal counterfactual search in most tested regimes.
Proceedings of the 38th International Conference on Machine Learning , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms
CPCF, a compact finite-domain CP encoding for tree ensembles, outperforms MaxSAT and MILP for optimal counterfactual search in most tested regimes.