Machines Explaining Linear Programs
David Steinmann, Matej Ze\v{c}evi\'c, Devendra Singh Dhami and, Kristian Kersting

TL;DR
This paper adapts and evaluates attribution methods to explain the influence of inputs on linear programs, enhancing interpretability of these optimization models in machine learning.
Contribution
It extends neural network attribution techniques to linear programs and assesses their effectiveness and limitations in providing explanations.
Findings
Attribution methods can generate useful explanations for linear programs.
Neural attribution methods may have limitations when applied directly to LPs.
Challenges arise when LPs have multiple optimal solutions.
Abstract
There has been a recent push in making machine learning models more interpretable so that their performance can be trusted. Although successful, these methods have mostly focused on the deep learning methods while the fundamental optimization methods in machine learning such as linear programs (LP) have been left out. Even if LPs can be considered as whitebox or clearbox models, they are not easy to understand in terms of relationships between inputs and outputs. As a linear program only provides the optimal solution to an optimization problem, further explanations are often helpful. In this work, we extend the attribution methods for explaining neural networks to linear programs. These methods explain the model by providing relevance scores for the model inputs, to show the influence of each input on the output. Alongside using classical gradient-based attribution methods we also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI) · Machine Learning and Algorithms
