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 22nd
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
LLM chain-of-thought rewriting of job postings plus category-aware MoE improves person-job fit AUC by 2.4%, GAUC by 7.5%, and live click-through conversion by 19.4%.
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.
-
Enhancing Online Recruitment with Category-Aware MoE and LLM-based Data Augmentation
LLM chain-of-thought rewriting of job postings plus category-aware MoE improves person-job fit AUC by 2.4%, GAUC by 7.5%, and live click-through conversion by 19.4%.