Variable selection in distributed sparse regression under memory constraints
Variable selection in distributed sparse regression under memory constraints
复制标题
内存约束下分布式稀疏回归的变量选择
DOI:
--
复制
发表时间:
2023
影响因子:
0.9
通讯作者:
Jiang Jiancheng
中科院分区:
文献类型:
--
作者:
Wang Haofeng;Jiang Xuejun;Zhou Min;Jiang Jiancheng
This paper studies variable selection using the penalized likelihood method for distributed sparse regression with large sample size n under a limited memory constraint. This is a much needed research problem to be solved in the big data era. A naive divide-and-conquer method solving this problem is to split the whole data into N parts and run each part on one of N machines, aggregate the results from all machines via averaging, and finally obtain the selected variables. However, it tends to select more noise variables, and the false discovery rate may not be well controlled. We improve it by a special designed weighted average in aggregation. Although the alternating direction method of multiplier (ADMM) can be used to deal with massive data in the literature, our proposed method reduces the computational burden a lot and performs better by mean square error in most cases. Theoretically, we establish asymptotic properties of the resulting estimators for the likelihood models with a diverging number of parameters. Under some regularity conditions we establish oracle.properties in the sense that our distributed estimator shares the same asymptotic efficiency as the estimator based on the full sample. Computationally, a distributed penalized likelihood algorithm is proposed to refine the results in the context of general likelihoods. Furthermore, the proposed.method is evaluated by simulations and a real example.