# Classification by sparse generalized additive models

arXiv: https://arxiv.org/abs/2212.01792 · HTML: https://mlsanity.com/paper/2212.01792/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 29 references that are in the map.
- First posted on arXiv 4 Dec 2022.

## Builds on (most cited first, 4 of 4)

- [High-dimensional classification by sparse logistic regression](https://mlsanity.com/paper/1706.08344/) (2017)
- [Generalized Sparse Additive Models](https://mlsanity.com/paper/1903.04641/) (2019)
- [sparsegl: An R Package for Estimating Sparse Group Lasso](https://mlsanity.com/paper/2208.02942/) (2022)
- [Generalization Error Bounds for Multiclass Sparse Linear Classifiers](https://mlsanity.com/paper/2204.06264/) (2022)

## Abstract (arXiv)

We consider (nonparametric) sparse (generalized) additive models (SpAM) for classification. The design of a SpAM classifier is based on minimizing the logistic loss with a sparse group Lasso/Slope-type penalties on the coefficients of univariate additive components' expansions in orthonormal series (e.g., Fourier or wavelets). The resulting classifier is inherently adaptive to the unknown sparsity and smoothness. We show that under certain sparse group restricted eigenvalue condition it is nearly-minimax (up to log-factors) simultaneously across the entire range of analytic, Sobolev and Besov classes. The performance of the proposed classifier is illustrated on a simulated and a real-data examples.