3 papers
cs.LG2026
Optimal Counterfactual Search in Tree Ensembles: A Study Across Modeling and Solution Paradigms
Awa Khouna, Youssouf Emine, Julien Ferry +1
Trust in counterfactual explanations depends critically on whether their recommended changes are truly minimal: suboptimal explanations may vastly overshoot the actual changes need…
math.OC2025
The Branch-and-Bound Tree Closure
Marius Roland, Nagisa Sugishita, Alexandre Forel +3
This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We int…
cs.LG2025
Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
Youssouf Emine, Alexandre Forel, Idriss Malek +1
Tree ensembles, including boosting methods, are highly effective and widely used for tabular data. However, large ensembles lack interpretability and require longer inference times…