Efficient functional Lasso kernel smoothing for high-dimensional additive regression
高维加性回归的高效函数型 Lasso 核平滑AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用高维加性回归与正则化推断,未提供因果、面板或其他所列细分的直接依据。
高维加性回归的高效函数型 Lasso 核平滑AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Smooth backfitting has been proposed and proved as a powerful nonparametric estimation technique for additive regression models in various settings. Existing studies are restricted to cases with a moderate number of covariates and are not directly applicable to high dimensional settings. In this paper, we develop new kernel estimators based on the idea of smooth backfitting for high dimensional additive models. We introduce a novel penalization scheme, combining the idea of functional Lasso with the smooth backfitting technique. We investigate the theoretical properties of the functional Lasso smooth backfitting estimation. For the implementation of the proposed method, we devise a simple iterative algorithm where the iteration is defined by a truncated projection operator. The algorithm has only an additional thresholding operator over the projection-based iteration of the smooth backfitting algorithm. We further present a debiased version of the proposed estimator with implementation details, and investigate its theoretical properties for statistical inference. We demonstrate the finite sample performance of the methods via simulation and real data analysis.