Abstract
Abstract–
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.
Supplementary Materials
The supplementary material consists of Lemma S.1–S.6 and the proofs of all lemmas, theorems, and corollaries.
Acknowledgments
We thank the editor, the AE, and anonymous reviewers for their insightful comments which have greatly improved the scope and quality of the article.
Disclosure Statement
The authors report there are no competing interests to declare.