arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.00735stat.COstat.AP
收藏

快速分治稀疏Cox回归

A Fast Divide-and-Conquer Sparse Cox Regression

Yan Wang, Nathan Palmer, Qian Di, Joel Schwartz, Isaac Kohane, Tianxi Cai

摘要:

我们提出了一个计算和统计上有效的分而治之(DAC)算法,以适应稀疏Cox回归的大规模数据集的样本量$n_0$是非常大的,协变量的尺寸$p$不小,但$n_0\gg p$。该算法通过一步线性近似,然后通过最小二乘近似的偏似然(PL)实现计算效率。这些序列的线性化使我们能够最大化的PL只有一个小的子集,并通过一个快速近似的PL进行惩罚估计。该算法适用于时间无关和时间依赖生存数据的分析。仿真结果表明,所提出的DAC算法大大优于基于全样本的估计器和现有的DAC算法的计算速度方面,而它实现了类似的统计效率的基于全样本的估计器。该算法被应用到一个非常大的时间无关生存数据集和一个非常大的时间依赖生存数据集,用于预测医疗保险心力衰竭患者30天内的心力衰竭特异性再入院。

英文摘要:

We propose a computationally and statistically efficient divide-and-conquer (DAC) algorithm to fit sparse Cox regression to massive datasets where the sample size $n_0$ is exceedingly large and the covariate dimension $p$ is not small but $n_0\gg p$. The proposed algorithm achieves computational efficiency through a one-step linear approximation followed by a least square approximation to the partial likelihood (PL). These sequences of linearization enable us to maximize the PL with only a small subset and perform penalized estimation via a fast approximation to the PL. The algorithm is applicable for the analysis of both time-independent and time-dependent survival data. Simulations suggest that the proposed DAC algorithm substantially outperforms the full sample-based estimators and the existing DAC algorithm with respect to the computational speed, while it achieves similar statistical efficiency as the full sample-based estimators. The proposed algorithm was applied to an extraordinarily large time-independent survival dataset and an extraordinarily large time-dependent survival dataset for the prediction of heart failure-specific readmission within 30 days among Medicare heart failure patients.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑