Classification by sparse additive models

12/04/2022
by   Felix Abramovich, et al.
0

We consider (nonparametric) sparse 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 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 it is nearly-minimax (up to log-factors) within the entire range of analytic, Sobolev and Besov classes, and illustrate its performance on the real-data example.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2020

Adaptive Estimation In High-Dimensional Additive Models With Multi-Resolution Group Lasso

In additive models with many nonparametric components, a number of regul...
research
04/19/2023

Minimax Signal Detection in Sparse Additive Models

Sparse additive models are an attractive choice in circumstances calling...
research
06/18/2012

Group Sparse Additive Models

We consider the problem of sparse variable selection in nonparametric ad...
research
05/01/2017

Convex-constrained Sparse Additive Modeling and Its Extensions

Sparse additive modeling is a class of effective methods for performing ...
research
04/13/2022

Generalization Error Bounds for Multiclass Sparse Linear Classifiers

We consider high-dimensional multiclass classification by sparse multino...
research
08/18/2023

Sharp minimax optimality of LASSO and SLOPE under double sparsity assumption

This paper introduces a rigorous approach to establish the sharp minimax...
research
02/26/2023

Independence-Encouraging Subsampling for Nonparametric Additive Models

The additive model is a popular nonparametric regression method due to i...

Please sign up or login with your details

Forgot password? Click here to reset