Online Smooth Backfitting for Generalized Additive Models

被引:2
|
作者
Yang, Ying [1 ]
Yao, Fang [2 ]
Zhao, Peng [3 ,4 ]
机构
[1] Chinese Acad Sci, Acad Math & Syst Sci, Beijing, Peoples R China
[2] Peking Univ, Ctr Stat Sci, Sch Math Sci, Dept Probabil & Stat, Beijing, Peoples R China
[3] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou, Peoples R China
[4] Jiangsu Normal Univ, Res Inst Math Sci RIMS, Xuzhou, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金; 国家重点研发计划;
关键词
Algorithmic convergence; Online learning; Statistical efficiency; Streaming data; APPROXIMATE BAYESIAN COMPUTATION; CHAIN MONTE-CARLO; POINT-PROCESSES; PREDICTION; INFERENCE; FEATURES;
D O I
10.1080/01621459.2023.2182213
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We propose an online smoothing backfitting method for generalized additive models coupled with local linear estimation. The idea can be extended to general nonlinear optimization problems. The strategy is to use an appropriate-order expansion to approximate the nonlinear equations and store the coefficients as sufficient statistics which can be updated in an online manner by the dynamic candidate bandwidth method. We investigate the statistical and algorithmic convergences of the proposed method. By defining the relative statistical efficiency and computational cost, we further establish a framework to characterize the tradeoff between estimation performance and computation performance. Simulations and real data examples are provided to illustrate the proposed method and algorithm. for this article are available online.
引用
收藏
页码:1215 / 1228
页数:14
相关论文
共 50 条