arXiv:1905.09849
Computationally Efficient Feature Significance and Importance for Machine Learning Models
원문 초록
We develop a simple and computationally efficient significance test for the features of a machine learning model. Our forward-selection approach applies to any model specification, learning task and variable type. The test is non-asymptotic, straightforward to implement, and does not require model refitting. It identifies the statistically significant features as well as feature interactions of any order in a hierarchical manner, and generates a model-free notion of feature importance. Experimental and empirical results illustrate its performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Explainable Debugger for Black-box Machine Learning Models
Enhancing interpretability of rule-based classifiers through feature graphs
Profiling Electric Vehicles via Early Charging Voltage Patterns
The Reader is the Metric: How Textual Features and Reader Profiles Explain Conflicting Evaluations of AI Creative Writing
Multi-criteria Rank-based Aggregation for Explainable AI
EPIC: Explanation of Pretrained Image Classification Networks via Prototype
토론
이 논문과 연결된 포럼 글이 아직 없습니다.