AR-Sieve Bootstrap for the Random Forest and a simulation-based comparison with rangerts time series prediction
원문 초록
The Random Forest (RF) algorithm can be applied to a broad spectrum of problems, including time series prediction. However, neither the classical IID (Independent and Identically distributed) bootstrap nor block bootstrapping strategies (as implemented in rangerts) completely account for the nature of the Data Generating Process (DGP) while resampling the observations. We propose the combination of RF with a residual bootstrapping technique where we replace the IID bootstrap with the AR-Sieve Bootstrap (ARSB), which assumes the DGP to be an autoregressive process. To assess the new model's predictive performance, we conduct a simulation study using synthetic data generated from different types of DGPs. It turns out that ARSB provides more variation amongst the trees in the forest. Moreover, RF with ARSB shows greater accuracy compared to RF with other bootstrap strategies. However, these improvements are achieved at some efficiency costs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
IMTS is Worth Time $\times$ Channel Patches: Visual Masked Autoencoders for Irregular Multivariate Time Series Prediction
CMoS: Rethinking Time Series Prediction Through the Lens of Chunk-wise Spatial Correlations
A tensor network approach for chaotic time series prediction
A Comparative Study of Transformer-Based Models for Multi-Horizon Blood Glucose Prediction
Predicting Graph Structure via Adapted Flux Balance Analysis
SEED: A Structural Encoder for Embedding-Driven Decoding in Time Series Prediction with LLMs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.