Meta-learned neural encoders and decoders for compressive learning aim to make parameter estimation from compact database sketches faster and more accurate than randomized, data-independent compressive learning.
Gravitational-wave astronomy with an uncertain noise power spectral density
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In order to extract information about the properties of compact binaries, we must estimate the noise power spectral density of gravitational-wave data, which depends on the properties of the gravitational-wave detector. In practice, it is not possible to know this perfectly, only to estimate it from the data. Multiple estimation methods are commonly used and each has a corresponding statistical uncertainty. However, this uncertainty is widely ignored when measuring the physical parameters describing compact binary coalescences, and the appropriate likelihoods which account for the uncertainty are not well known. In order to perform increasingly precise astrophysical inference and model selection, it will be essential to account for this uncertainty. In this work, we derive the correct likelihood for one of the most widely used estimation methods in gravitational-wave transient analysis, the median average. We demonstrate that simulated Gaussian noise follows the predicted distributions. We then examine real gravitational-wave data at and around the time of GW151012, a relatively low-significance binary black hole merger event. We show that the data are well described by stationary-Gaussian noise and explore the impact of different noise power spectral density estimation methods on the astrophysical inferences we draw about GW151012.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Compressive Meta-Learning
Meta-learned neural encoders and decoders for compressive learning aim to make parameter estimation from compact database sketches faster and more accurate than randomized, data-independent compressive learning.