.png){kind=icon}
Return
HIGH-DIMENSIONAL ADDITIVE MODELING
.png){kind=icon}
OA
AI
DOI：10.1214/09-AOS692.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a new sparsity-smoothness penalty for high-dimensional generalized additive models. The combination of sparsity and smoothness is crucial for mathematical theory as well as performance for finite-sample data. We present a computationally efficient algorithm, with provable numerical convergence properties, for optimizing the penalized likelihood. Furthermore, we provide oracle results which yield asymptotic optimality of our estimator for high dimensional but sparse additive models. Finally, an adaptive version of Our sparsity-smoothness penalized approach yields large additional performance gains.
Keywords:
Group lasso
model selection
nonparametric regression
oracle inequality
penalized likelihood
sparsity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
Cited Papers
ShareSaveShareSaveLASSO-TYPE RECOVERY OF SPARSE REPRESENTATIONS FOR HIGH-DIMENSIONAL DATA.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAIShareSaveSynthesis of Mesoporous SiO2@TiO2 Core/Shell Nanospheres with Enhanced Photocatalytic Properties
PREAI
ShareSaveShareSave
View more