Nystr"om Regularization for Time Series Forecasting
Not on the map. Why?
Abstract (arXiv)
This paper focuses on learning rate analysis of Nystr"om regularization with sequential sub-sampling for τ-mixing time series. Using a recently developed Banach-valued Bernstein inequality for τ-mixing sequences and an integral operator approach based on second-order decomposition, we succeed in deriving almost optimal learning rates of Nystr"om regularization with sequential sub-sampling for τ-mixing time series. A series of numerical experiments are carried out to verify our theoretical results, showing the excellent learning performance of Nystr"om regularization with sequential sub-sampling in learning massive time series data. All these results extend the applicable range of Nystr"om regularization from i.i.d. samples to non-i.i.d. sequences.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 13 of its 67 references that are in the map. First posted on arXiv 13 Nov 2021.
Builds on
13 of 67 references.
References · 13
- 2018Deep learning for time series classification: a reviewcited by 576
- 2017Sobolev Norm Learning Rates for Regularized Least-Squares Algorithmcited by 114
- 2015Less is More: Nystr"om Computational Regularizationcited by 91
- 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 77
- 2013Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Ratescited by 65
- 2016Distributed learning with regularized least squarescited by 42
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
- 2020Distributed Kernel Ridge Regression with Communicationscited by 14
- 2015Optimal Learning Rates for Localized SVMscited by 13
- 2018Analysis of regularized Nystr"om subsampling for regression functions of low smoothnesscited by 7
- 2016Spatial Decompositions for Large Scale SVMscited by 5
- 2020Distributed Learning with Dependent Samplescited by 5
1 more
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.
3 papers.