This contains a number of fixes and optimizations to the fast distance marginalization code. We've been able to run the code with the following command in the ILE-GPU-Paper/demos/test_workflow_batch_gpu_lowlatency/ test case that's generated by Travis-CI. However, the results seem off, so there may be a remaining bug or we're calling the code incorrectly. Note that it only runs if --gpuand--force-xpy are provided, though it will still default to numpy if cupy is not installed.
fixes to lookup table accuracy at high SNR using alternative form of integral devised by @SMorisaki [1]
improved interpolation coordinate system devised by @SMorisaki [1]
better use of vectorization
general fixes needed to actually run the code
this includes adding dummy distance samples (all taking the reference value) to the sampler object after it's done
this was done to avoid crashing
if there is another workaround that doesn't involve adding dummy samples we should switch to that -- this will be a problem for other extrinsic marginalization improvements as well
[1] An implementation of distance marginalization LIGO-T2100485
This contains a number of fixes and optimizations to the fast distance marginalization code. We've been able to run the code with the following command in the
ILE-GPU-Paper/demos/test_workflow_batch_gpu_lowlatency/
test case that's generated by Travis-CI. However, the results seem off, so there may be a remaining bug or we're calling the code incorrectly. Note that it only runs if--gpu
and--force-xpy
are provided, though it will still default tonumpy
ifcupy
is not installed.A brief summary of changes:
cupy
support[1] An implementation of distance marginalization LIGO-T2100485