- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Latent Jump Models (LJMs) with Scan-Parallel Variational Inference (SPVI) for irregular time series forecasting. The framework models latent dynamics through deterministic flows and stochastic events, while using structured affine transitions to enable parallel state computation. Experiments on synthetic and real-world datasets demonstrate competitive forecasting performance and substantial computational acceleration.
Critical strengths
- The matched-model runtime experiments demonstrate substantial acceleration in posterior state computation.
Critical weaknesses
-
The proposed parallelization relies on strong structural constraints, including exponential decay between events and block-triangular affine jump transitions. The experiments do not sufficiently evaluate the resulting loss of expressiveness, and the synthetic event-driven benchmarks do not directly test state-dependent event arrival mechanisms.
-
The framework reconstructs complete historical latent-event configurations, but its advantage over directly inferring the current latent state for forecasting remains unclear. Without a controlled comparison, the practical necessity of this additional inference process is insufficiently established.
Questions for authors
Could the authors compare the proposed historical event inference with a direct terminal-state inference approach using a comparable forecasting model in the ablation study?
We thank the reviewer for their careful assessment of our work. We address the raised points below. Tables R1–R8 are presented in the general response and Table A1 is shown below.
Weakness 1, first part: loss of expressiveness from the exponential decay and the block-triangular jump transitions. We relaxed each constraint separately and measured the change (Section 2 of the general response).
The two constraints therefore cost about 18% in CRPS on deterministic rotation, and the rotating flow recovers this while keeping the scans. On the additive-jump systems, the block-triangular map costs at most 2.6% or is better.
Weakness 1, second part: state-dependent event arrival mechanisms. Tables R1 and R2 add two systems in which event arrivals depend on the latent state. In the state-dependent PDMP, the event intensity and the mark distribution are functions of the latent state. In the Hawkes process, each event raises the intensity of later events through an excitation state that is not observed. With every baseline at its best setting, LJM has the lowest CRPS and the highest LPD on both systems: 0.2043 against 0.2222 for the best baseline (NCDSSM) on the PDMP, and 0.2322 against 0.2466 for the best baseline (Latent SDE) on the Hawkes process.
We also tested whether the state dependence of LJM's own prior matters (Table R6). A constant prior rate raises CRPS by 1.9% and 1.5% and lowers LPD from −0.798 to −1.052 and from −2.376 to −3.397. A constant prior mark law raises CRPS by 10% and 13%, and both together by 38% and 67%. The held-out ELBO falls in every case.
Weakness 2 and Question: historical event inference versus direct terminal-state inference. Under our Markov model, future predictions depend on the context through the posterior distribution of the terminal state. We therefore compared LJM with direct terminal-state inference on REFIT (Table A1). The direct baseline uses the same encoder backbone, dynamics and decoder architectures, and prior forecast simulation procedure, but outputs a distribution over the terminal state without inferring historical events. LJM uses a 512-minute context, whereas the fixed-context direct baseline uses 482 minutes to match the training budget.
The direct baseline is trained with a forecast-window ELBO: the expected log-likelihood of the next 30 minutes, minus the terminal-state KL to a reference prior N(0,I) and the event KL over the forecast window. We also train a variant with the context length sampled uniformly between 30 and 482 minutes.
LJM achieves lower CRPS and RMSE than both direct-state baselines under these protocols. These results support the effectiveness of our path-based learning approach relative to the tested direct-state baselines. Because the context lengths and training objectives differ, this is an end-to-end comparison and does not isolate the contribution of reconstructing historical events.
Table A1. REFIT: LJM against direct inference of the terminal state (test windows; each direct model at its validation-selected learning rate).