A Soft and Law-Abiding Framework for History Matching and Optimization under Uncertainty
Bibliographic record
Abstract
Abstract Current frameworks for optimization and assisted history matching lack the ability to control and guide the sampling engine and to incorporate geo-engineering knowledge. Defining the interactions between uncertain parameters and handling multiple constraints are also arduous tasks. Despite recent advances in adaptive population-based sampling algorithms and other gradient and ensemble-based methods, these specific drawbacks have left engineers with several history-matched models that are inconsistent with the physical and geological knowledge of the field. We introduce a novel rule-based framework based on fuzzy reasoning to integrate engineering knowledge with optimization and assisted history matching workflows. The system can handle multiple complex constraints both in parameter and objective function space. The use of fuzzy set theory in this workflow is a natural way to address uncertainty arising from imprecision of definition. This type of uncertainty is important in expressing the parameters of interest; however, it has been less addressed in existing workflows. The proposed system can be coupled with any algorithm used for assisted history matching, including gradient-based, population-based and particle filter approaches. The framework is coupled with differential evolution algorithm and is tested for three cases. The results show that fuzzy rule-based engine preserves the computational efficiency of the sampling engine, while allowing for definition of flexible rules in history matching and optimization that honor engineering knowledge.
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.003 | 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.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| 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".