pith. machine review for the scientific record. sign in

arxiv: 1712.08734 · v1 · submitted 2017-12-23 · 💻 cs.LG

Recognition: unknown

Online Forecasting Matrix Factorization

Authors on Pith no claims yet
classification 💻 cs.LG
keywords factorizationforecastingmatrixonlineembeddingsproblemseriestime
0
0 comments X
read the original abstract

In this paper the problem of forecasting high dimensional time series is considered. Such time series can be modeled as matrices where each column denotes a measurement. In addition, when missing values are present, low rank matrix factorization approaches are suitable for predicting future values. This paper formally defines and analyzes the forecasting problem in the online setting, i.e. where the data arrives as a stream and only a single pass is allowed. We present and analyze novel matrix factorization techniques which can learn low-dimensional embeddings effectively in an online manner. Based on these embeddings a recursive minimum mean square error estimator is derived, which learns an autoregressive model on them. Experiments with two real datasets with tens of millions of measurements show the benefits of the proposed approach.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.