Pith. sign in

REVIEW

MUC-driven Feature Importance Measurement and Adversarial Analysis for Random Forest

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 2202.12512 v1 pith:RIKW4I4W submitted 2022-02-25 cs.LG

classification cs.LG
keywords adversarialanalysisfeatureimportancemethodapproachforestmeasurement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The broad adoption of Machine Learning (ML) in security-critical fields demands the explainability of the approach. However, the research on understanding ML models, such as Random Forest (RF), is still in its infant stage. In this work, we leverage formal methods and logical reasoning to develop a novel model-specific method for explaining the prediction of RF. Our approach is centered around Minimal Unsatisfiable Cores (MUC) and provides a comprehensive solution for feature importance, covering local and global aspects, and adversarial sample analysis. Experimental results on several datasets illustrate the high quality of our feature importance measurement. We also demonstrate that our adversarial analysis outperforms the state-of-the-art method. Moreover, our method can produce a user-centered report, which helps provide recommendations in real-life applications.

Discussion (0). Sign in to comment.

Pith tools