DDAC-SpAM: A Distributed Algorithm for Fitting High-dimensional Sparse Additive Models with Feature Division and Decorrelation

计算机科学 去相关 外稃(植物学) 算法 分而治之算法 数学证明 可扩展性 加性模型 估计员 组分(热力学) 广义加性模型 特征选择 推论 航程(航空) 特征(语言学) 钥匙(锁) 数据挖掘 理论计算机科学 数学 人工智能 机器学习 统计 数据库 生态学 物理 几何学 禾本科 计算机安全 生物 热力学 语言学 材料科学 哲学 复合材料
作者
Yifan He,Ruiyang Wu,Yong Zhou,Yang Feng
标识
DOI:10.1080/01621459.2023.2225743
摘要

AbstractAbstract–Distributed statistical learning has become a popular technique for large-scale data analysis. Most existing work in this area focuses on dividing the observations, but we propose a new algorithm, DDAC-SpAM, which divides the features under a high-dimensional sparse additive model. Our approach involves three steps: divide, decorrelate, and conquer. The decorrelation operation enables each local estimator to recover the sparsity pattern for each additive component without imposing strict constraints on the correlation structure among variables. The effectiveness and efficiency of the proposed algorithm are demonstrated through theoretical analysis and empirical results on both synthetic and real data. The theoretical results include both the consistent sparsity pattern recovery as well as statistical inference for each additive functional component. Our approach provides a practical solution for fitting sparse additive models, with promising applications in a wide range of domains. Supplementary materials for this article are available online.KEYWORDS: Additive modelConsistencyDecorrelate and conquerDivideFeature space partitionVariable selection Supplementary MaterialsThe supplementary material consists of Lemma S.1–S.6 and the proofs of all lemmas, theorems, and corollaries.AcknowledgmentsWe thank the editor, the AE, and anonymous reviewers for their insightful comments which have greatly improved the scope and quality of the article.Disclosure StatementThe authors report there are no competing interests to declare.Additional informationFundingZhou was supported by the State Key Program of National Natural Science Foundation of China (71931004) and National Natural Science Foundation of China (92046005) and the National Key R&D Program of China (2021YFA1000100, 2021YFA1000101). Feng was supported by NIH grant 1R21AG074205-01, NYU University Research Challenge Fund, a grant from NYU School of Global Public Health, and through the NYU IT High Performance Computing resources, services, and staff expertise.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
精灵大夫完成签到,获得积分10
1秒前
ZJING9完成签到,获得积分10
2秒前
2秒前
YanJinyu完成签到,获得积分10
2秒前
茉莉花完成签到,获得积分10
3秒前
3秒前
hunbaekkkkk发布了新的文献求助10
3秒前
3秒前
4秒前
zzzqqq完成签到,获得积分10
4秒前
清脆如娆完成签到 ,获得积分10
5秒前
6秒前
lifenghou完成签到 ,获得积分10
6秒前
精灵大夫发布了新的文献求助30
6秒前
6秒前
赵田完成签到 ,获得积分10
7秒前
7秒前
Akim应助风趣白晴采纳,获得10
9秒前
LLL完成签到,获得积分10
13秒前
旭龙完成签到,获得积分10
13秒前
13秒前
大师现在发布了新的文献求助10
14秒前
王小树完成签到,获得积分10
14秒前
知性的果汁完成签到,获得积分20
16秒前
SSY完成签到,获得积分10
16秒前
SCI完成签到,获得积分10
18秒前
哈哈完成签到,获得积分10
18秒前
钱柄青发布了新的文献求助10
19秒前
隐形曼青应助大师现在采纳,获得10
19秒前
GB完成签到 ,获得积分10
20秒前
啊大大哇完成签到,获得积分10
27秒前
君临完成签到,获得积分10
28秒前
打打应助羊肉沫采纳,获得10
28秒前
萌萌发布了新的文献求助10
29秒前
小贵应助珍珠爸爸采纳,获得10
29秒前
云朵完成签到,获得积分10
29秒前
CC完成签到 ,获得积分10
29秒前
hua发布了新的文献求助30
31秒前
蕊蕊蕊完成签到 ,获得积分10
33秒前
量子星尘发布了新的文献求助10
34秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Kinesiophobia : a new view of chronic pain behavior 2000
Cronologia da história de Macau 1600
Developmental Peace: Theorizing China’s Approach to International Peacebuilding 1000
Traitements Prothétiques et Implantaires de l'Édenté total 2.0 1000
Earth System Geophysics 1000
Bioseparations Science and Engineering Third Edition 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6130850
求助须知:如何正确求助?哪些是违规求助? 7958446
关于积分的说明 16513631
捐赠科研通 5248342
什么是DOI,文献DOI怎么找? 2802879
邀请新用户注册赠送积分活动 1783891
关于科研通互助平台的介绍 1655030