Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2101.03226

Random projections in gravitational-wave searches from compact binaries II: efficient reconstruction of the detection statistic

Amit Reza·Anirban Dasgupta·Anand S. Sengupta
View original source ↗Read source document ↗Export metadata ↓

Abstract

Low-latency gravitational wave search pipelines such as GstLAL take advantage of low-rank factorization of the template matrix via singular value decomposition (SVD). With unprecedented improvements in detector bandwidth and sensitivity in advanced-LIGO and Virgo detectors, one expects several orders of magnitude increase in the size of template banks. This poses a formidable computational challenge in factorizing huge template matrices. Previously, [in Kulkarni et al. [6]], we introduced the idea of random projection (RP)-based matrix factorization as a computationally viable alternative to SVD, applicable for large template banks. This follow-up paper demonstrates the application of a block-wise randomized matrix factorization (RMF) algorithm for computing low-rank factorizations at a preset average fractional loss of SNR. This new scheme is shown to be more efficient in the context of the LLOID framework of the GstLAL search pipeline. Further, it is well-known that for huge template banks, the total computational cost of the search is dominated by reconstructing the detection statistic compared to that of filtering the data. However, optimizing the reconstruction cost has not been addressed satisfactorily so far in the available literature. We show that it is possible to approximately reconstruct the time-series of the matched-filter detection statistic at a fraction of the total cost using the matching pursuit algorithm. Combining the two algorithms presented in this paper can handle online searches involving large template banks more efficiently. We have analyzed the total computational cost in detail and offer various tips for optimally applying the RMF scheme in different parts of the parameter space. The algorithms presented in this paper are designed in a suitable manner that can be efficiently implemented over a distributed computing architecture.

Explore related subjects

gr-qc

Keep this discovery

BibTeXRIS

Amit Reza, Anirban Dasgupta, Anand S. Sengupta. 2021-01-08. Random projections in gravitational-wave searches from compact binaries II: efficient reconstruction of the detection statistic. https://arxiv.org/abs/2101.03226

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Electrovacuum Black Hole Uniqueness

We prove the black hole uniqueness conjecture in the axially symmetric, stationary, electrovacuum setting, subject to the refined asymptotic analysis of the associated singular harmonic maps, which includes an analyticity hypothesis at the axes. More precisely, it is shown that any asymptotically flat solution of the Einstein--Maxwell equations in this class, with more than one black hole horizon component is either: Majumdar--Papapetrou, up to a duality rotation, in which case all logarithmic angle defects vanish, or every finite axis rod logarithmic angle defect is strictly negative and hence every interaction force is strictly attractive. The proof extends the singular harmonic map method used for vacuum Kerr uniqueness in [18].

gr-qc↗
arXiv2026

Constraining Modified Mass-to-Horizon Cosmology Through Primordial Inflationary Observables

We investigate slow-roll inflation in a modified cosmological framework inspired by a generalized mass-to-horizon relation (MHR), $M=\gamma {c^2 L^n}/{G}$, where $n$ is a real parameter and $\gamma$ a dimensional constant. Using Padmanabhan's emergence paradigm, we derive the modified Friedmann equations for a flat FRW universe and analyze the dynamics of a canonical scalar field (inflaton) under the slow-roll approximation. We study the resulting inflationary phenomenology for power-law and Starobinsky potentials. For power-law potentials, the MHR modification fails to reconcile these models with current CMB constraints on $r$ and $n_s$. In contrast, Starobinsky inflation exhibits significant sensitivity to deviations from $n=1$. A perturbative analysis ($n=1+\Delta$) yields corrections to inflationary observables. We observe that the scalar power-spectrum normalization, under a fixed-Starobinsky prescription, imposes the stringent constraint $0.960 \lesssim n \lesssim 1.040$ for $N=60$ efolds. This is considerably tighter than spectral-index bounds. Our results establish inflation, particularly Starobinsky-like models, as a sensitive probe of generalized horizon thermodynamics and departures from standard MHR scaling.

gr-qc↗
arXiv2026

Improving the Sensitivity of Gravitational Wave Detection with Weighted Conformal Prediction

In the last decade, kilometre-scale interferometric gravitational-wave detectors have observed hundreds of compact binary mergers, the majority of which are binary black holes. However, the data are noise-dominated, and multiple independent search algorithms (pipelines) are used to enhance sensitivity and improve robustness. Rather than the standard approach of selecting the most significant pipeline output, we combine the outputs from all pipelines using a conformal prediction-based framework to provide statistically rigorous confidence estimates for candidate events. While combining pipelines improves sensitivity and ranking robustness, it requires a principled statistical framework that remains valid as data properties evolve across observing runs. A key challenge is distribution shifts between simulated datasets used for training and calibration and the real, unlabelled, observations used for testing, which can invalidate coverage guarantees and bias confidence estimates. In this work, we address this challenge by incorporating likelihood-ratio reweighting into our conformal prediction framework to account for covariate shift. Using mock datasets containing simulated signals, we demonstrate that weighted conformal prediction restores well-calibrated coverage under covariate shift and increases the confidence of events near the detection threshold, recovering true signals that would otherwise be missed.

gr-qc↗