Normalizing flows for density estimation in multidetector gravitational-wave searches
多探测器引力波搜寻中基于归一化流的密度估计
Identifying compact binary coalescences buried within the non-Gaussian and nonstationary data taken by large-scale gravitational-wave interferometers requires sophisticated multistep search pipelines, such as the PyCBC analysis used extensively both within and outside the LIGO-Virgo-KAGRA collaborations. A critical task for these pipelines is determining the statistical significance of candidate events by comparing a ``ranking statistic'' against a large background set. Currently, PyCBC's ranking statistic incorporates the joint probability of the relative arrival times, phase delays, and amplitude ratios of the signals seen in different detectors. These parameters are tightly constrained for physical signals but are much more broadly distributed for noise. PyCBC currently relies on precomputed binned histogram-based density estimators using Monte Carlo simulations to obtain these probabilities. However, the storage requirements for these histograms scale prohibitively with the size of the detector network, preventing PyCBC from effectively analyzing four or more detectors. In this paper, we demonstrate that these histogram files can be replaced with normalizing flows, a machine learning approach to density estimation. Applying this method to data from the third observing run of Advanced LIGO and Virgo, we demonstrate that normalizing flows reduce storage requirements by more than 3 orders of magnitude. Furthermore, our approach maintains high sensitivity, with no more than a 0.05% drop in the recovery of simulated signals at a fixed false-alarm rate. By relaxing several simplifying assumptions previously required by Monte Carlo methods, we also achieved up to a 6.55% increase in recovered signals for specific detector combinations. These results suggest that normalizing flows provide a scalable, flexible framework for the PyCBC pipeline as it expands to include four or more detectors, or to extend to searches for precessing or higher-mode signals, in future observing runs.
展开 ▾存储需求从 TB/PB 降至 MB,灵敏度不降反升(HV 和 LV 组合最多增加 6.55% 的事件恢复率),首次完成端到端四探测器 PyCBC 符合分析,为进动搜索和预警系统奠定基础。
在引力波搜索管道 PyCBC 中,多探测器信号的排名统计依赖于通过蒙特卡洛模拟构建的直方图密度估计 Nitz+ 2017,但该方法存储需求随探测器数量指数增长,无法用于四探测器及以上网络。归一化流作为一种灵活的密度估计方法,已在引力波参数估计 Green+ 2020、Williams+ 2021 和宇宙学推断 Stachurski+ 2024 等领域展现优势。本文首次将归一化流引入搜索管道,同时放宽了振幅比采样、距离采样、时间-相位测量不确定性等假设,在保持灵敏度的同时大幅降低存储成本。展望未来,归一化流有望整合进动信号搜索 Dhurkunde+ 2026 以及频率相关定时不确定性,为下一代全球探测器网络的实时分析提供可扩展框架。
预印本 2026-04-29 · 刊出 2026-09-18 · 收录 2026-09-26