Neural network emulator of the Advanced LIGO and Advanced Virgo selection function
Bibliographic record
Abstract
Characterization of search selection effects comprises a core element of gravitational-wave data analysis. Knowledge of selection effects is needed to predict observational prospects for future surveys and is essential in the statistical inference of astrophysical source populations from observed catalogs of compact binary mergers. Although gravitational-wave selection functions can be directly measured via injection campaigns---the insertion and attempted recovery of simulated signals added to real instrumental data---such efforts are computationally expensive. Moreover, the inability to interpolate between discrete injections limits the ability to which we can study narrow or discontinuous features in the astrophysical distribution of compact binary properties. For this reason, there is a growing need for alternative representations of gravitational-wave selection functions that are computationally cheap to evaluate and can be computed across a continuous range of compact binary parameters. In this paper, we describe one such representation. Using pipeline injections performed during Advanced LIGO and Advanced Virgo's third observing run (O3), we train a neural network emulator for $P(\mathrm{det}|\ensuremath{\theta})$, the probability that a given compact binary with parameters is successfully detected, averaged over the course of O3. The emulator captures the dependence of $P(\mathrm{det}|\ensuremath{\theta})$ on binary masses, spins, distance, sky position, and orbital orientation, and it is valid for compact binaries with component masses between 1 and $100{M}_{\ensuremath{\bigodot}}$. We test the emulator's ability to produce accurate distributions of detectable events, and demonstrate its use in hierarchical inference of the binary black hole population.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".