History Matching Reservoir Models With Many Objective Bayesian Optimization
Bibliographic record
Abstract
ABSTRACT Reservoir models for predicting subsurface fluid and rock behaviors can now include upwards of billions (and potentially trillions) of grid cells and are pushing the limits of computational resources. History matching, where models are updated to match existing historical data more closely, is conducted to reduce the number of simulation runs and is one of the primary time‐consuming tasks. As models get larger the number of parameters to match increases, and the number of objective functions increases, and traditional methods start to reach their limitations. To solve this, we propose the use of Bayesian optimization (BO) in a hybrid cloud framework. BO iteratively searches for an optimal solution in the simulations campaign through the refinement of a set of priors initialized with a set of simulation results. The current simulation platform implements grid management and a suite of linear solvers to perform the simulation on large scale distributed‐memory systems. Our early results using the hybrid cloud implementation shown here are encouraging on tasks requiring over 100 objective functions, and we propose integrating BO as a built‐in module to efficiently iterate to find an optimal history match of production data in a single package platform. This paper reports on the development of the hybrid cloud BO based history matching framework and the initial results of the application to reservoir history matching.
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.002 | 0.006 |
| 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.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".