Divide-and-conquer information-based optimal subdata selection algorithm
From MaRDI portal
Abstract: The information-based optimal subdata selection (IBOSS) is a computationally efficient method to select informative data points from large data sets through processing full data by columns. However, when the volume of a data set is too large to be processed in the available memory of a machine, it is infeasible to implement the IBOSS procedure. This paper develops a divide-and-conquer IBOSS approach to solving this problem, in which the full data set is divided into smaller partitions to be loaded into the memory and then subsets of data are selected from each partitions using the IBOSS algorithm. We derive both finite sample properties and asymptotic properties of the resulting estimator. Asymptotic results show that if the full data set is partitioned randomly and the number of partitions is not very large, then the resultant estimator has the same estimation efficiency as the original IBOSS estimator. We also carry out numerical experiments to evaluate the empirical performance of the proposed method.
Recommendations
- Subset selection algorithm based on mutual information
- Information-based optimal subdata selection for non-linear models
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- scientific article; zbMATH DE number 3940420
- Subdata selection algorithm for linear model discrimination
- Best subset selection via a modern optimization lens
- Subdata selection based on orthogonal array for big data
- Information-based optimal subdata selection for big data logistic regression
Cites work
- scientific article; zbMATH DE number 193528 (Why is no real title available?)
- A split-and-conquer approach for analysis of
- A statistical perspective on algorithmic leveraging
- Aggregated estimating equation estimation
- An online updating approach for testing the proportional hazards assumption with streams of survival data
- Computational Limits of A Distributed Algorithm For Smoothing Spline
- Distributed testing and estimation under sparse high dimensional models
- Fast approximation of matrix coherence and statistical leverage
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Julia: a fresh approach to numerical computing
- On the relative stability of large order statistics
- Optimal subsampling for large sample logistic regression
- Optimal subsampling for softmax regression
Cited in
(14)- A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques
- Optimal subsampling for least absolute relative error estimators with massive data
- Orthogonal subsampling for big data linear regression
- More efficient estimation for logistic regression with optimal subsamples
- Optimal subsampling for modal regression in massive data
- Entropy-based subsampling methods for big data
- Subdata selection based on orthogonal array for big data
- Optimal Poisson subsampling for softmax regression
- A distance metric-based space-filling subsampling method for nonparametric models
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Optimal subsampling algorithms for big data regressions
- Divide and conquer for accelerated failure time model with massive time‐to‐event data
- A Systematic View of Information-Based Optimal Subdata Selection: Algorithm Development, Performance Evaluation, and Application in Financial Data
- A Subsampling Method for Regression Problems Based on Minimum Energy Criterion
This page was built for publication: Divide-and-conquer information-based optimal subdata selection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321778)
