Classifying merger stages with adaptive deep learning and cosmological hydrodynamical simulations
Bibliographic record
Abstract
Aims. Hierarchical merging of galaxies plays an important role in galaxy formation and evolution. Mergers could trigger key evolutionary phases such as starburst activities and active accretion periods onto supermassive black holes at the centres of galaxies. We aim to detect mergers and merger stages (pre- and post-mergers) across cosmic history. Our main goal is to test whether it is more beneficial to detect mergers and their merger stages simultaneously or hierarchically. In addition, we wish to test the impact of merger time relative to the coalescence of merging galaxies. Methods. First, we generated realistic mock James Webb Space Telescope (JWST) images of simulated galaxies selected from the IllustrisTNG cosmological hydrodynamical simulations. The advantage of using simulations is that we have information on both whether a galaxy is a merger and its exact merger stage (i.e. when in the past or in the future the galaxy has experienced or will experience a merging event). Then, we trained deep-learning (DL) models for galaxy morphology classifications in the Zoobot Python package to classify galaxies into non-merging galaxies, merging galaxies and their merger stages. We used two different set-ups, a two-stage set-up versus a one-stage set-up. In the former set-up, we first classified galaxies into mergers and non-mergers, and we then classified the mergers into pre-mergers and post-mergers. In the latter set-up, non-mergers, pre-mergers and post-mergers were classified simultaneously. Results. We found that the one-stage classification set-up moderately outperforms the two-stage set-up. It offers a better overall accuracy and generally a better precision, particularly for the non-merger class. Out of the three classes, pre-mergers can be classified with the highest precision (∼65% versus ∼33% from a random classifier) in both set-ups, possibly because the merging features are generally more easily recognised, and because there are merging companions. More confusion is found between post-mergers and non-mergers than between these two classes and pre-mergers. The image signal-to-noise ratio (S/N) also affects the performance of the DL classifiers, but not by much after a certain threshold is crossed (S/N ∼ 20 in a 0.2″aperture). In terms of the merger timescale, both precision and recall of the classifiers strongly depend on merger time. Both set-ups find it more difficult to identify true mergers that are observed at stages that are farther from coalescence either in the past or in the future. For pre-mergers, we recommend selecting mergers that will merge in the next 0.4 Gyr to achieve a good balance between precision and recall.
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.003 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".