Structured low-rank matrix completion for forecasting in time series analysis

Abstract

In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a rank constraint. We consider a matrix completion problem for Hankel matrices and a convex relaxation based on the nuclear norm. Based on new theoretical results and a number of numerical and real examples, we investigate the cases when the proposed approach can work. Our results highlight the importance of choosing a proper weighting scheme for the known observations.

25 pages, 12 figures

Cited by in corpus (6)

• Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputation
• Low-Rank Autoregressive Tensor Completion for Multivariate Time Series Forecasting
• Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
• Low Rank Forecasting
• Time series forecasting from partial observations via Non-negative Matrix Factorization
• Tight Risk Bound for High Dimensional Time Series Completion