3 papers
cs.AI2026
Learning to Rank the Initial Branching Order of SAT Solvers
Arvid Eriksson, Gabriel Poesia, Roman Bresson +2
Finding good branching orders is key to solving SAT problems efficiently, but finding such branching orders is a difficult problem. Using a learning based approach to predict a goo…
cs.LG2025
Prediction via Shapley Value Regression
Amr Alkhatib, Roman Bresson, Henrik Boström +1
Shapley values have several desirable, theoretically well-supported, properties for explaining black-box model predictions. Traditionally, Shapley values are computed post-hoc, lea…
cs.LG2025
Obtaining Example-Based Explanations from Deep Neural Networks
Genghua Dong, Henrik Boström, Michalis Vazirgiannis +1
Most techniques for explainable machine learning focus on feature attribution, i.e., values are assigned to the features such that their sum equals the prediction. Example attribut…