Optimal Sampling Designs for Multi-dimensional Streaming Time Series with Application to Power Grid Sensor Data
Not on the map. Why?
Abstract (arXiv)
The Internet of Things (IoT) system generates massive high-speed temporally correlated streaming data and is often connected with online inference tasks under computational or energy constraints. Online analysis of these streaming time series data often faces a trade-off between statistical efficiency and computational cost. One important approach to balance this trade-off is sampling, where only a small portion of the sample is selected for the model fitting and update. Motivated by the demands of dynamic relationship analysis of IoT system, we study the data-dependent sample selection and online inference problem for a multi-dimensional streaming time series, aiming to provide low-cost real-time analysis of high-speed power grid electricity consumption data. Inspired by D-optimality criterion in design of experiments, we propose a class of online data reduction methods that achieve an optimal sampling criterion and improve the computational efficiency of the online analysis. We show that the optimal solution amounts to a strategy that is a mixture of Bernoulli sampling and leverage score sampling. The leverage score sampling involves auxiliary estimations that have a computational advantage over recursive least squares updates. Theoretical properties of the auxiliary estimations involved are also discussed. When applied to European power grid consumption data, the proposed leverage score based sampling methods outperform the benchmark sampling method in online estimation and prediction. The general applicability of the sampling-assisted online estimation method is assessed via simulation studies.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 70 references that are in the map. First posted on arXiv 14 Mar 2023.
Builds on
17 of 70 references.
References · 17
- 2014Sketching as a Tool for Numerical Linear Algebracited by 285
- 2018Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clusteringcited by 94
- 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 76
- 2013A Statistical Perspective on Algorithmic Leveragingcited by 38
- 2017Optimal Subsampling for Large Sample Logistic Regressioncited by 28
- 2020Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators with Massive Datacited by 12
- 2017Information-Based Optimal Subdata Selection for Big Data Linear Regressioncited by 10
- 2020Asymptotic Analysis of Sampling Estimators for Randomized Numerical Linear Algebra Algorithmscited by 10
- 2018Joint Status Sampling and Updating for Minimizing Age of Information in the Internet of Thingscited by 9
- 2019LSAR: Efficient Leverage Score Sampling Algorithm for the Analysis of Big Time Series Datacited by 8
- 2021Orthogonal Subsampling for Big Data Linear Regressioncited by 5
- 2020LowCon: A design-based subsampling approach in a misspecified linear modeLcited by 4
5 more
- 2013On statistics, computation and scalabilitycited by 2
- 2020Sequential online subsampling for thinning experimental designscited by 2
- 2015Online Censoring for Large-Scale Regressions with Application to Streaming Big Datacited by 1
- 2020Database of Power Grid Frequency Measurementscited by 1
- 2022Sampling Strategies for Static Powergrid Modelscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Core-elements Subsampling for Alternating Least Squarescited by 0
- 2025Core-elements Subsampling for Alternating Least Squares22 Sep 2025