返回
Neural partially linear additive model
DOI:10.1007/s11704-023-2662-3.png)
摘要
En 中文
Interpretability has drawn increasing attention in machine learning. Most works focus on post-hoc explanations rather than building a self-explaining model. So, we propose a Neural Partially Linear Additive Model (NPLAM), which automatically distinguishes insignificant, linear, and nonlinear features in neural networks. On the one hand, neural network construction fits data better than spline function under the same parameter amount; on the other hand, learnable gate design and sparsity regular-term maintain the ability of feature selection and structure discovery. We theoretically establish the generalization error bounds of the proposed method with Rademacher complexity. Experiments based on both simulations and real-world datasets verify its good performance and interpretability.
Keyword:
feature selection
structure discovery
partially linear additive model
neural network
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
Interpretable machine learning: Fundamental principles and 10 grand challenges可解释的机器学习: 基本原则和十大挑战
STATISTICS SURVEYS
IF15.4
The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation在回归分析评估中,决定系数R平方比SMAPE,MAE,MAPE,MSE和RMSE更具信息性

