Accelerating Hessian-free Gauss-Newton full-waveform inversion via l-BFGS preconditioned conjugate-gradient algorithm
Bibliographic record
Abstract
ABSTRACT Full-waveform inversion (FWI) has emerged as a powerful strategy for estimating subsurface model parameters by iteratively minimizing the difference between synthetic data and observed data. The Hessian-free (HF) optimization method represents an attractive alternative to Newton-type and gradient-based optimization methods. At each iteration, the HF approach obtains the search direction by approximately solving the Newton linear system using a matrix-free conjugate-gradient (CG) algorithm. The main drawback with HF optimization is that the CG algorithm requires many iterations. In our research, we develop and compare different preconditioning schemes for the CG algorithm to accelerate the HF Gauss-Newton (GN) method. Traditionally, preconditioners are designed as diagonal Hessian approximations. We additionally use a new pseudo diagonal GN Hessian as a preconditioner, making use of the reciprocal property of Green’s function. Furthermore, we have developed an l-BFGS inverse Hessian preconditioning strategy with the diagonal Hessian approximations as an initial guess. Several numerical examples are carried out. We determine that the quasi-Newton l-BFGS preconditioning scheme with the pseudo diagonal GN Hessian as the initial guess is most effective in speeding up the HF GN FWI. We examine the sensitivity of this preconditioning strategy to random noise with numerical examples. Finally, in the case of multiparameter acoustic FWI, we find that the l-BFGS preconditioned HF GN method can reconstruct velocity and density models better and more efficiently compared with the nonpreconditioned method.
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.001 |
| 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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".