Sparse Neural Additive Model: Interpretable Deep Learning with Feature Selection via Group Sparsity

by   Shiyun Xu, et al.

Interpretable machine learning has demonstrated impressive performance while preserving explainability. In particular, neural additive models (NAM) offer the interpretability to the black-box deep learning and achieve state-of-the-art accuracy among the large family of generalized additive models. In order to empower NAM with feature selection and improve the generalization, we propose the sparse neural additive models (SNAM) that employ the group sparsity regularization (e.g. Group LASSO), where each feature is learned by a sub-network whose trainable parameters are clustered as a group. We study the theoretical properties for SNAM with novel techniques to tackle the non-parametric truth, thus extending from classical sparse linear models such as the LASSO, which only works on the parametric truth. Specifically, we show that SNAM with subgradient and proximal gradient descents provably converges to zero training loss as t→∞, and that the estimation error of SNAM vanishes asymptotically as n→∞. We also prove that SNAM, similar to LASSO, can have exact support recovery, i.e. perfect feature selection, with appropriate regularization. Moreover, we show that the SNAM can generalize well and preserve the `identifiability', recovering each feature's effect. We validate our theories via extensive experiments and further testify to the good accuracy and efficiency of SNAM.


page 1

page 2

page 3

page 4


Group Sparse Additive Models

We consider the problem of sparse variable selection in nonparametric ad...

Flexible, Non-parametric Modeling Using Regularized Neural Networks

Non-parametric regression, such as generalized additive models (GAMs), i...

Binary Stochastic Filtering: feature selection and beyond

Feature selection is one of the most decisive tools in understanding dat...

On the Adversarial Robustness of LASSO Based Feature Selection

In this paper, we investigate the adversarial robustness of feature sele...

A neural network with feature sparsity

We propose a neural network model, with a separate linear (residual) ter...

Sparse Interaction Additive Networks via Feature Interaction Detection and Sparse Selection

There is currently a large gap in performance between the statistically ...

E2E-FS: An End-to-End Feature Selection Method for Neural Networks

Classic embedded feature selection algorithms are often divided in two l...