Generalized Sparse Additive Model with Unknown Link Function
Peipei Yuan, Xinge You, Hong Chen, Xuelin Zhang, Qinmu Peng

TL;DR
This paper introduces GSAMUL, a novel sparse additive model that estimates component functions and an unknown link function using B-splines and neural networks, enabling variable selection and interaction detection in high-dimensional data.
Contribution
It proposes a new method combining B-splines and MLPs for simultaneous estimation of link and component functions, with theoretical convergence guarantees.
Findings
Effective in variable selection and interaction detection
Validated on synthetic and real datasets
Converges under theoretical guarantees
Abstract
Generalized additive models (GAM) have been successfully applied to high dimensional data analysis. However, most existing methods cannot simultaneously estimate the link function, the component functions and the variable interaction. To alleviate this problem, we propose a new sparse additive model, named generalized sparse additive model with unknown link function (GSAMUL), in which the component functions are estimated by B-spline basis and the unknown link function is estimated by a multi-layer perceptron (MLP) network. Furthermore, -norm regularizer is used for variable selection. The proposed GSAMUL can realize both variable selection and hidden interaction. We integrate this estimation into a bilevel optimization problem, where the data is split into training set and validation set. In theory, we provide the guarantees about the convergence of the approximate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Gaussian Processes and Bayesian Inference · Markov Chains and Monte Carlo Methods
MethodsSparse Evolutionary Training
