提出可微分激活函数ScoresActivation,让模型训练时自动学习特征重要性。
ScoresActivation: A New Activation Function for Model Agnostic Global Explainability by Design
- 在训练中嵌入特征排序机制,实现端到端可微的全局解释性。
- 特征排序速度比SHAP快150倍,仅需2秒,且与真实重要性高度一致。
- 提升模型准确率11%~29%,适合需要高可解释性的实际部署场景。
理解大型深度学习模型的决策是构建透明可信系统的关键挑战。现有事后解释方法虽能提供特征重要性见解,但与模型训练过程脱节,限制了其忠实性和实用性。本文提出一种新型可微分全局解释性方法,将特征重要性估计直接融入模型训练流程。核心是ScoresActivation函数,一种嵌入学习管道的特征排序机制。该机制使模型以可微、端到端方式根据特征对预测性能的贡献进行优先级排序。在基准数据集上的评估表明,该方法生成的特征排名具有全局忠实性、稳定性,与SHAP值及真实特征重要性高度一致,同时保持高预测性能。特征评分速度比经典SHAP方法快150倍,仅需2秒(而SHAP需300秒)。当使用10个特征(5个相关)时,分类准确率提升11.24%;使用16个特征(5个相关,11个无关)时提升29.33%,显示对无关输入的强鲁棒性。本工作弥合了模型精度与可解释性之间的鸿沟,为内在可解释机器学习提供了可扩展框架。
原文摘要 · Abstract (English)
Understanding the decision of large deep learning models is a critical challenge for building transparent and trustworthy systems. Although the current post hoc explanation methods offer valuable insights into feature importance, they are inherently disconnected from the model training process, limiting their faithfulness and utility. In this work, we introduce a novel differentiable approach to global explainability by design, integrating feature importance estimation directly into model training. Central to our method is the ScoresActivation function, a feature-ranking mechanism embedded within the learning pipeline. This integration enables models to prioritize features according to their contribution to predictive performance in a differentiable and end-to-end trainable manner. Evaluations across benchmark datasets show that our approach yields globally faithful, stable feature rankings aligned with SHAP values and ground-truth feature importance, while maintaining high predictive performance. Moreover, feature scoring is 150 times faster than the classical SHAP method, requiring only 2 seconds during training compared to SHAP's 300 seconds for feature ranking in the same configuration. Our method also improves classification accuracy by 11.24% with 10 features (5 relevant) and 29.33% with 16 features (5 relevant, 11 irrelevant), demonstrating robustness to irrelevant inputs. This work bridges the gap between model accuracy and interpretability, offering a scalable framework for inherently explainable machine learning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。