Forecasting with Hyper-Trees

Alexander März, Kashif Rasul
5/13/2024
cs.LGstat.ME

No official code found. Best implementation: StatMixedML/Hyper-Trees (43 stars, Apache-2.0, last commit 2025-08-08).

Abstract

We introduce the concept of Hyper-Trees and offer a new direction in applying tree-based models to time series data. Unlike conventional applications of decision trees that forecast time series directly, Hyper-Trees are designed to learn the parameters of time series models. Our framework combines the effectiveness of gradient boosted trees on tabular data with the advantages of established time series models, thereby naturally inducing a time series inductive bias to tree models. By relating the parameters of a target time series model to features, Hyper-Trees also address the issue of parameter non-stationarity. To resolve the inherent scaling issue of boosted trees when estimating a large number of target model parameters, we combine decision trees and neural networks within a unified framework. In this novel approach, the trees first generate informative representations from the input features, which a shallow network then maps to the target model parameters. With our research, we aim to explore the effectiveness of Hyper-Trees across various forecasting scenarios and to extend the application of gradient boosted trees outside their conventional use in time series modeling.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Forecasting with Hyper-Trees

433May 1, 20241 years agoApache-2.0

Similar Papers

Cite this paper

@article{mrz2024forecasting,
  title  = {Forecasting with Hyper-Trees},
  author = {Alexander März and Kashif Rasul},
  year   = {2024},
  eprint = {2405.07836},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.07836v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.07836.svg)](https://codeofpaper.com/paper/2405.07836)

Discussion