Training Strategies for Deep Learning Gravitational-Wave Searches

Authors: Marlin B. Schäfer (Max-Planck-Institut für Gravitationsphysik), Ondřej Zelenka (Friedrich-Schiller-Universität Jena), Alexander H. Nitz (Max-Planck-Institut für Gravitationsphysik), Frank Ohme (Max-Planck-Institut für Gravitationsphysik), Bernd Brügmann (Friedrich-Schiller-Universität Jena)

arXiv: 2106.03741v1 - DOI (astro-ph.IM)
17 pages, 11 figures, 3 tables, supplemental materials at https://github.com/gwastro/ml-training-strategies

Abstract: Compact binary systems emit gravitational radiation which is potentially detectable by current Earth bound detectors. Extracting these signals from the instruments' background noise is a complex problem and the computational cost of most current searches depends on the complexity of the source model. Deep learning may be capable of finding signals where current algorithms hit computational limits. Here we restrict our analysis to signals from non-spinning binary black holes and systematically test different strategies by which training data is presented to the networks. To assess the impact of the training strategies, we re-analyze the first published networks and directly compare them to an equivalent matched-filter search. We find that the deep learning algorithms can generalize low signal-to-noise ratio (SNR) signals to high SNR ones but not vice versa. As such, it is not beneficial to provide high SNR signals during training, and fastest convergence is achieved when low SNR samples are provided early on. During testing we found that the networks are sometimes unable to recover any signals when a false alarm probability $<10^{-3}$ is required. We resolve this restriction by applying a modification we call unbounded Softmax replacement (USR) after training. With this alteration we find that the machine learning search retains $\geq 97.5\%$ of the sensitivity of the matched-filter search down to a false-alarm rate of 1 per month.

Submitted to arXiv on 07 Jun. 2021

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.