As Simple as Possible but No Simpler: Optimizing the Performance of Neural Net Emulators for Galaxy SED Fitting
Bibliographic record
Abstract
Abstract Artificial neural network emulators have been demonstrated to be a very computationally efficient method to rapidly generate galaxy spectral energy distributions, for parameter inference or otherwise. Using a highly flexible and fast mathematical structure, they can learn the nontrivial relationship between input galaxy parameters and output observables. However, they do so imperfectly, and small errors in flux prediction can yield large differences in recovered parameters. In this work, we investigate the relationship between an emulator’s execution time, uncertainties, correlated errors, and ability to recover accurate posteriors. We show that emulators can recover consistent results to traditional fits, with a precision of 25%–40% in posterior medians for stellar mass, stellar metallicity, star formation rate, and stellar age. We find that emulation uncertainties scale with an emulator’s width N as ∝N −1, while execution time scales as ∝N 2, resulting in an inherent tradeoff between execution time and emulation uncertainties. We also find that emulators with uncertainties smaller than observational uncertainties are able to recover accurate posteriors for most parameters without a significant increase in catastrophic outliers. Furthermore, we demonstrate that small architectures can produce flux residuals that have significant correlations, which can create dangerous systematic errors in colors. Finally, we show that the distributions chosen for generating training sets can have a large effect on an emulator’s ability to accurately fit rare objects. Selecting the optimal architecture and training set for an emulator will minimize the computational requirements for fitting near-future large-scale galaxy surveys. We release our emulators on GitHub ( http://github.com/elijahmathews/MathewsEtAl2023 ).
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".