Learning Approximate Isometric Embeddings for Efficient Template Placement
Abstract
The sphere covering problem has broad applications in science however, exact solutions are computationally infeasible on curved, high-dimensional manifolds because distances must be evaluated using a position-dependent metric. We present , a normalizing flow that learns an approximately isometric coordinate transformation, such that Euclidean distances in the latent space approximate metric-induced proper distances in the physical parameter space. This enables template placement using Euclidean distance checks in the latent space, avoiding repeated metric evaluations during placement. We evaluate in the context of gravitational wave template bank construction, where the sphere covering problem corresponds to the template placement problem. On a five-dimensional eccentric binary parameter space, reaches 97% coverage at a maximum mismatch of with 23% fewer templates than the state-of-the-art placement code , which reaches 94% coverage. Coverage is measured on independent injections drawn uniformly over the masses, spins and eccentricity, using the exact waveform match rather than the metric approximation. Training the flow takes about 2.5 h and placing the bank under 1 h on 32 CPU cores. will be made publicly available.
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.