Hierarchical transfer learning for deep learning velocity model building
Bibliographic record
Abstract
ABSTRACT Deep learning is a promising approach to velocity model building because it has the potential of processing large seismic surveys with minimal resources. By leveraging large quantities of model-gather pairs, neural networks (NNs) can automatically map data to the model space, directly providing a solution to the inverse problem. Such mapping requires big data, which proves prohibitive for 2D and 3D surveys of realistic size. We have developed a transfer learning (TL) strategy. A network is first trained on a smaller subproblem, which then becomes the starting solution to a larger, more difficult data set, akin to the hierarchical multiscale strategy for full-waveform inversion. We perform TL by having subobjectives that escalate in complexity and by first training an NN at estimating horizontally layered velocity models and then proceeding to train an augmented network at estimating 2D dipping layered models. TL improves convergence and allows using a lesser quantity of 2D models for training. For synthetic tests, the structural similarity index measure of 2D interval velocity models in the time domain is 0.893±0.052 and the root-mean-square (rms) error is (198±91) m/s. We benchmark our algorithm on the Marmousi2 model and observe that our method can apply to velocity models with continuous deformed layers with dips up to 35°. We benchmark our algorithm on 2D marine field data and produce an rms velocity model that leads to coherent stacking and a time interval velocity model that reproduces salient features of the stacked section. TL expedites and regularizes training and data-driven techniques may be applied to field data with minimal preprocessing even though we lack real target velocity models.
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.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.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".