CPCF, a compact finite-domain CP encoding for tree ensembles, outperforms MaxSAT and MILP for optimal counterfactual search in most tested regimes.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Linear decision trees can represent optimal solution policies for families of integer linear programs, enabling polynomial-time queries after offline synthesis for fixed feasible sets.
Optimal networks for collective estimation with strategic sharing balance information sharing rates against integration efficiency, with performance maximized at intermediate average degrees for each network type and when sampling effort is inversely proportional to degree in heterogeneous cases.
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.
-
Linear Decision Tree Policies for Integer Linear Programs
Linear decision trees can represent optimal solution policies for families of integer linear programs, enabling polynomial-time queries after offline synthesis for fixed feasible sets.
-
Optimal network structure for collective performance with strategic information sharing
Optimal networks for collective estimation with strategic sharing balance information sharing rates against integration efficiency, with performance maximized at intermediate average degrees for each network type and when sampling effort is inversely proportional to degree in heterogeneous cases.