Abstract
We address the problem of predicting a time series using the ARMA (autoregressive moving average) model, under minimal assumptions on the noise terms. Using regret minimization techniques, we develop effective online learning algorithms for the prediction problem, without assuming that the noise terms are Gaussian, identically distributed or even independent. Furthermore, we show that our algorithm's performances asymptotically approaches the performance of the best ARMA model in hindsight.
Original language | English |
---|---|
Pages (from-to) | 172-184 |
Number of pages | 13 |
Journal | Journal of Machine Learning Research |
Volume | 30 |
State | Published - 2013 |
Event | 26th Conference on Learning Theory, COLT 2013 - Princeton, NJ, United States Duration: 12 Jun 2013 → 14 Jun 2013 |
Keywords
- Online learning
- Regret minimization
- Time series analysis
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Statistics and Probability
- Artificial Intelligence