Least Squares Approximation for a Distributed System

Abstract

In this work, we develop a distributed least squares approximation (DLSA) method that is able to solve a large family of regression problems (e.g., linear regression, logistic regression, and Cox's model) on a distributed system. By approximating the local objective function using a local quadratic form, we are able to obtain a combined estimator by taking a weighted average of local estimators. The resulting estimator is proved to be statistically as efficient as the global estimator. Moreover, it requires only one round of communication. We further conduct a shrinkage estimation based on the DLSA estimation using an adaptive Lasso approach. The solution can be easily obtained by using the LARS algorithm on the master node. It is theoretically shown that the resulting estimator possesses the oracle property and is selection consistent by using a newly designed distributed Bayesian information criterion (DBIC). The finite sample performance and computational efficiency are further illustrated by an extensive numerical study and an airline dataset. The airline dataset is 52 GB in size. The entire methodology has been implemented in Python for a {\it de-facto} standard Spark system. The proposed DLSA algorithm on the Spark system takes 26 minutes to obtain a logistic regression estimator, which is more efficient and memory friendly than conventional methods.

References in corpus (6)

• Nearly unbiased variable selection under minimax concave penalty
• On the adaptive elastic-net with a diverging number of parameters
• One-step sparse estimates in nonconcave penalized likelihood models
• Optimal Subsampling for Large Sample Logistic Regression
• Distributed Estimation, Information Loss and Exponential Families
• Distributed Feature Screening via Componentwise Debiasing

Cited by in corpus (5)

• Distributed ARIMA Models for Ultra-long Time Series
• A review of distributed statistical inference
• A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques
• On the asymptotic properties of a bagging estimator with a massive dataset
• Grid Point Approximation for Distributed Nonparametric Smoothing and Prediction