Better use of experience from other reservoirs for accurate production forecasting by learn-to-learn method
Bibliographic record
Abstract
To assess whether a development strategy will be profitable enough, production forecasting is a crucial and difficult step in the process. The development history of other reservoirs in the same class tends to be studied to make predictions accurate. However, the permeability field, well patterns, and development regime must all be similar for two reservoirs to be considered in the same class. This results in very few available experiences from other reservoirs even though there is a lot of historical information on numerous reservoirs because it is difficult to find such similar reservoirs. This paper proposes a learn-to-learn method, which can better utilize a vast amount of historical data from various reservoirs. Intuitively, the proposed method first learns how to learn samples before directly learning rules in samples. Technically, by utilizing gradients from networks with independent parameters and copied structure in each class of reservoirs, the proposed network obtains the optimal shared initial parameters which are regarded as transferable information across different classes. Based on that, the network is able to predict future production indices for the target reservoir by only training with very limited samples collected from reservoirs in the same class. Two cases further demonstrate its superiority in accuracy to other widely-used network methods.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".