- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces a state space operator for river discharge and flood forecasting that combines the following: (1) a state-space model inspired by Mamba-2; (2) a feature-space routing mechanism to account for the river structure; (3) a loss function based on fair continuous ranked probability score (CRPS); and (4) a warmup scheme to reduce distribution shifts between the encoder and forecasting engine. The experiments compare the proposed approach against multiple alternatives (DRUM, ED-LSTM, ME-LSTM, RiverMamba, and IFAS) using a benchmark combining EFAS reanalysis data and GRDC and CAMELS station data. The results show that the proposed approach outperforms the baselines in terms of accuracy metrics for both reanalysis data and gauged observations.
Critical strengths
S1) The paper addresses a relevant problem: predicting river discharge (or streamflow)
S2) The idea of combining LLD information as network topology for state-space modeling in river networks seems novel.
S3) The CRPS loss and the warmup procedure are interesting and useful extensions over RiverMamba.
Critical weaknesses
W1) Methodological novelty needs clarification: many ideas in the paper have been explored by previous work and are not properly contextualized such as other graph-based extensions of SSD, LLD-based graph construction for streamflow forecasting models, and CRPS loss for hydrological modeling. The main novelty, in my opinion, is the particular use of LLD with SSD. However, this contribution is only compared against GraphMamba and some simple alternatives and even then the gains over summation and mean seem minor.
W2) Experimental setting: the comparison with RiverMamba and the other baselines is a bit confusing because they use different metrics. I would be much simpler to apply the RiverMamba sequential encoding of the river network in Table 4.c. Other graph encodings for state-space models should also be considered, even if they haven't been applied specifically to streamflow prediction.
W3) It is unclear if DRUM, ED-LSTM, and ME-LSTM leverage the same input data and the warmup procedure as the proposed solution. The warmup procedure, in particular, seems to be quite effective but it is not a core contribution of the paper.
W4) The paper uses EFAS as training and, ground-truth, and baseline. It should be clear whether all these streamflow values are generated the same way and if they also leverage the same information as the proposed solution (i.e., is this a limitation in the model or its inputs).
W5) The figures in the paper are not friendly to human readers due to small fonts.
Questions for authors
Q1) What in the proposed method is novel more broadly, novel only in the context of streamflow forecasting, and novel only in combination with state-space modeling?
Q2) How does the routing procedure proposed compare agains the one used by RiverMamba? Can this be inferred through the ablation study or is it a missing experiment?
Q3) Are the gains achieved by the routing procedure and shown in Table 4.c significant? Do they support the main hypothesis in the paper?
Q4) Is the comparison against DRUM, ED-LSTM, and ME-LSTM fair in terms of inputs and the warmup procedure?
Q5) Can the EFAS baseline leverage all the inputs used by the proposed method? If not, how would the approaches compare against each other if constrained to the same inputs?
2 comments
(W2) Other graph encodings for state-space models should also be considered, even if they haven't been applied specifically to streamflow prediction.
Thank you for the suggestion. We already compared with a Graph-SSM method: Wang et al., 2024 (https://arxiv.org/abs/2402.00789) which orders all nodes by feature magnitudes. Another common Graph-SSM is GMN by Behrouz and Hashemi, 2024 (https://arxiv.org/abs/2402.08678) which uses subgraph tokenization, but there is no official code to test it (see https://github.com/GraphMamba/GMN). We will discuss and mention more Graph-SSM methods in the revision.
In our work, we want to propagate information along the river network as a fixed topology. Our aim is not to introduce a general Graph-SSM method but to use Graph-SSM for river routing in the feature space.
(Q3) Are the gains achieved by the routing procedure and shown in Table 4.c significant? Do they support the main hypothesis in the paper?
Thanks for this comment. Our main research hypothesis is that "encoding the physical structure of river networks explicitly in the feature space improves the forecasting skill.". This is supported in Tables 2, 3, and 4a (with routing vs without routing), qualitative results in Figs. 1 and 7, and through additional experiments in Appendix Sec. B-C. The gain of adding routing is significant.
(W3) It is unclear if DRUM, ED-LSTM, and ME-LSTM leverage the same input data and the warmup procedure as the proposed solution. The warmup procedure, in particular, seems to be quite effective but it is not a core contribution of the paper.
(Q4) Is the comparison against DRUM, ED-LSTM, and ME-LSTM fair in terms of inputs and the warmup procedure?
We thank the reviewer for pointing out to this ambiguity. All baselines (DRUM, ED-LSTM, and ME-LSTM) use the same input data as our model but as time series (the initial condition is given as 6-hourly input for LSTMs so they have even more memory), and they are evaluated under the same protocol of training/testing. The comparison is fair. We will state this explicitly in the paper.
The warmup is not added to the baselines because they are equivalent by design. Our model is autoregressive and a warmup is needed to initialize its first rollout state. ED-LSTM and ME-LSTM are encoder-decoder models following Nearing et al. (2024) and Cohen et al. (2026). Their forecast state is initialized by a hindcast LSTM that runs over the previous days before the forecast time and is then given to the forecast LSTM (e.g., in ED-LSTM a learned handoff network gives the final state to the forecast LSTM). DRUM conditions on the same hindcast days. This hindcast is built from the same data as our warmup. We agree that the warmup is not a core contribution and we did not claim that. We described it because it is useful for the autoregressive design in our model.
We will state this explicitly in the revised paper.
(W4) The paper uses EFAS as training and, ground-truth, and baseline. It should be clear whether all these streamflow values are generated the same way and whether they also leverage the same information as the proposed solution (i.e., is this a limitation in the model or its inputs).
(Q5) Can the EFAS baseline leverage all the inputs used by the proposed method? If not, how would the approaches compare against each other if constrained to the same inputs?
Thank you for the note. EFAS has two parts: EFAS-forecast as a baseline and EFAS-reanalysis as a ground truth. The way how we used it in the paper is as follows:
- EFAS-reanalysis is used as a benchmark to compare different baselines because it simulates river discharge everywhere and it is a skillful hydrological system. EFAS forecast is excluded here because the ground truth reanalysis is generated by the same model.
- EFAS forecast is used as a physics-based baseline and benchmarked against observational datasets i.e., GRDC and CAMELS data.
We did not change its input and we did not run the model ourselves. We will make this clearer in the revision to avoid confusion.
(W5) The figures in the paper are not friendly to human readers due to small fonts.
We will increase the font in the revision. Please note that we reduced the size of figures due to page limit in the main paper.
Thank you again for your time in reviewing the paper. We hope that the response has resolved all your concerns. Please let us know if there are still any open issues.
Thank you for your time and for highlighting the relevance of the addressed problem, the novelty of combining Bi-SSD with LDD for river routing, the state-of-the-art performance against multiple baselines, and the usefulness of probabilistic forecasting with CRPS for distributed modeling in hydrology.
Thank you for the note. We would like to clarify more about the novelty aspects of our work:
There seems to be a misunderstanding about Table 4c and we are happy to clarify. Summation and mean in Table 4c are different variants to aggregate upstream features and run by our routing operater in the end. They represent an ablation for how we aggregate upstreams before running the routing with SSD. Sum and mean aggregation pool the upstream features into one value before the SSD. We kept all upstream (last row Table 4c) so the model learns the aggregation in an adaptive way while achieving better performance. Note that summation (first row Table 4c) doesn't perform well on obs CAMELS and given all upstreams to SSD without a mean aggregation achieves slightly better results.
We will clarify this in the paper.
Please see our response to W1. Our main contribution is a novel way to do feature-space routing and forecasting in distributed hydrological modeling. The routing operator is not restricted to state-space modeling and works also in a combination with standard local-runoff models as we showed in our response to #2 Reviewer zLt6.
While in this work we addressed flood forecasting, we believe that the method is not limited to streamflow forecasting or specific input variables. For instance, many processes in land surface/sub-surface modeling require lateral flow (i.e., horizontal movement of water) and our model is promising for more general tasks.
Thank you for this comment. RiverMamba was compared only over the Mid-Europe domain. It is a deterministic model with no nowcasting and is expensive to train over the full domain, so we give it its own comparison. We compare to it in Appendix Sec. E in more detail using the same metrics. We agree that this could be confusing and we will make it clearer in the revision.
Thank you for the note. We are happy to clarify. RiverMamba is a vision model that scans the domain with Bi-SSM to do the forecast but without explicit routing. The sequential encoding of the river network is done in RiverMamba with space-filling curves. The equivalent experiments to RiverMamba are in Table 3 (first row) and Table 4a, representing a model without routing (rows 1 and 3). The full comparison to RiverMamba is in Appendix Sec. E. We will make this clearer in the revision. Thanks.