Abstract

We address the problem of fast estimation of ordinary least squares (OLS) from large amounts of data We propose three methods which solve the big data problem by subsampling the covariance matrix using either a single or two stage estimation. All three run in the order ofp size of input i.e. O(np) and our best method, Uluru, gives an error bound of which is independent of the amount of subsampling as long as it is above a threshold. We provide theoretical bounds for our algorithms in the fixed design (with Randomized Hadamard preconditioning) as well as sub-Gaussian random design setting. We also compare the performance of our methods on synthetic and real-world datasets and show that if observations are i.i.d., sub-Gaussian then one can directly subsample without the expensive Randomized Hadamard preconditioning without loss of accuracy.