Sequential trans-dimensional Monte Carlo for range-dependent geoacoustic inversion
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.
Bibliographic record
Abstract
This paper develops a sequential trans-dimensional Monte Carlo algorithm for geoacoustic inversion in a strongly range-dependent environment. The algorithm applies advanced Markov chain Monte Carlo methods in combination with sequential techniques (particle filters) to carry out geoacoustic inversions for consecutive data sets acquired along a track. Changes in model parametrization along the track (e.g., number of sediment layers) are accounted for with trans-dimensional partition modeling, which intrinsically determines the amount of structure supported by the data information content. Challenging issues of rapid environmental change between consecutive data sets and high information content (peaked likelihood) are addressed by bridging distributions implemented using annealed importance sampling. This provides an efficient method to locate high-likelihood regions for new data which are distant and ∕ or disjoint from previous high-likelihood regions. The algorithm is applied to simulated reflection-coefficient data along a track, such as can be collected using a towed array close to the seabed. The simulated environment varies rapidly along the track, with changes in the number of layers, layer thicknesses, and geoacoustic parameters within layers. In addition, the seabed contains a geologic fault, where all layers are offset abruptly, and an erosional channel. Changes in noise level are also considered.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it