pith. sign in

arxiv: 2005.00631 · v1 · pith:NEFF64SEnew · submitted 2020-05-01 · 💻 cs.LG · cs.AI· cs.CY· stat.ML

Evaluating and Aggregating Feature-based Model Explanations

classification 💻 cs.LG cs.AIcs.CYstat.ML
keywords explanationfeature-basedfunctionmodelaggregateaggregatingcomplexitycriteria
0
0 comments X
read the original abstract

A feature-based model explanation denotes how much each input feature contributes to a model's output for a given data point. As the number of proposed explanation functions grows, we lack quantitative evaluation criteria to help practitioners know when to use which explanation function. This paper proposes quantitative evaluation criteria for feature-based explanations: low sensitivity, high faithfulness, and low complexity. We devise a framework for aggregating explanation functions. We develop a procedure for learning an aggregate explanation function with lower complexity and then derive a new aggregate Shapley value explanation function that minimizes sensitivity.

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 6 Pith papers

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

  1. Extremal Contours: Gradient-driven contours for compact visual attribution

    cs.CV 2025-11 unverdicted novelty 7.0

    A training-free method using Fourier-parameterized star-convex contours optimized via gradients to generate compact, faithful visual attributions for image classifiers on benchmarks like ImageNet.

  2. Fairness of Explanations in Artificial Intelligence (AI): A Unifying Framework, Axioms, and Future Direction toward Responsible AI

    cs.AI 2026-05 unverdicted novelty 6.0

    A conditional invariance framework defines explanation fairness as explanations being statistically independent of protected attributes given task-relevant features, unifying existing metrics and enabling procedural b...

  3. H-Sets: Hessian-Guided Discovery of Set-Level Feature Interactions in Image Classifiers

    cs.CV 2026-04 unverdicted novelty 6.0

    H-Sets detects higher-order feature interactions in image classifiers via Hessian-guided pair merging and attributes them with IDG-Vis to generate more interpretable saliency maps than existing marginal or coarse methods.

  4. Evaluating Post-hoc Explanations of the Transformer-based Genome Language Model DNABERT-2

    cs.LG 2026-04 unverdicted novelty 5.0

    AttnLRP explanations of DNABERT-2 reliably capture known biological patterns in genomic sequences, showing that transformer-based genome language models can yield biologically meaningful insights comparable to CNNs.

  5. On the Properties of Feature Attribution for Supervised Contrastive Learning

    cs.LG 2026-04 unverdicted novelty 4.0

    Neural networks trained via supervised contrastive learning yield feature attributions that are more faithful, less complex, and more continuous than those from cross-entropy trained networks.

  6. 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.