CHARM:利用自动回归多级网络创建光环

Shivam Pandey, Chirag Modi, Benjamin D. Wandelt, Deaglan J. Bartlett, Adrian E. Bayer, Greg L. Bryan, Matthew Ho, Guilhem Lavaux, T. Lucas Makinen, Francisco Villaescusa-Navarro
{"title":"CHARM:利用自动回归多级网络创建光环","authors":"Shivam Pandey, Chirag Modi, Benjamin D. Wandelt, Deaglan J. Bartlett, Adrian E. Bayer, Greg L. Bryan, Matthew Ho, Guilhem Lavaux, T. Lucas Makinen, Francisco Villaescusa-Navarro","doi":"arxiv-2409.09124","DOIUrl":null,"url":null,"abstract":"To maximize the amount of information extracted from cosmological datasets,\nsimulations that accurately represent these observations are necessary.\nHowever, traditional simulations that evolve particles under gravity by\nestimating particle-particle interactions (N-body simulations) are\ncomputationally expensive and prohibitive to scale to the large volumes and\nresolutions necessary for the upcoming datasets. Moreover, modeling the\ndistribution of galaxies typically involves identifying virialized dark matter\nhalos, which is also a time- and memory-consuming process for large N-body\nsimulations, further exacerbating the computational cost. In this study, we\nintroduce CHARM, a novel method for creating mock halo catalogs by matching the\nspatial, mass, and velocity statistics of halos directly from the large-scale\ndistribution of the dark matter density field. We develop multi-stage neural\nspline flow-based networks to learn this mapping at redshift z=0.5 directly\nwith computationally cheaper low-resolution particle mesh simulations instead\nof relying on the high-resolution N-body simulations. We show that the mock\nhalo catalogs and painted galaxy catalogs have the same statistical properties\nas obtained from $N$-body simulations in both real space and redshift space.\nFinally, we use these mock catalogs for cosmological inference using\nredshift-space galaxy power spectrum, bispectrum, and wavelet-based statistics\nusing simulation-based inference, performing the first inference with\naccelerated forward model simulations and finding unbiased cosmological\nconstraints with well-calibrated posteriors. The code was developed as part of\nthe Simons Collaboration on Learning the Universe and is publicly available at\n\\url{https://github.com/shivampcosmo/CHARM}.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":"16 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CHARM: Creating Halos with Auto-Regressive Multi-stage networks\",\"authors\":\"Shivam Pandey, Chirag Modi, Benjamin D. Wandelt, Deaglan J. Bartlett, Adrian E. Bayer, Greg L. Bryan, Matthew Ho, Guilhem Lavaux, T. Lucas Makinen, Francisco Villaescusa-Navarro\",\"doi\":\"arxiv-2409.09124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To maximize the amount of information extracted from cosmological datasets,\\nsimulations that accurately represent these observations are necessary.\\nHowever, traditional simulations that evolve particles under gravity by\\nestimating particle-particle interactions (N-body simulations) are\\ncomputationally expensive and prohibitive to scale to the large volumes and\\nresolutions necessary for the upcoming datasets. Moreover, modeling the\\ndistribution of galaxies typically involves identifying virialized dark matter\\nhalos, which is also a time- and memory-consuming process for large N-body\\nsimulations, further exacerbating the computational cost. In this study, we\\nintroduce CHARM, a novel method for creating mock halo catalogs by matching the\\nspatial, mass, and velocity statistics of halos directly from the large-scale\\ndistribution of the dark matter density field. We develop multi-stage neural\\nspline flow-based networks to learn this mapping at redshift z=0.5 directly\\nwith computationally cheaper low-resolution particle mesh simulations instead\\nof relying on the high-resolution N-body simulations. We show that the mock\\nhalo catalogs and painted galaxy catalogs have the same statistical properties\\nas obtained from $N$-body simulations in both real space and redshift space.\\nFinally, we use these mock catalogs for cosmological inference using\\nredshift-space galaxy power spectrum, bispectrum, and wavelet-based statistics\\nusing simulation-based inference, performing the first inference with\\naccelerated forward model simulations and finding unbiased cosmological\\nconstraints with well-calibrated posteriors. The code was developed as part of\\nthe Simons Collaboration on Learning the Universe and is publicly available at\\n\\\\url{https://github.com/shivampcosmo/CHARM}.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.09124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

然而,传统的模拟是通过估计粒子与粒子之间的相互作用来实现粒子在引力作用下的演化(N-体模拟),其计算成本非常昂贵,而且无法扩展到即将到来的数据集所需的大体积和高分辨率。此外,星系分布建模通常涉及识别病毒化暗物质光环,这对于大型 N-体模拟也是一个耗时耗内存的过程,进一步加剧了计算成本。在这项研究中,我们引入了 CHARM,这是一种通过直接从暗物质密度场的大尺度分布中匹配光环的空间、质量和速度统计来创建模拟光环目录的新方法。我们开发了基于神经线流的多级网络,在红移 z=0.5 时直接利用计算成本更低的低分辨率粒子网格模拟来学习这种映射,而不是依赖高分辨率的 N-体模拟。最后,我们利用这些模拟星表,使用红移空间星系功率谱、双谱和基于小波的统计量进行了基于模拟的宇宙学推断,首次使用加速前向模型模拟进行了推断,并找到了具有良好校准后验的无偏宇宙学约束。该代码是 "学习宇宙 "西蒙斯合作组织(Simons Collaboration on Learning the Universe)的一部分,可在以下网址公开获取:url{https://github.com/shivampcosmo/CHARM}。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CHARM: Creating Halos with Auto-Regressive Multi-stage networks
To maximize the amount of information extracted from cosmological datasets, simulations that accurately represent these observations are necessary. However, traditional simulations that evolve particles under gravity by estimating particle-particle interactions (N-body simulations) are computationally expensive and prohibitive to scale to the large volumes and resolutions necessary for the upcoming datasets. Moreover, modeling the distribution of galaxies typically involves identifying virialized dark matter halos, which is also a time- and memory-consuming process for large N-body simulations, further exacerbating the computational cost. In this study, we introduce CHARM, a novel method for creating mock halo catalogs by matching the spatial, mass, and velocity statistics of halos directly from the large-scale distribution of the dark matter density field. We develop multi-stage neural spline flow-based networks to learn this mapping at redshift z=0.5 directly with computationally cheaper low-resolution particle mesh simulations instead of relying on the high-resolution N-body simulations. We show that the mock halo catalogs and painted galaxy catalogs have the same statistical properties as obtained from $N$-body simulations in both real space and redshift space. Finally, we use these mock catalogs for cosmological inference using redshift-space galaxy power spectrum, bispectrum, and wavelet-based statistics using simulation-based inference, performing the first inference with accelerated forward model simulations and finding unbiased cosmological constraints with well-calibrated posteriors. The code was developed as part of the Simons Collaboration on Learning the Universe and is publicly available at \url{https://github.com/shivampcosmo/CHARM}.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fitting Multilevel Factor Models Cartan moving frames and the data manifolds Symmetry-Based Structured Matrices for Efficient Approximately Equivariant Networks Recurrent Interpolants for Probabilistic Time Series Prediction PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusive and Exclusive Communities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1