pith. sign in

arxiv: 1806.07538 · v2 · pith:JGPV76RInew · submitted 2018-06-20 · 💻 cs.LG · stat.ML

Towards Robust Interpretability with Self-Explaining Neural Networks

classification 💻 cs.LG stat.ML
keywords modelsinterpretabilityself-explainingcomplexexplanationsfaithfulnesslearningstability
0
0 comments X
read the original abstract

Most recent work on interpretability of complex machine learning models has focused on estimating $\textit{a posteriori}$ explanations for previously trained models around specific predictions. $\textit{Self-explaining}$ models where interpretability plays a key role already during learning have received much less attention. We propose three desiderata for explanations in general -- explicitness, faithfulness, and stability -- and show that existing methods do not satisfy them. In response, we design self-explaining models in stages, progressively generalizing linear classifiers to complex yet architecturally explicit models. Faithfulness and stability are enforced via regularization specifically tailored to such models. Experimental results across various benchmark datasets show that our framework offers a promising direction for reconciling model complexity and interpretability.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Landseer: Exploring the Machine Learning Defense Landscape

    cs.CR 2026-05 unverdicted novelty 6.0

    Landseer offers a containerized modular system to integrate and evaluate combinations of machine learning defenses, with an initial analysis of 35 defenses highlighting replicability challenges.

  2. DINO-QPM: Adapting Visual Foundation Models for Globally Interpretable Image Classification

    cs.CV 2026-04 unverdicted novelty 5.0

    DINO-QPM adapts frozen DINOv2 models via average-pooled patch embeddings and a sparsity loss to deliver both higher classification accuracy and human-interpretable global explanations.

  3. Evaluating Local Explainability Metrics for Machine Learning Models on Tabular Data

    cs.LG 2026-05 unverdicted novelty 3.0

    Benchmark of local explainability methods on tabular data finds explanation quality driven primarily by dataset complexity rather than model predictive performance.