## LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Data

### Ali Eshragh · Fred Roosta · Asef Nazari · Michael Mahoney

##### Hall J #1009

Keywords: [ JMLR ] [ Journal Track ]

[ Abstract ]
[]
Wed 30 Nov 2 p.m. PST — 4 p.m. PST

Abstract: We apply methods from randomized numerical linear algebra (RandNLA) to develop improved algorithms for the analysis of large-scale time series data. We first develop a new fast algorithm to estimate the leverage scores of an autoregressive (AR) model in big data regimes. We show that the accuracy of approximations lies within $(1+\mathcal{O}({\varepsilon}))$ of the true leverage scores with high probability. These theoretical results are subsequently exploited to develop an efficient algorithm, called LSAR, for fitting an appropriate AR model to big time series data. Our proposed algorithm is guaranteed, with high probability, to find the maximum likelihood estimates of the parameters of the underlying true AR model and has a worst case running time that significantly improves those of the state-of-the-art alternatives in big data regimes. Empirical results on large-scale synthetic as well as real data highly support the theoretical results and reveal the efficacy of this new approach.

Chat is not available.