A consistent deterministic regression tree for non-parametric prediction of time series

05/07/2014
by   Pierre Gaillard, et al.
0

We study online prediction of bounded stationary ergodic processes. To do so, we consider the setting of prediction of individual sequences and build a deterministic regression tree that performs asymptotically as well as the best L-Lipschitz constant predictors. Then, we show why the obtained regret bound entails the asymptotical optimality with respect to the class of bounded stationary ergodic processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2021

Short-term prediction of Time Series based on bounding techniques

In this paper it is reconsidered the prediction problem in time series f...
research
11/22/2021

On asymptotic behavior of the prediction error for a class of deterministic stationary sequences

One of the main problem in prediction theory of stationary processes X(t...
research
10/12/2022

Asymptotic behavior of the prediction error for stationary sequences

One of the main problem in prediction theory of discrete-time second-ord...
research
06/26/2019

Clustering piecewise stationary processes

The problem of time-series clustering is considered in the case where ea...
research
11/27/2021

Factor-augmented tree ensembles

This article proposes an extension for standard time-series regression t...
research
04/07/2016

Online Optimization of Smoothed Piecewise Constant Functions

We study online optimization of smoothed piecewise constant functions ov...
research
12/31/2016

Lazily Adapted Constant Kinky Inference for Nonparametric Regression and Model-Reference Adaptive Control

Techniques known as Nonlinear Set Membership prediction, Lipschitz Inter...

Please sign up or login with your details

Forgot password? Click here to reset