arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.00565gr-qcastro-ph.HEastro-ph.IM
收藏

利用序列神经似然实现LISA的大质量黑洞双体参数高效估计

Efficient Massive Black Hole Binary parameter estimation for LISA using Sequential Neural Likelihood

Iván Martín Vílchez, Carlos F. Sopuerta

AI总结:

本研究将序列神经似然算法应用于LISA的大质量黑洞双体引力波参数估计,仅用不到马尔可夫链蒙特卡洛方法2%的模拟器调用量即可得到定性相似的后验,大幅降低了计算成本。

摘要:

大质量黑洞双体(MBHBs)的旋进、并合与铃振是未来激光干涉空间天线(LISA)的主要引力波(GWs)源之一,LISA是由欧空局主导、处于实施阶段的任务。预计LISA将能在整个可观测宇宙中探测到这类系统。我们需要稳健且高效的数据分析算法来探测这类系统并估计其物理参数。在本研究中,我们探索了序列神经似然(一种基于模拟的推理算法)在合成LISA数据中探测与表征MBHB引力波信号的应用。我们详细描述了该方法的不同组成部分、其性能以及可用于提升性能的替代方案。该方法无需从传统似然函数中采样——传统似然函数每次评估都需要一次正向模拟——而是构建了一个代理似然,最终由一个在MBHB信号与噪声模拟数据集上训练的神经网络来描述。该方法的一个重要优势在于,由于似然与先验无关,我们可以针对特定观测迭代训练模型,所需时间和计算成本仅为其他传统策略及基于机器学习的策略的一小部分。得益于该方法的迭代特性,我们仅需马尔可夫链蒙特卡洛方法所需模拟器调用次数的不到2%,就能训练模型得到定性相似的后验分布。我们将这些后验分布与通过马尔可夫链蒙特卡洛技术得到的后验分布进行了对比,并讨论了出现的差异,尤其是与数据压缩在我们提出的方法模块化实现中的重要作用相关的差异。我们还讨论了提升该算法性能的不同策略。

英文摘要:

The inspiral, merger, and ringdown of Massive Black Hole Binaries (MBHBs) is one the main sources of Gravitational Waves (GWs) for the future Laser Interferometer Space Antenna (LISA), an ESA-led mission in the implementation phase. It is expected that LISA will detect these systems throughout the entire observable universe. Robust and efficient data analysis algorithms are necessary to detect and estimate physical parameters for these systems. In this work, we explore the application of Sequential Neural Likelihood, a simulation-based inference algorithm, to detect and characterize MBHB GW signals in synthetic LISA data. We describe in detail the different elements of the method, their performance and possible alternatives that can be used to enhance the performance. Instead of sampling from the conventional likelihood function, which requires a forward simulation for each evaluation, this method constructs a surrogate likelihood that is ultimately described by a neural network trained from a dataset of simulations of the MBHB signals and noise. One important advantage of this method is that, given that the likelihood is independent of the priors, we can iteratively train models that target specific observations in a fraction of the time and computational cost that other traditional and machine learning-based strategies would require. Because of the iterative nature of the method, we are able to train models to obtain qualitatively similar posteriors with less than 2\% of the simulator calls that Markov Chain Monte Carlo methods would require. We compare these posteriors with those obtained from Markov Chain Monte Carlo techniques and discuss the differences that appear, in particular in relation with the important role that data compression has in the modular implementation of the method that we present. We also discuss different strategies to improve the performance of the algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑