Tree-based Learning for High-Fidelity Prediction of Chaos
Not on the map. Why?
Abstract (arXiv)
Model-free forecasting of the temporal evolution of chaotic systems is crucial but challenging. Existing solutions require hyperparameter tuning, significantly hindering their wider adoption. In this work, we introduce a tree-based approach not requiring hyperparameter tuning: TreeDOX. It uses time delay overembedding as explicit short-term memory and Extra-Trees Regressors to perform feature reduction and forecasting. We demonstrate the state-of-the-art performance of TreeDOX using the Henon map, Lorenz and Kuramoto-Sivashinsky systems, and the real-world Southern Oscillation Index.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 51 references that are in the map. First posted on arXiv 12 Mar 2024.
Builds on
9 of 51 references.
References · 9
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2021Tabular Data: Deep Learning is Not All You Needcited by 535
- 2021Next Generation Reservoir Computingcited by 160
- 2018Hyperparameters and Tuning Strategies for Random Forestcited by 84
- 2020Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligencecited by 82
- 2020Time Series Forecasting Using LSTM Networks: A Symbolic Approachcited by 25
- 2016Bayesian optimization of hyper-parameters in reservoir computingcited by 13
- 2023Model-free tracking control of complex dynamical trajectories with machine learningcited by 13
Built on by
Not cited yet.