Statistical learning for -weakly dependent processes
Abstract
We consider statistical learning question for -weakly dependent processes, that unifies a large class of weak dependence conditions such as mixing, association,·s The consistency of the empirical risk minimization algorithm is established. We derive the generalization bounds and provide the learning rate, which, on some H\"older class of hypothesis, is close to the usual O(n-1/2) obtained in the i.i.d. case. Application to time series prediction is carried out with an example of causal models with exogenous covariates.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.