Joint distribution of upstream runoff governs downstream river-discharge prediction uncertainty in distributed ML models

• URL: http://arxiv.org/abs/2607.03217v1
• Date: Fri, 03 Jul 2026 11:31:57 GMT
• Title: Joint distribution of upstream runoff governs downstream river-discharge prediction uncertainty in distributed ML models
• Abstract summary: This technical note argues that moving probabilistic prediction from lumped to distributed models introduces a specific new requirement.<n>In lumped inference, the model predicts the outlet distribution directly and can modulate spread from basin attributes.<n>In distributed inference, downstream discharge is obtained by routing many upstream runoff predictions, so independent local sampling averages uncertainty away.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Uncertainty quantification of hydrological predictions is necessary to inform operational decisions. Recent generative machine-learning methods have advanced probabilistic streamflow prediction, but have remained confined to lumped models that predict a basin outlet directly. At the same time, deterministic LSTM runoff models are increasingly applied at grid or catchment scale and routed through river networks to produce spatially continuous, physically consistent discharge fields. This technical note argues that moving probabilistic prediction from lumped to distributed models introduces a specific new requirement: the joint distribution of upstream runoff generation must be sampled jointly. In lumped inference, the model predicts the outlet distribution directly and can modulate spread from basin attributes. In distributed inference, downstream discharge is obtained by routing many upstream runoff predictions, so independent local sampling averages uncertainty away. Using Japan as a case study, we train two probabilistic basin-scale runoff LSTMs and route their runoff through a Hayami routing scheme. Randomly matching upstream ensemble members produces severely under-dispersed downstream ensembles, whereas a simple quantile matching strategy restores much of the spread of the direct basin-scale reference. The shift from lumped to distributed probabilistic hydrology therefore requires explicit attention to the spatial joint structure of runoff uncertainty.

Related papers

• A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models [0.3222802562733787]
  We survey continuous-time generative modeling methods based on transporting a simple reference distribution to a data distribution via deterministic dynamics.<n>We present a unified framework in which diffusion models, score-based generative models, and flow matching are instances of learning a time-dependent vector field.
  arXiv  Detail & Related papers  (2026-05-07T18:32:15Z)
• HydroDiffusion: Diffusion-Based Probabilistic Streamflow Forecasting with a State Space Backbone [24.321954272892338]
  HydroDiffusion is a diffusion-based probabilistic forecasting framework with a decoder-only state space model backbone.<n>It is evaluated across 531 watersheds in the contiguous United States (CONUS) in the CAMELS dataset.<n>Results show that HydroDiffusion achieves strong nowcast accuracy when driven by observed meteorological forcings.
  arXiv  Detail & Related papers  (2025-12-13T05:05:27Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Rectifying Distribution Shift in Cascaded Precipitation Nowcasting [1.1724961392643483]
  Precipitation nowcasting aims to provide high-temporal forecasts by leveraging current radar observations.<n>We introduce Recti, a framework that explicitlycouples the rectification of mean-field shift from the generation of locality.<n> Experiments on two radar datasets demonstrate that Recti achieves significant performance improvements over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-11-19T02:06:30Z)
• Bridging the Last Mile of Prediction: Enhancing Time Series Forecasting with Conditional Guided Flow Matching [9.465542901469815]
  Conditional Guided Flow Matching (CGFM) is a model-agnostic framework that extends flow matching by integrating outputs from an auxiliary predictive model.<n>CGFM incorporates historical data as both conditions and guidance, uses two-sided conditional paths, and employs affine paths to expand the path space.<n> Experiments across datasets and baselines show CGFM consistently outperforms state-of-the-art models, advancing forecasting.
  arXiv  Detail & Related papers  (2025-07-09T18:03:31Z)
• Gaussian Mixture Flow Matching Models [63.092956669059824]
  Diffusion models approximate the denoising distribution as a Gaussian and predict its mean, whereas flow matching models re parameterize the Gaussian mean as flow velocity.<n>They underperform in few-step sampling due to discretization error and tend to produce over-saturated colors under classifier-free guidance (CFG)<n>We introduce a novel probabilistic guidance scheme that mitigates the over-saturation issues of CFG and improves image generation quality.
  arXiv  Detail & Related papers  (2025-04-07T17:59:42Z)
• Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers [49.97755400231656]
  We present the first performance guarantee with explicit dimensional dependencies for general score-mismatched diffusion samplers.<n>We show that score mismatches result in an distributional bias between the target and sampling distributions, proportional to the accumulated mismatch between the target and training distributions.<n>This result can be directly applied to zero-shot conditional samplers for any conditional model, irrespective of measurement noise.
  arXiv  Detail & Related papers  (2024-10-17T16:42:12Z)
• Predicting Cascading Failures with a Hyperparametric Diffusion Model [66.89499978864741]
  We study cascading failures in power grids through the lens of diffusion models. Our model integrates viral diffusion principles with physics-based concepts. We show that this diffusion model can be learned from traces of cascading failures.
  arXiv  Detail & Related papers  (2024-06-12T02:34:24Z)
• Marginalization Consistent Probabilistic Forecasting of Irregular Time Series via Mixture of Separable flows [4.489135297410294]
  Probabilistic forecasting models for joint distributions of targets in irregular time series with missing values are a heavily under-researched area in machine learning.<n>We propose MOSES (Marginalization Consistent Mixture of Separable Flows), a model that parametrizes a mixture of several latent Gaussian processes combined with separable uni- normality flows.<n>Experiments on four datasets show that MOSES achieves both accurate joint and marginal predictions, surpassing all other marginalization consistent baselines, while only trailing slightly behind ProFITi in joint prediction, but vastly superior when predicting marginal distributions.
  arXiv  Detail & Related papers  (2024-06-11T13:28:43Z)
• MGF: Mixed Gaussian Flow for Diverse Trajectory Prediction [72.70572835589158]
  We propose constructing a mixed Gaussian prior for a normalizing flow model for trajectory prediction.<n>Our method achieves state-of-the-art performance in the evaluation of both trajectory alignment and diversity on the popular UCY/ETH and SDD datasets.
  arXiv  Detail & Related papers  (2024-02-19T15:48:55Z)
• Diffusion models for probabilistic programming [56.47577824219207]
  Diffusion Model Variational Inference (DMVI) is a novel method for automated approximate inference in probabilistic programming languages (PPLs) DMVI is easy to implement, allows hassle-free inference in PPLs without the drawbacks of, e.g., variational inference using normalizing flows, and does not make any constraints on the underlying neural network model.
  arXiv  Detail & Related papers  (2023-11-01T12:17:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.