The ATLAS Virtual Research Assistant
Bibliographic record
Abstract
Abstract We present the Virtual Research Assistant (VRA) of the ATLAS sky survey, which performs preliminary eyeballing on our clean transient data stream. The VRA uses histogram-based gradient-boosted decision tree classifiers trained on real data to score incoming alerts on two axes: “Real” and “Galactic.” The alerts are then ranked using a geometric distance such that the most “real” and “extragalactic” receive high scores; the scores are updated when new lightcurve data is obtained on subsequent visits. To assess the quality of the training we use the recall at rank K, which is more informative to our science goal than general metrics (e.g., accuracy, F1-scores). We also establish benchmarks for our metric based on the pre-VRA eyeballing strategy, to ensure our models provide notable improvements before being added to the ATLAS pipeline. Then, policies are defined on the ranked list to select the most promising alerts for humans to eyeball and to automatically remove bogus alerts. In production the VRA method has resulted in a reduction in eyeballing workload by 85% with a loss of follow-up opportunity <0.08%. It also allows us to automatically trigger follow-up observations with the Lesedi telescope, paving the way toward automated methods that will be required in the era of LSST. Finally, this is a demonstration that feature-based methods remain extremely relevant in our field, being trainable on only a few thousand samples and highly interpretable; they also offer a direct way to inject expertise into models through feature engineering.
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.004 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.004 | 0.006 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.101 | 0.069 |
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".