Reluctant generalized additive modeling
From MaRDI portal
Abstract: Sparse generalized additive models (GAMs) are an extension of sparse generalized linear models which allow a model's prediction to vary non-linearly with an input variable. This enables the data analyst build more accurate models, especially when the linearity assumption is known to be a poor approximation of reality. Motivated by reluctant interaction modeling (Yu et al. 2019), we propose a multi-stage algorithm, called , that can fit sparse generalized additive models at scale. It is guided by the principle that, if all else is equal, one should prefer a linear feature over a non-linear feature. Unlike existing methods for sparse GAMs, RGAM can be extended easily to binary, count and survival data. We demonstrate the method's effectiveness on real and simulated examples.
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6122810 (Why is no real title available?)
- Additive models with trend filtering
- Component selection and smoothing in multivariate nonparametric regression
- Generalized additive models
- Hierarchical sparse modeling: a choice of two group Lasso formulations
- High-dimensional additive modeling
- How Biased is the Apparent Error Rate of a Prediction Rule?
- Model Selection and Estimation in Regression with Grouped Variables
This page was built for publication: Reluctant generalized additive modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q141337)