title: Group Sparse Additive Models.
abstract: We consider the problem of sparse variable selection in nonparametric additive models, with the prior knowledge of the structure among the covariates to encourage those variables within a group to be selected jointly. Previous works either study the group sparsity in the parametric setting (e.g., group lasso), or address the problem in the nonparametric setting without exploiting the structural information (e.g., sparse additive models). In this paper, we present a new method, called group sparse additive models (GroupSpAM), which can handle group sparsity in additive models. We generalize theℓ1/ℓ2norm to Hilbert spaces as the sparsity-inducing penalty in GroupSpAM. Moreover, we derive a novel thresholding condition for identifying the functional sparsity at the group level, and propose an efficient block coordinate descent algorithm for constructing the estimate. We demonstrate by simulation that GroupSpAM substantially outperforms the competing methods in terms of support recovery and prediction accuracy in additive models, and also conduct a comparative experiment on a real breast cancer dataset.
authors.affiliation: School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
authors.forename: Junming
authors.initials: J
authors.lastname: Yin
authors.affiliation: School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
authors.forename: Xi
authors.initials: X
authors.lastname: Chen
authors.affiliation: School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
authors.forename: Eric P
authors.initials: EP
authors.lastname: Xing