pith. sign in

arXiv 1705.08504 , year=

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it
abstract

Interpretability has become incredibly important as machine learning is increasingly used to inform consequential decisions. We propose to construct global explanations of complex, blackbox models in the form of a decision tree approximating the original model---as long as the decision tree is a good approximation, then it mirrors the computation performed by the blackbox model. We devise a novel algorithm for extracting decision tree explanations that actively samples new training points to avoid overfitting. We evaluate our algorithm on a random forest to predict diabetes risk and a learned controller for cart-pole. Compared to several baselines, our decision trees are both substantially more accurate and equally or more interpretable based on a user study. Finally, we describe several insights provided by our interpretations, including a causal issue validated by a physician.

years

2026 2 2019 2

verdicts

UNVERDICTED 4

representative citing papers

The Price of Interpretability

cs.LG · 2019-07-08 · unverdicted · novelty 6.0

Introduces a framework for constructing ML models via interpretable steps, generalizes standard proxies into a parametrized family of measures, and quantifies the accuracy-interpretability tradeoff via practical algorithms.

BoolXLLM: LLM-Assisted Explainability for Boolean Models

cs.AI · 2026-05-12 · unverdicted · novelty 6.0

BoolXLLM augments an existing Boolean rule learner with LLMs for feature selection, discretization thresholds, and natural-language rule translation to improve interpretability while preserving accuracy.

Optimal Explanations of Linear Models

cs.LG · 2019-07-08 · unverdicted · novelty 5.0

An optimization framework decomposes linear models into increasing-complexity sequences using coordinate updates to generate parametrized interpretability metrics.

citing papers explorer

Showing 4 of 4 citing papers.

  • The Price of Interpretability cs.LG · 2019-07-08 · unverdicted · none · ref 1 · internal anchor

    Introduces a framework for constructing ML models via interpretable steps, generalizes standard proxies into a parametrized family of measures, and quantifies the accuracy-interpretability tradeoff via practical algorithms.

  • BoolXLLM: LLM-Assisted Explainability for Boolean Models cs.AI · 2026-05-12 · unverdicted · none · ref 52

    BoolXLLM augments an existing Boolean rule learner with LLMs for feature selection, discretization thresholds, and natural-language rule translation to improve interpretability while preserving accuracy.

  • Optimal Explanations of Linear Models cs.LG · 2019-07-08 · unverdicted · none · ref 17 · internal anchor

    An optimization framework decomposes linear models into increasing-complexity sequences using coordinate updates to generate parametrized interpretability metrics.

  • Assessing Model-Agnostic XAI Methods against EU AI Act Explainability Requirements cs.CY · 2026-03-19 · unverdicted · none · ref 2 · internal anchor

    A qualitative-to-quantitative scoring framework is proposed to evaluate how well model-agnostic XAI methods support EU AI Act explainability requirements.