TL;DR
This paper introduces a Bayesian hierarchical GAM with a novel spike-and-slab LASSO prior and an efficient EM-Coordinate Descent algorithm, improving high-dimensional data analysis by balancing sparsity, flexibility, and scalability.
Contribution
It develops a new spike-and-slab LASSO prior for smooth functions and a scalable algorithm, enhancing functional selection and predictive performance in high-dimensional GAMs.
Findings
Improved predictive accuracy over existing models
Enhanced computational efficiency with the proposed algorithm
Effective functional selection in high-dimensional settings
Abstract
There are proposals that extend the classical generalized additive models (GAMs) to accommodate high-dimensional data () using group sparse regularization. However, the sparse regularization may induce excess shrinkage when estimating smooth functions, damaging predictive performance. Moreover, most of these GAMs consider an "all-in-all-out" approach for functional selection, rendering them difficult to answer if nonlinear effects are necessary. While some Bayesian models can address these shortcomings, using Markov chain Monte Carlo algorithms for model fitting creates a new challenge, scalability. Hence, we propose Bayesian hierarchical generalized additive models as a solution: we consider the smoothing penalty for proper shrinkage of curve interpolation via reparameterization. A novel two-part spike-and-slab LASSO prior for smooth functions is developed to address the sparsity…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
