paper-with-me

홈 › Papers

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

2014-05-07 · Pierre Gaillard, Paul Baudin

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.

📄 PDF Abstract BibTeX arXiv:1405.1533

Code (0)

등록된 구현이 없습니다.

Tasks

PredictionregressionTime SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

TreeFlow: Going beyond Tree-based Gaussian Probabilistic Regression

2022-06-08 · Patryk Wielopolski, Maciej Zięba

The tree-based ensembles are known for their outstanding performance in classification and regression problems characterized by feature vectors represented by mixed-type variables from various ranges and domains. However…

regression

Hierarchical Embedded Bayesian Additive Regression Trees

2022-04-14 · Bruna Wundervald, Andrew Parnell, Katarina Domijan

We propose a simple yet powerful extension of Bayesian Additive Regression Trees which we name Hierarchical Embedded BART (HE-BART). The model allows for random effects to be included at the terminal node level of a set …

regression

Active Learning for Non-Parametric Regression Using Purely Random Trees

2018-12-01 · NeurIPS 2018 12 · Jack Goetz, Ambuj Tewari, Paul Zimmerman

Active learning is the task of using labelled data to select additional points to label, with the goal of fitting the most accurate model with a fixed budget of labelled points. In binary classification active learning i…

Active LearningBinary ClassificationGeneral Classificationregression

BAST: Bayesian Additive Regression Spanning Trees for Complex Constrained Domain

2021-12-01 · NeurIPS 2021 12 · Zhao Tang Luo, Huiyan Sang, Bani Mallick

Nonparametric regression on complex domains has been a challenging task as most existing methods, such as ensemble models based on binary decision trees, are not designed to account for intrinsic geometries and domain bo…

Bayesian Inferenceregression

Learning Tree Distributions by Hidden Markov Models

2018-05-31 · Davide Bacciu, Daniele Castellana

Hidden tree Markov models allow learning distributions for tree structured data while being interpretable as nondeterministic automata. We provide a concise summary of the main approaches in literature, focusing in parti…