MétaCan
Menu
Back to cohort
Record W2586428896 · doi:10.2118/182727-ms

A Discrete Imaging Formulation for History Matching Complex Geologic Facies

2017· article· en· W2586428896 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueSPE Reservoir Simulation Conference · 2017
Typearticle
Languageen
FieldEarth and Planetary Sciences
TopicSeismic Imaging and Inversion Techniques
Canadian institutionsnot available
FundersCMG Reservoir Simulation Foundation
KeywordsFaciesRegularization (linguistics)Computer scienceAlgorithmCalibrationParametric statisticsMathematical optimizationGeologyArtificial intelligenceMathematicsStructural basin

Abstract

fetched live from OpenAlex

Abstract Estimation of geologic facies with complex connectivity patterns from limited direct and indirect measurements is facilitated by exploiting recent advances in discrete imaging methods. Classical model calibration techniques have difficulty in honoring solution discreteness and preserving facies connectivity. The existing methods for calibration of facies models either focus on preserving the facies connectivity and incorporate discreteness as a post-processing step, or they attempt to generate conditional samples from a discrete prior model (training image), which can be computationally demanding. In this work, we propose a novel framework for discrete geologic facies reconstruction from dynamic production data by combining connectivity-preserving parameterizations with discrete regularization techniques such as well-potentials that are inspired by recent advances in discrete tomography. For calibration of discrete geologic facies against flow data, we propose a method to promote solution discreteness and incorporate geologic connectivity information. To obtain discrete solutions we invoke well-potential regularization functions that penalize continuous solutions. The regularization penalty function is minimized along with the mismatch between model predictions and observed production data. To incorporate the geologic connectivity patterns, we learn plausible geologic patterns from available prior (training) models. This is done by learning parametric representations of facies connectivity such as the truncated singular value decomposition (TSVD) or learned sparse geologic dictionaries. We solve the resulting regularized minimization problem by implementing an efficient gradient-based algorithm known as the alternating direction method of multipliers (ADMM). Through several numerical experiments, we show that the proposed formulation offers a flexible facies model calibration approach that can be applied to problems with multiple facies types. An important aspect of this method is that it incorporates the discreteness of the underlying structure as a soft constraint in the inversion process, without a requirement for post-processing of the solution, which can potentially violate data match requirements. The implementation is amenable to iterative gradient-based algorithms and allows gradual, systematic, and plausible morphing of a given facies model to match the observed data. We present several case studies that illustrate the superiority of the proposed method to existing approaches in the literature for calibration of discrete facies distribution against production data.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.752
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.110
GPT teacher head0.314
Teacher spread0.204 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it