Forecasting Multiple Observables with SCROLL: Score-Trained Uncertainty for Stochastic Dynamics

Pavel Prochazka
8/26/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Forecasting a stochastic dynamical system rarely means a single number: one wants several observables---future state, threshold event, regime label---each with its own likelihood. Standard multi-task recipes balance per-task losses, tuned or learned. We instead compose the observables' likelihoods in per-task free-routed last-layer beliefs on a shared backbone; this absorbs unit-dependent loss scaling into likelihood parameters learned in the same gradient pass. Stochastic dynamics supply what static benchmarks cannot: computable ground truth for the predictive variance. Results land where theory puts them: on the well-specified, homoscedastic Ornstein--Uhlenbeck process the learned predictive law recovers the analytic kernel and correctly specified baselines tie. On heteroscedastic systems (stochastic Lorenz-63, real air-quality data) the belief's input-dependent variance separates: best single-run NLL on the state and regime tasks, calibration matched only by arms whose NLL it beats, at a fraction of the tuned grids' cost. On the real series the state margin holds across five rolling origins.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{prochazka2026forecasting,
  title  = {Forecasting Multiple Observables with SCROLL: Score-Trained Uncertainty for Stochastic Dynamics},
  author = {Pavel Prochazka},
  year   = {2026},
  eprint = {2608.25898},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2608.25898v1}
}

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/2608.25898.svg)](https://codeofpaper.com/paper/2608.25898)

Discussion