4 papers
Using Certifying Constraint Solvers for Generating Step-wise Explanations
Ignace Bleukx, Maarten Flippo, Bart Bogaerts +2
In the field of Explainable Constraint Solving, it is common to explain to a user why a problem is unsatisfiable. A recently proposed method for this is to compute a sequence of ex…
SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration
Elif Arslan, Jacobus G. M. van der Linden, Serge Hoogendoorn +2
Sparse decision tree learning provides accurate and interpretable predictive models that are ideal for high-stakes applications by finding the single most accurate tree within a (s…
Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
Catalin E. Brita, Jacobus G. M. van der Linden, Emir Demirović
Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not s…
Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems
Jaynta Mandi, Emir Demirović, Peter. J Stuckey +1
Combinatorial optimization assumes that all parameters of the optimization problem, e.g. the weights in the objective function is fixed. Often, these weights are mere estimates and…