Pith. sign in

REVIEW 1 cited by

Feature Importance Measure for Non-linear Learning Algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.07567 v1 pith:IOQCOXSB submitted 2016-11-22 cs.AI cs.LGstat.ML

classification cs.AIcs.LGstat.ML
keywords featureimportancelearningpredictionfeaturesnon-linearaccuraciescomplex
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Complex problems may require sophisticated, non-linear learning methods such as kernel machines or deep neural networks to achieve state of the art prediction accuracies. However, high prediction accuracies are not the only objective to consider when solving problems using machine learning. Instead, particular scientific applications require some explanation of the learned prediction function. Unfortunately, most methods do not come with out of the box straight forward interpretation. Even linear prediction functions are not straight forward to explain if features exhibit complex correlation structure. In this paper, we propose the Measure of Feature Importance (MFI). MFI is general and can be applied to any arbitrary learning machine (including kernel machines and deep learning). MFI is intrinsically non-linear and can detect features that by itself are inconspicuous and only impact the prediction function through their interaction with other features. Lastly, MFI can be used for both --- model-based feature importance and instance-based feature importance (i.e, measuring the importance of a feature for a particular data point).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Unlocking the Black Box: Analysing the EU Artificial Intelligence Act's Framework for Explainability in AI

    cs.CY 2025-01 conditional novelty 2.0 of 10

    A legal review arguing that explainability is central to the EU AI Act but is not yet translated into concrete technical and legal standards.

Pith tools