Rapid Likelihood Free Inference of Compact Binary Coalescences using Accelerated Hardware
Not on the map. Why?
Abstract (arXiv)
We report a gravitational-wave parameter estimation algorithm, AMPLFI, based on likelihood-free inference using normalizing flows. The focus of AMPLFI is to perform real-time parameter estimation for candidates detected by machine-learning based compact binary coalescence search, Aframe. We present details of our algorithm and optimizations done related to data-loading and pre-processing on accelerated hardware. We train our model using binary black-hole (BBH) simulations on real LIGO-Virgo detector noise. Our model has ~ 6 million trainable parameters with training times lesssim 24 hours. Based on online deployment on a mock data stream of LIGO-Virgo data, Aframe + AMPLFI is able to pick up BBH candidates and infer parameters for real-time alerts from data acquisition with a net latency of ~ 6s.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 11 of its 56 references that are in the map. First posted on arXiv 26 Jul 2024.
Builds on
11 of 56 references.
References · 11
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018Group Normalizationcited by 1,514
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2017Masked Autoregressive Flow for Density Estimationcited by 680
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 636
- 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
- 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
- 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
- 2021Real-time gravitational-wave science with neural posterior estimationcited by 76
- 2019Bayesian parameter estimation using conditional variational autoencoders for gravitational-wave astronomycited by 36
- 2023Optimizing Likelihood-free Inference using Self-supervised Neural Symmetry Embeddingscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.