Bayesian optimization of gradient trajectory for parallel‐transmit pulse design
Bibliographic record
Abstract
PURPOSE: Spoke pulses improve excitation homogeneity in parallel-transmit MRI. We propose an efficient global optimization algorithm, Bayesian optimization of gradient trajectory (BOGAT), for single-slice and simultaneous multislice imaging. THEORY AND METHODS: -space positions to sample, to achieve fast convergence, often coming close to the globally optimal spoke positions. We investigated the typical features of spokes cost functions by a grid search with field maps comprising 85 slabs from 14 volunteers. We tested BOGAT in this database, and prospectively in a phantom and in vivo. We compared the vendor-provided Fourier transform approach with the same magnitude least squares RF optimizer. RESULTS: The cost function is nonconvex and seen empirically to be piecewise smooth with discontinuities where the underlying RF optimum changes sharply. BOGAT converged to within 10% of the global minimum cost within 30 iterations in 93% of slices in our database. BOGAT achieved up to 56% lower flip angle RMS error (RMSE) or 55% lower pulse energy in phantoms versus the Fourier transform approach, and up to 30% lower RMSE and 29% lower energy in vivo with 7.8 s extra computation. CONCLUSION: BOGAT efficiently estimated near-global optimum spoke positions for the two-spoke tests, reducing flip-angle RMSE and/or pulse energy in a computation time (˜10 s), which is suitable for online optimization.
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.000 |
| Bibliometrics | 0.001 | 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.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".