Research map / Learning theory and algorithms / Combinatorial and search optimization
Using MaxSAT for Efficient Explanations of Tree Ensembles
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace SMT-based aggregation reasoning with MaxSAT optimization | Formal explanations for XGBoost boosted trees · 21-dataset benchmark suite | average runtime (seconds per instance): 16.672 -> 3.183 | Helped |
| Use MaxSAT-based formal explanations instead of Anchor | XGBoost boosted trees · 21-dataset benchmark suite | average runtime (seconds per instance): 10.225 -> 3.183 | Helped |
Closest papers by meaning
- A Scalable Two Stage Approach to Computing Optimal Decision Sets (AAAI 2021 · similarity 0.86)
- On Computing Probabilistic Explanations for Decision Trees (NeurIPS 2022 · similarity 0.86)
- Ordered Objectives in Maximum Satisfiability (AAAI 2026 · similarity 0.86)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.85)
- Learning Better Representations From Less Data For Propositional Satisfiability (NeurIPS 2024 · similarity 0.83)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.