MUC-driven Feature Importance Measurement and Adversarial Analysis for Random Forest
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 35 references that are in the map. First posted on arXiv 25 Feb 2022.
Builds on
15 of 35 references.
References · 15
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2019Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AIcited by 1,543
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2015The Limitations of Deep Learning in Adversarial Settingscited by 784
- 2018A Benchmark for Interpretability Methods in Deep Neural Networkscited by 467
- 2017DeepTest: Automated Testing of Deep-Neural-Network-driven Autonomous Carscited by 249
- 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
- 2018Query-Efficient Hard-label Black-box Attack:An Optimization-based Approachcited by 130
- 2017Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweakingcited by 76
- 2018Structured Adversarial Attack: Towards General Implementation and Better Interpretabilitycited by 63
3 more
- 2020Generating Fluent Adversarial Examples for Natural Languagescited by 49
- 2019Robustness Verification of Tree-based Modelscited by 33
- 2021Extracting Optimal Explanations for Ensemble Trees via Logical Reasoningcited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Are We Lost in the Woods? Detecting Silent Semantic Faults for Random Forest Classifiers with Data-informed Static Analysis ↗
- 2023Towards Trustworthy and Aligned Machine Learning: A Data-centric Survey with Causality Perspectives
- 2024I Bet You Did Not Mean That: Testing Semantic Importance via Betting
- 2025Adversarial Alignment for LLMs Requires Simpler, Reproducible, and More Measurable Objectives
- 2025A Framework for Evaluating Vision-Language Model Safety: Building Trust in AI for Public Sector Applications
- 2024Backdoor in Seconds: Unlocking Vulnerabilities in Large Pre-trained Models via Model Editing
- 2025Unleashing the Power of Pre-trained Encoders for Universal Adversarial Attack Detection
- 2026When Benchmarks Lie: Evaluating Malicious Prompt Classifiers Under True Distribution Shift