Metraipolis › archive › dc_d09f2d4a91c3

Decision-Tree Surrogates for Weak Counterfactual Explanations in Integer Optimization — arXiv:2610.05887

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.05887
License (as archived)
CC0-1.0
Archived
2026-10-06T13:06:18.623Z
SHA-256 of the archived text
e09e6c80273a47e4d9a8a720722693f32f335767a3ac574ff517df1dba119e69
Stable URL of this page
https://metraipolis.com/documento/dc_d09f2d4a91c3

How to cite

Decision-Tree Surrogates for Weak Counterfactual Explanations in Integer Optimization — arXiv:2610.05887 — arXiv (en), https://arxiv.org/abs/2610.05887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d09f2d4a91c3 (Metraipolis archive dc_d09f2d4a91c3, sha256 e09e6c80273a47e4d9a8a720722693f32f335767a3ac574ff517df1dba119e69)
BibTeX
@misc{dcd09f2d4a91c3,
  title = {Decision-Tree Surrogates for Weak Counterfactual Explanations in Integer Optimization — arXiv:2610.05887},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.05887},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d09f2d4a91c3; sha256 e09e6c80273a47e4d9a8a720722693f32f335767a3ac574ff517df1dba119e69},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05887. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The concept of counterfactual explanations (CEs) has recently gained increasing attention for deriving explanations of mathematical optimization problems. For a given problem, a counterfactual is an ideally minimal change in the mutable problem parameters such that an optimal solution of the changed problem exists fulfilling some desired criterion. It was shown that so-called weak CEs can be calculated by solving a computationally demanding bilevel optimization problem, which is $\Sigma_2^p$-complete if decision variables and mutable parameters are restricted to integers. Hence, the known exact solution methods are expected to fail on practically relevant problem sizes. In this work we derive a fast heuristic algorithm by approximating the feasible region of the CE problem with a decision tree for which CEs can be calculated more quickly. To this end we analyze the mathematical structure of the feasible region and develop a hand-crafted decision tree which applies splits imitating this structure. Additionally, we develop several techniques to increase the performance of our method. The practicability of our methods is supported by computational experiments on the knapsack problem and the facility location problem.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.05887 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:21:31.916Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).