论文标题
对光环合并树建筑的深度学习方法
A deep learning approach to halo merger tree construction
论文作者
论文摘要
银河系的半分析模型(SAM)的关键成分是光环的质量组装历史,该历史是在树结构中编码的。构建光环合并历史的最常用方法是基于高分辨率,计算密集的N体型模拟的结果。我们表明,机器学习(ML)技术,特别是生成对抗网络(GAN),是一种有希望的新工具,可以通过适度的计算成本解决此问题,并从模拟中保留合并树的最佳功能。我们通过使用两个Halo Finder-Tree-Tree Builder算法构建的星系及其环境(Eagle)模拟套件的有限的合并树样品来训练我们的GAN模型。我们的GAN模型成功地学习了具有高时间分辨率的结构良好的合并树结构,并在考虑训练过程中最多三个变量时重现了用于训练的合并树样本的统计特征。这些输入(也是我们的GAN模型也学到的表示的)是晕光祖细胞和最终后代,祖细胞类型(主晕或卫星)以及祖细胞在主分支中的距离。后两个输入的包含大大改善了对光环质量生长历史的最终学说,尤其是对于子发现样的ML树。当比较ML合并树的同等大小的样本与鹰模拟的样本时,我们发现了与子发现样的ML树的更好一致性。最后,我们的基于GAN的框架可用于构建低和中间质量光环的合并历史,这是宇宙学模拟中最丰富的。
A key ingredient for semi-analytic models (SAMs) of galaxy formation is the mass assembly history of haloes, encoded in a tree structure. The most commonly used method to construct halo merger histories is based on the outcomes of high-resolution, computationally intensive N-body simulations. We show that machine learning (ML) techniques, in particular Generative Adversarial Networks (GANs), are a promising new tool to tackle this problem with a modest computational cost and retaining the best features of merger trees from simulations. We train our GAN model with a limited sample of merger trees from the Evolution and Assembly of GaLaxies and their Environments (EAGLE) simulation suite, constructed using two halo finders-tree builder algorithms: SUBFIND-D-TREES and ROCKSTAR-ConsistentTrees. Our GAN model successfully learns to generate well-constructed merger tree structures with high temporal resolution, and to reproduce the statistical features of the sample of merger trees used for training, when considering up to three variables in the training process. These inputs, whose representations are also learned by our GAN model, are mass of the halo progenitors and the final descendant, progenitor type (main halo or satellite) and distance of a progenitor to that in the main branch. The inclusion of the latter two inputs greatly improves the final learned representation of the halo mass growth history, especially for SUBFIND-like ML trees. When comparing equally sized samples of ML merger trees with those of the EAGLE simulation, we find better agreement for SUBFIND-like ML trees. Finally, our GAN-based framework can be utilised to construct merger histories of low- and intermediate-mass haloes, the most abundant in cosmological simulations.