Determination of the relative inclination and the viewing angle of an interacting pair of galaxies using convolutional neural networks

• URL: http://arxiv.org/abs/2002.01238v2
• Date: Thu, 30 Jul 2020 06:42:42 GMT
• Title: Determination of the relative inclination and the viewing angle of an interacting pair of galaxies using convolutional neural networks
• Authors: Prem Prakash, Arunima Banerjee, Pavan Kumar Perepu
• Abstract summary: We construct Deep Convolutional Neural Network (DCNN) models to determine the relative inclination ($i$) and the viewing angle ($theta$) of interacting galaxy pairs. For a classification based on both $i$ and $theta$ values, we develop a DCNN model for a 9-class classification ($(i,theta) sim (0circ,15circ),(0circ,45circ), (0circ,90circ), (45circ, 45circ), (90circ,
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Constructing dynamical models for interacting pair of galaxies as constrained by their observed structure and kinematics crucially depends on the correct choice of the values of the relative inclination ($i$) between their galactic planes as well as the viewing angle ($\theta$), the angle between the line of sight and the normal to the plane of their orbital motion. We construct Deep Convolutional Neural Network (DCNN) models to determine the relative inclination ($i$) and the viewing angle ($\theta$) of interacting galaxy pairs, using N-body $+$ Smoothed Particle Hydrodynamics (SPH) simulation data from the GALMER database for training the same. In order to classify galaxy pairs based on their $i$ values only, we first construct DCNN models for a (a) 2-class ( $i$ = 0 $^{\circ}$, 45$^{\circ}$ ) and (b) 3-class ($i = 0^{\circ}, 45^{\circ} \text{ and } 90^{\circ}$) classification, obtaining $F_1$ scores of 99% and 98% respectively. Further, for a classification based on both $i$ and $\theta$ values, we develop a DCNN model for a 9-class classification ($(i,\theta) \sim (0^{\circ},15^{\circ}) ,(0^{\circ},45^{\circ}), (0^{\circ},90^{\circ}), (45^{\circ},15^{\circ}), (45^{\circ}, 45^{\circ}), (45^{\circ}, 90^{\circ}), (90^{\circ}, 15^{\circ}), (90^{\circ}, 45^{\circ}), (90^{\circ},90^{\circ})$), and the $F_1$ score was 97$\%$. Finally, we tested our 2-class model on real data of interacting galaxy pairs from the Sloan Digital Sky Survey (SDSS) DR15, and achieve an $F_1$ score of 78%. Our DCNN models could be further extended to determine additional parameters needed to model dynamics of interacting galaxy pairs, which is currently accomplished by trial and error method.

Related papers

• The Optimization Landscape of SGD Across the Feature Learning Strength [102.1353410293931]
  We study the effect of scaling $gamma$ across a variety of models and datasets in the online training setting. We find that optimal online performance is often found at large $gamma$. Our findings indicate that analytical study of the large-$gamma$ limit may yield useful insights into the dynamics of representation learning in performant models.
  arXiv  Detail & Related papers  (2024-10-06T22:30:14Z)
• Learning Galaxy Intrinsic Alignment Correlations [16.805775045014578]
  The intrinsic alignments (IA) of galaxies represent the correlation of galaxy shapes due to gravitational tidal interactions and galaxy formation processes. We present a deep learning approach to emulate galaxy position-position, position-orientation, and orientation-orientation correlation function measurements and uncertainties.
  arXiv  Detail & Related papers  (2024-04-21T16:16:56Z)
• Robust Field-level Likelihood-free Inference with Galaxies [0.0]
  We train graph neural networks to perform field-level likelihood-free inference using galaxy catalogs from state-of-the-art hydrodynamic simulations of the CAMELS project. Our models are rotational, translational, and permutation invariant and do not impose any cut on scale. We find that our models are robust to changes in astrophysics, subgrid physics, and subhalo/galaxy finder.
  arXiv  Detail & Related papers  (2023-02-27T19:26:13Z)
• Using Machine Learning to Determine Morphologies of $z<1$ AGN Host Galaxies in the Hyper Suprime-Cam Wide Survey [4.747578120823036]
  We present a machine-learning framework to accurately characterize morphologies of AGN host galaxies within $z1$. By first training on a large number of simulated galaxies, then fine-tuning using far fewer classified real galaxies, our framework predicts the actual morphology for $sim$ $60%-70%$ host galaxies from test sets. Our models achieve disk precision of $96%/82%/79%$ and bulge precision of $90%/90%/80%$, at thresholds corresponding to indeterminate fractions of $30%/43%/42
  arXiv  Detail & Related papers  (2022-12-20T04:00:58Z)
• Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks [0.0]
  We introduce fluctuations on galaxy-galaxy lensing scales of $sim$1$''$ and extract random sightlines to train our BGNN. For each test set of 1,000 sightlines, the BGNN infers the individual $kappa$ posteriors, which we combine in a hierarchical Bayesian model. For a test field well sampled by the training set, the BGNN recovers the population mean of $kappa$ precisely and without bias.
  arXiv  Detail & Related papers  (2022-11-15T00:29:20Z)
• Predicting the Stability of Hierarchical Triple Systems with Convolutional Neural Networks [68.8204255655161]
  We propose a convolutional neural network model to predict the stability of hierarchical triples. All trained models are made publicly available, allowing to predict the stability of hierarchical triple systems $200$ times faster than pure $N$-body methods.
  arXiv  Detail & Related papers  (2022-06-24T17:58:13Z)
• High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation [89.21686761957383]
  We study the first gradient descent step on the first-layer parameters $boldsymbolW$ in a two-layer network. Our results demonstrate that even one step can lead to a considerable advantage over random features.
  arXiv  Detail & Related papers  (2022-05-03T12:09:59Z)
• Learning cosmology and clustering with cosmic graphs [0.0]
  We train deep learning models on thousands of galaxy catalogues from the state-of-the-art hydrodynamic simulations of the CAMELS project. We first show that GNNs can learn to compute the power spectrum of galaxy catalogues with a few percent accuracy. We then train GNNs to perform likelihood-free inference at the galaxy-field level.
  arXiv  Detail & Related papers  (2022-04-28T18:00:02Z)
• Satellite galaxy abundance dependency on cosmology in Magneticum simulations [101.18253437732933]
  We build an emulator of satellite abundance based on cosmological parameters. We find that $A$ and $beta$ depend on cosmological parameters, even if weakly. We also show that satellite abundance cosmology dependency differs between full-physics (FP) simulations, dark-matter only (DMO) and non-radiative simulations.
  arXiv  Detail & Related papers  (2021-10-11T18:00:02Z)
• DeepShadows: Separating Low Surface Brightness Galaxies from Artifacts using Deep Learning [70.80563014913676]
  We investigate the use of convolutional neural networks (CNNs) for the problem of separating low-surface-brightness galaxies from artifacts in survey images. We show that CNNs offer a very promising path in the quest to study the low-surface-brightness universe.
  arXiv  Detail & Related papers  (2020-11-24T22:51:08Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.