arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.10032astro-ph.IMastro-ph.CO
收藏

利用归一化流进行光度红移估计

Photo-$z$ Estimation with Normalizing Flow

School of Physics and Astronomy, Sun Yat-Sen University(中山大学物理与天文学院);CSST Science Center for the Guangdong-Hongkong-Macau Greater Bay Area, SYSU(粤港澳大湾区空间望远镜科学中心,中山大学);Department of Mathematics and Theory, Peng Cheng Laboratory(鹏城实验室数学与理论部);National Astronomical Observatories, Chinese Academy of Sciences(中国科学院国家天文台);School of Astronomy and Space Sciences, University of Chinese Academy of Sciences (UCAS)(中国科学院大学天文与空间科学学院);Science Center for China Space Station Telescope, National Astronomical Observatories, Chinese Academy of Sciences(中国空间站望远镜科学中心,中国科学院国家天文台)

Yiming Ren, Kwan Chuen Chan, Le Zhang, Yin Li, Haolin Zhang, Ruiyu Song, Yan Gong, Xian-Min Meng, Xingchen Zhou

AI总结:

本文提出nflow-z方法,利用归一化流技术有效估计光度红移,优于传统算法并在多个数据集上取得显著改进。

摘要:

准确的光度红移(photo-z)估计是宇宙学中的关键挑战,因为光度红移的不确定性会直接限制大尺度结构和弱引力透镜研究的科学回报,尤其是在即将到来的第四阶段(Stage IV)调查中。该问题在稀疏光谱训练数据的暗弱星系上尤为严重。在本工作中,我们引入了nflow-z,一种利用强大机器学习技术归一化流的新型光度红移估计方法。nflow-z明确建模了观测变量(如通量和颜色)条件下的红移概率分布。我们构建了两种nflow-z实现,分别称为cINN和cNSF,并比较了它们的性能。我们展示了nflow-z在多个数据集上的有效性,包括CSST模拟数据集、COSMOS2020目录以及来自DES Y1、SDSS和DESCaLS的数据样本。我们的评估表明,nflow-z在与最先进算法的比较中表现良好。例如,cNSF在CSST模拟测试中超过了随机森林、多层感知机和卷积中性网络。我们还在暗弱DESCaLS样本上实现了约30%的官方结果改进,并在DES Y1数据集测试中优于条件生成对抗网络和混合密度网络方法。此外,nflow-z计算效率高,仅需要一些竞争算法计算时间的分数。我们的算法在稀疏训练数据的暗弱样本上特别有效,使其非常适合即将到来的第四阶段调查。

英文摘要:

Accurate photometric redshift (photo-$z$) estimation is a key challenge in cosmology, as uncertainties in photo-$z$ directly limit the scientific return of large-scale structure and weak lensing studies, especially in upcoming Stage IV surveys. The problem is particularly severe for faint galaxies with sparse spectroscopic training data. In this work, we introduce nflow-$z$, a novel photo-$z$ estimation method using the powerful machine learning technique of normalizing flow. nflow-$z$ explicitly models the redshift probability distribution conditioned on the observables such as fluxes and colors. We build two nflow-$z$ implementations, dubbed cINN and cNSF, and compare their performance. We demonstrate the effectiveness of nflow-$z$ on several datasets, including a CSST mock, the COSMOS2020 catalog, and samples from DES Y1, SDSS, and DESCaLS. Our evaluation against state-of-the-art algorithms shows that nflow-$z$ performs favorably. For instance, cNSF surpasses Random Forest, Multi-Layer Perceptron, and Convolutional Neutral Network on the CSST mock test. We also achieve a ~30% improvement over official results for the faint DESCaLS sample and outperform conditional Generative Adversarial Network and Mixture Density Network methods on the DES Y1 dataset test. Furthermore, nflow-$z$ is computationally efficient, requiring only a fraction of the computing time of some of the competing algorithms. Our algorithm is particularly effective for the faint sample with sparse training data, making it highly suitable for upcoming Stage IV surveys.

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

↑