A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a selective review of statistical computation methods for massive data analysis. A huge amount of statistical methods for massive data computation have been rapidly developed in the past decades. In this work, we focus on three categories of statistical computation methods: (1) distributed computing, (2) subsampling methods, and (3) minibatch gradient techniques. The first class of literature is about distributed computing and focuses on the situation, where the dataset size is too huge to be comfortably handled by one single computer. In this case, a distributed computation system with multiple computers has to be utilized. The second class of literature is about subsampling methods and concerns about the situation, where the blacksample size of dataset is small enough to be placed on one single computer but too large to be easily processed by its memory as a whole. The last class of literature studies those minibatch gradient related optimization techniques, which have been extensively used for optimizing various deep learning models.

Cite

CITATION STYLE

APA

Li, X., Gao, Y., Chang, H., Huang, D., Ma, Y., Pan, R., … Wang, H. (2024). A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques. Statistical Theory and Related Fields. Routledge. https://doi.org/10.1080/24754269.2024.2343151

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free