Uncloaking hidden repeating fast radio bursts with unsupervised machine learning
Bibliographic record
Abstract
ABSTRACT The origins of fast radio bursts (FRBs), astronomical transients with millisecond time-scales, remain unknown. One of the difficulties stems from the possibility that observed FRBs could be heterogeneous in origin; as some of them have been observed to repeat, and others have not. Due to limited observing periods and telescope sensitivities, some bursts may be misclassified as non-repeaters. Therefore, it is important to clearly distinguish FRBs into repeaters and non-repeaters, to better understand their origins. In this work, we classify repeaters and non-repeaters using unsupervised machine learning, without relying on expensive monitoring observations. We present a repeating FRB recognition method based on the Uniform Manifold Approximation and Projection (UMAP). The main goals of this work are to: (i) show that the unsupervised UMAP can classify repeating FRB population without any prior knowledge about their repetition, (ii) evaluate the assumption that non-repeating FRBs are contaminated by repeating FRBs, and (iii) recognize the FRB repeater candidates without monitoring observations and release a corresponding catalogue. We apply our method to the Canadian Hydrogen Intensity Mapping Experiment Fast Radio Burst (CHIME/FRB) data base. We found that the unsupervised UMAP classification provides a repeating FRB completeness of 95 per cent and identifies 188 FRB repeater source candidates from 474 non-repeater sources. This work paves the way to a new classification of repeaters and non-repeaters based on a single epoch observation of FRBs.
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.000 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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 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".