返回
HIGH-DIMENSIONAL ADDITIVE MODELING
DOI:10.1214/09-AOS692.png)
摘要
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.
Keyword:
Group lasso
model selection
nonparametric regression
oracle inequality
penalized likelihood
sparsity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
LASSO-TYPE RECOVERY OF SPARSE REPRESENTATIONS FOR HIGH-DIMENSIONAL DATA高维数据稀疏表示的LASSO型恢复
ANNALS OF STATISTICS
IF3.7

