DeepMerge II: Building Robust Deep Learning Algorithms for Merging
Galaxy Identification Across Domains
- URL: http://arxiv.org/abs/2103.01373v1
- Date: Tue, 2 Mar 2021 00:24:10 GMT
- Title: DeepMerge II: Building Robust Deep Learning Algorithms for Merging
Galaxy Identification Across Domains
- Authors: A. \'Ciprijanovi\'c, D. Kafkes, K. Downey, S. Jenkins, G. N. Perdue,
S. Madireddy, T. Johnston, G. F. Snyder, B. Nord
- Abstract summary: In astronomy, neural networks are often trained on simulation data with the prospect of being used on telescope observations.
We show that the addition of each domain adaptation technique improves the performance of a classifier when compared to conventional deep learning algorithms.
We demonstrate this on two examples: between two Illustris-1 simulated datasets of distant merging galaxies, and between Illustris-1 simulated data of nearby merging galaxies and observed data from the Sloan Digital Sky Survey.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In astronomy, neural networks are often trained on simulation data with the
prospect of being used on telescope observations. Unfortunately, training a
model on simulation data and then applying it to instrument data leads to a
substantial and potentially even detrimental decrease in model accuracy on the
new target dataset. Simulated and instrument data represent different data
domains, and for an algorithm to work in both, domain-invariant learning is
necessary. Here we employ domain adaptation techniques$-$ Maximum Mean
Discrepancy (MMD) as an additional transfer loss and Domain Adversarial Neural
Networks (DANNs)$-$ and demonstrate their viability to extract domain-invariant
features within the astronomical context of classifying merging and non-merging
galaxies. Additionally, we explore the use of Fisher loss and entropy
minimization to enforce better in-domain class discriminability. We show that
the addition of each domain adaptation technique improves the performance of a
classifier when compared to conventional deep learning algorithms. We
demonstrate this on two examples: between two Illustris-1 simulated datasets of
distant merging galaxies, and between Illustris-1 simulated data of nearby
merging galaxies and observed data from the Sloan Digital Sky Survey. The use
of domain adaptation techniques in our experiments leads to an increase of
target domain classification accuracy of up to ${\sim}20\%$. With further
development, these techniques will allow astronomers to successfully implement
neural network models trained on simulation data to efficiently detect and
study astrophysical objects in current and future large-scale astronomical
surveys.
Related papers
- Assessing Neural Network Representations During Training Using
Noise-Resilient Diffusion Spectral Entropy [55.014926694758195]
Entropy and mutual information in neural networks provide rich information on the learning process.
We leverage data geometry to access the underlying manifold and reliably compute these information-theoretic measures.
We show that they form noise-resistant measures of intrinsic dimensionality and relationship strength in high-dimensional simulated data.
arXiv Detail & Related papers (2023-12-04T01:32:42Z) - SPADES: A Realistic Spacecraft Pose Estimation Dataset using Event
Sensing [9.583223655096077]
Due to limited access to real target datasets, algorithms are often trained using synthetic data and applied in the real domain.
Event sensing has been explored in the past and shown to reduce the domain gap between simulations and real-world scenarios.
We introduce a novel dataset, SPADES, comprising real event data acquired in a controlled laboratory environment and simulated event data using the same camera intrinsics.
arXiv Detail & Related papers (2023-11-09T12:14:47Z) - Domain Adaptive Graph Neural Networks for Constraining Cosmological Parameters Across Multiple Data Sets [40.19690479537335]
We show that DA-GNN achieves higher accuracy and robustness on cross-dataset tasks.
This shows that DA-GNNs are a promising method for extracting domain-independent cosmological information.
arXiv Detail & Related papers (2023-11-02T20:40:21Z) - Learning Controllable Adaptive Simulation for Multi-resolution Physics [86.8993558124143]
We introduce Learning controllable Adaptive simulation for Multi-resolution Physics (LAMP) as the first full deep learning-based surrogate model.
LAMP consists of a Graph Neural Network (GNN) for learning the forward evolution, and a GNN-based actor-critic for learning the policy of spatial refinement and coarsening.
We demonstrate that our LAMP outperforms state-of-the-art deep learning surrogate models, and can adaptively trade-off computation to improve long-term prediction error.
arXiv Detail & Related papers (2023-05-01T23:20:27Z) - One-Shot Domain Adaptive and Generalizable Semantic Segmentation with
Class-Aware Cross-Domain Transformers [96.51828911883456]
Unsupervised sim-to-real domain adaptation (UDA) for semantic segmentation aims to improve the real-world test performance of a model trained on simulated data.
Traditional UDA often assumes that there are abundant unlabeled real-world data samples available during training for the adaptation.
We explore the one-shot unsupervised sim-to-real domain adaptation (OSUDA) and generalization problem, where only one real-world data sample is available.
arXiv Detail & Related papers (2022-12-14T15:54:15Z) - Semi-Supervised Domain Adaptation for Cross-Survey Galaxy Morphology
Classification and Anomaly Detection [57.85347204640585]
We develop a Universal Domain Adaptation method DeepAstroUDA.
It can be applied to datasets with different types of class overlap.
For the first time, we demonstrate the successful use of domain adaptation on two very different observational datasets.
arXiv Detail & Related papers (2022-11-01T18:07:21Z) - Improving Astronomical Time-series Classification via Data Augmentation
with Generative Adversarial Networks [1.2891210250935146]
We propose a data augmentation methodology based on Generative Adrial Networks (GANs) to generate a variety of synthetic light curves from variable stars.
The classification accuracy of variable stars is improved significantly when training with synthetic data and testing with real data.
arXiv Detail & Related papers (2022-05-13T16:39:54Z) - Convolutional generative adversarial imputation networks for
spatio-temporal missing data in storm surge simulations [86.5302150777089]
Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods.
We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
arXiv Detail & Related papers (2021-11-03T03:50:48Z) - Reprogramming Language Models for Molecular Representation Learning [65.00999660425731]
We propose Representation Reprogramming via Dictionary Learning (R2DL) for adversarially reprogramming pretrained language models for molecular learning tasks.
The adversarial program learns a linear transformation between a dense source model input space (language data) and a sparse target model input space (e.g., chemical and biological molecule data) using a k-SVD solver.
R2DL achieves the baseline established by state of the art toxicity prediction models trained on domain-specific data and outperforms the baseline in a limited training-data setting.
arXiv Detail & Related papers (2020-12-07T05:50:27Z) - Domain adaptation techniques for improved cross-domain study of galaxy
mergers [0.0]
In astronomy, neural networks are often trained on simulated data with the prospect of being applied to real observations.
Here we demonstrate the use of two techniques - Maximum Mean Discrepancy (MMD) and adversarial training with Domain Adversarial Neural Networks (DANN)
We show how the addition of either MMD or adversarial training greatly improves the performance of the classifier on the target domain when compared to conventional machine learning algorithms.
arXiv Detail & Related papers (2020-11-06T20:42:32Z)
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.