资源论文Learning Theory and Algorithms for Forecasting Non-Stationary Time Series

Learning Theory and Algorithms for Forecasting Non-Stationary Time Series

2020-02-04 | |  65 |   41 |   0

Abstract 

We present data-dependent learning bounds for the general scenario of nonstationary non-mixing stochastic processes. Our learning guarantees are expressed in terms of a data-dependent measure of sequential complexity and a discrepancy measure that can be estimated from data under some mild assumptions. We use our learning bounds to devise new algorithms for non-stationary time series forecasting for which we report some preliminary experimental results.

上一篇:Unlocking neural population non-stationarity using a hierarchical dynamics model

下一篇:Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...