Performance is closest to the oracle under autoregressive, threshold, stochastic-volatility, heavy-tailed, and variance-break dynamics, while local trends and regime switching are more challenging.
Abstract
Rollcast is a probabilistic forecasting method for univariate time series that combines a compact set of rolling statistical anchors rather than relying on a single global model. Rolling means, medians, extrema, regression endpoints, and quantiles define candidate forecast locations and a representation of the current state. A state-dependent softmax gate learns anchor probabilities by minimizing negative log predictive density, while residual distributions retrieved from similar historical states provide local uncertainty. Recursive simulation propagates the resulting mixture over multiple forecast horizons. The method is evaluated in a Monte Carlo study covering eight data-generating processes, including autoregressive, random-walk, local-trend, threshold, regime-switching, stochastic-volatility, heavy-tailed, and variance-break dynamics. Across 2,000 independent fitted series, Rollcast is compared with the true conditional predictive distribution generated by an oracle simulator. Overall empirical coverage is 86.2% for nominal 90% intervals and 91.5% for nominal 95% intervals. Predictive intervals are on average 13.6% wider than the oracle at the 90% level, while CRPS is 14.4% higher than oracle CRPS. Performance is closest to the oracle under autoregressive, threshold, stochastic-volatility, heavy-tailed, and variance-break dynamics, while local trends and regime switching are more challenging. The results indicate that Rollcast can construct competitive probabilistic forecasts from simple, interpretable local summaries, while also identifying limitations in calibration and recursive uncertainty propagation.
TEMPER, the Temporal Encoder-Masked Probabilistic Ensemble Regressor, a univariate time-series forecasting algorithm that combines a temporal autoencoder, a differentiable masked neural decision forest, continuous ranked probability score (CRPS) training, and Gaussian-mixture post-processing is presented.
WIRED separates adaptive marginal expert aggregation from dependence reconstruction; the benchmark supports explicit dependence modeling, but shows that the current CRPS-extrapolated softmax weighting is not yet robust enough to dominate simpler bootstrap or equal-weight alternatives.
Recent probabilistic weather forecasters train stochastic predictors with the continuous ranked probability score (CRPS) to generate each ensemble member in a single forward pass. These models learn the predictive distribution from the forecast context alone, which becomes difficult at longer forecast horizons where un...
Joonhyeong Park, G. Nam, Hyungi Lee et al.· 1 citation
The results emphasize leakage-free evaluation, estimator robustness, and strong conventional benchmarks when assessing fractional-feature machine-learning frameworks for daily financial returns.
Yuyun Hidayat, T. Purwandari, Waway Tiswaya et al.· Fractal and Fractional· 0 citations
KReF, a training-free retrieval framework that treats retrieved historical futures as a query local empirical predictive distribution, is proposed, establishing retrieval as a useful and underexplored inductive bias for LTSF.
Gated News-Event Fusion (GNEF), an availability-aware model mapping price sequences, engineered market features, and news features to direction probabilities and a nonnegative return-magnitude estimate, is developed, providing selective support for residual fusion but do not establish a consistent advantage across equi...
Fras Aljrise, Abdulaziz A. Alsulami, F. Alallah et al.· Mathematics· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.