Exact Recovery of Non-Random Missing Multidimensional Time Series via Temporal Isometric Delay-Embedding Transform
Not on the map. Why?
Abstract (arXiv)
Non-random missing data is a ubiquitous yet undertreated flaw in multidimensional time series, fundamentally threatening the reliability of data-driven analysis and decision-making. Pure low-rank tensor completion, as a classical data recovery method, falls short in handling non-random missingness, both methodologically and theoretically. Hankel-structured tensor completion models provide a feasible approach for recovering multidimensional time series with non-random missing patterns. However, most Hankel-based multidimensional data recovery methods both suffer from unclear sources of Hankel tensor low-rankness and lack an exact recovery theory for non-random missing data. To address these issues, we propose the temporal isometric delay-embedding transform, which constructs a Hankel tensor whose low-rankness is naturally induced by the smoothness and periodicity of the underlying time series. Leveraging this property, we develop the textitLow-Rank Tensor Completion with Temporal Isometric Delay-embedding Transform (LRTC-TIDT) model, which characterizes the low-rank structure under the textitTensor Singular Value Decomposition (t-SVD) framework. Once the prescribed non-random sampling conditions and mild incoherence assumptions are satisfied, the proposed LRTC-TIDT model achieves exact recovery, as confirmed by simulation experiments under various non-random missing patterns. Furthermore, LRTC-TIDT consistently outperforms existing tensor-based methods across multiple real-world tasks, including network flow reconstruction, urban traffic estimation, and temperature field prediction. Our implementation is publicly available at https://github.com/HaoShu2000/LRTC-TIDT.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 49 references that are in the map. First posted on arXiv 11 Dec 2025.
Builds on
22 of 49 references.
References · 22
- 2016Recurrent Neural Networks for Multivariate Time Series with Missing Valuescited by 548
- 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 110
- 2015Exact tensor completion using t-SVDcited by 70
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2019Bayesian Temporal Factorization for Multidimensional Time Series Predictioncited by 47
- 2023Guaranteed Tensor Recovery Fused Low-rankness and Smoothnesscited by 41
- 2021Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputationcited by 35
- 2015Smooth PARAFAC Decomposition for Tensor Completioncited by 34
- 2020A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputationcited by 27
- 2016Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relationscited by 25
- 2021Low-Rank Hankel Tensor Completion for Traffic Speed Estimationcited by 22
- 2019Factor Models for High-Dimensional Tensor Time Seriescited by 20
10 more
- 2020Dictionary Learning with Low-rank Coding Coefficients for Tensor Completioncited by 19
- 2022Exact Decomposition of Joint Low Rankness and Local Smoothness Plus Sparse Matricescited by 19
- 2018Autoregressive Models for Matrix-Valued Time Seriescited by 18
- 2022Laplacian Convolutional Representation for Traffic Time Series Imputationcited by 18
- 2018Missing Slice Recovery for Tensors Using a Low-rank Model in Embedded Spacecited by 17
- 2020Scalable Low-Rank Tensor Learning for Spatiotemporal Traffic Data Imputationcited by 12
- 2019Recovery of Future Data via Convolution Nuclear Norm Minimizationcited by 11
- 2021Time Series Forecasting via Learning Convolutionally Low-Rank Modelscited by 9
- 2018Structured low-rank matrix completion for forecasting in time series analysiscited by 6
- 2025Guaranteed Multidimensional Time Series Prediction via Deterministic Tensor Completion Theorycited by 2
Built on by
Not cited yet.