Efficient proxy for Time-Lapse Seismic ForwardModeling using U-Net Encoder-Decoder Approach
Bibliographic record
Abstract
Abstract The time-lapse seismic (4D seismic) forward modeling provides crucial data for calibrating reservoir models through the reservoir data assimilation method. Unfortunately, conventional 4D seismic forward modeling methodology is time-expensive and entails significant computational resource consumption. To address these drawbacks, in this work, our goal is to develop a proxy model for the 4D seismic forward modeling using a class of machine learning algorithm named U-Net encoder-decoder. We applied the developed proxy model to a benchmark carbonate reservoir using an ensemble of reservoir simulation models from UNISIM IV (a synthetic benchmark based on real data of a Brazilian pre-salt field). Moreover, we aim to introduce seminal strategies for interpreting the proposed proxy model operation, its outputs, and possible correlations between input and output variables. To achieve this, we trained and tested two versions of U-net-based models and applied methods for explainable AI, such as Grad-CAM and Forward Feature Selection. The experiments showed good results when applied to the test dataset. The R-squared values were in the range of 0.7 to 0.9, showing the efficiency of the proxy model to replace the 4D seismic forward modeling. Additionally, the qualitative analysis helped us identify which input properties and regions of the reservoir are more relevant for the model's inference. These results are a valuable preliminary step toward a robust, explainable machine learning-based proxy forward modeling.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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.001 |
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".