Performance of a sampling stochastic dynamic programming algorithm with various inflow scenario generation methods
Bibliographic record
Abstract
We present the implementation of a Sampling Stochastic Dynamic Programming (SSDP) algorithm to maximize water value, while meeting consumer demand for the BC Hydro hydroelectric system in British Columbia, Canada. The implementation includes power generation facilities on the Columbia and Peace River systems. Variability of natural streamflow into a reservoir is a major source of uncertainty when developing reservoir operation policies and determining the value of water within a system. This study investigates SSDP model performance with various hydrologic inputs. Sixty years of historical data are used to generate hydrologic scenarios comprised of inflow and forecast sequences as input to the SSDP model. Scenario types studied include historical record data, inflows and forecasts generated from an autoregressive lag-1 model, and BC Hydro ensemble streamflow prediction forecasts. We present results of our implementation of the SSDP algorithm including a discussion on improved reservoir operation policy and the future value of water with various hydrologic inputs. We also present our investigation of the marginal value of water with the evolution of forecasts. Results indicate that forecasts are most valuable in determining the value of water during the early freshet, and the value added from updating future forecasts diminishes as the time in which the forecast is made progresses through the melting period.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".