English

Optimal Explanations of Linear Models

Machine Learning 2019-07-11 v1 Machine Learning

Abstract

When predictive models are used to support complex and important decisions, the ability to explain a model's reasoning can increase trust, expose hidden biases, and reduce vulnerability to adversarial attacks. However, attempts at interpreting models are often ad hoc and application-specific, and the concept of interpretability itself is not well-defined. We propose a general optimization framework to create explanations for linear models. Our methodology decomposes a linear model into a sequence of models of increasing complexity using coordinate updates on the coefficients. Computing this decomposition optimally is a difficult optimization problem for which we propose exact algorithms and scalable heuristics. By solving this problem, we can derive a parametrized family of interpretability metrics for linear models that generalizes typical proxies, and study the tradeoff between interpretability and predictive accuracy.

Keywords

Cite

@article{arxiv.1907.04669,
  title  = {Optimal Explanations of Linear Models},
  author = {Dimitris Bertsimas and Arthur Delarue and Patrick Jaillet and Sebastien Martin},
  journal= {arXiv preprint arXiv:1907.04669},
  year   = {2019}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1907.03419

R2 v1 2026-06-23T10:17:24.052Z