Battey, HSHSBatteyFan, JJFanLiu, HHLiuLu, JJLuZhu, ZZZhu2017-07-222018-05-032018-06-01Annals of Statistics, 2018, 46 (3), pp.1352-13820090-5364http://hdl.handle.net/10044/1/48600This paper studies hypothesis testing and parameter estimation in the context of the divide-and-conquer algorithm. In a unified likelihood-based framework, we propose new test statistics and point estimators obtained by aggregating various statistics from k subsamples of size n/k, where n is the sample size. In both low dimensional and sparse high dimensional settings, we address the important question of how large k can be, as n grows large, such that the loss of efficiency due to the divide-and-conquer algorithm is negligible. In other words, the resulting estimators have the same inferential efficiencies and estimation rates as an oracle with access to the full sample. Thorough numerical results are provided to back up the theory.© Institute of Mathematical Statistics, 2018Science & TechnologyPhysical SciencesStatistics & ProbabilityMathematicsDivide and conquerdebiasingmassive datathresholdingNONCONCAVE PENALIZED LIKELIHOODVARIABLE SELECTIONCONFIDENCE-INTERVALSNP-DIMENSIONALITYGENERAL-THEORYLINEAR-MODELSREGRESSIONREGIONSLASSORATES62F10Divide and conquerPrimary 62F05debiasingmassive datasecondary 62F12thresholding0102 Applied Mathematics0104 Statistics1403 EconometricsStatistics & ProbabilityJournal Articlehttps://www.dx.doi.org/10.1214/17-AOS1587