TY - JOUR
T1 - Locality-based transfer learning on compression autoencoder for efficient scientific data lossy compression
AU - Wang, Nan
AU - Liu, Tong
AU - Wang, Jinzhen
AU - Liu, Qing
AU - Alibhai, Shakeel
AU - He, Xubin
N1 - Funding Information:
We would like to thank the anonymous reviewers for their valuable comments and feedback. This work was partially supported by the US National Science Foundation NSF-1828363 , NSF-1813081 , CCF-2134203 , CCF-2134202 , CCF-1812861 , and New Jersey Institute of Technology (NJIT) research startup fund. The authors also wish to acknowledge the support from the NSF Chameleon cloud which is used for some of the experiments.
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/9
Y1 - 2022/9
N2 - Scientific simulation can generate petabyte-level data per run nowadays. To significantly reduce the data size while simultaneously maintaining the compression quality based on certain user requirements, error-bounded lossy compression techniques such as SZ and ZFP are now becoming popular. However, these techniques still cannot achieve a reduction ratio of more than two orders of magnitude with a low compression error. On the other hand, in deep learning, the autoencoder techniques have been widely used in data compression, especially images. As an alternative, the compression autoencoder (CAE) has recently been investigated to compress the scientific data. Although CAE provides a higher compression ratio than SZ and ZFP, it suffers from a high training overhead, which makes it almost impractical in real compression scenarios. In this paper, we propose a new locality-based transfer learning method in order to significantly increase the training speed of CAE while achieving a high compression ratio. We also adopt incremental learning to maintain a high prediction accuracy and use KL-divergence as an indicator to quickly identify whether a target domain has a low testing error. Our evaluation results show that, after using the locality-based transfer learning, the training time can be reduced by up to 1200 times, and still has a 2 to 4X compression ratio gain over the state-of-the-art scientific data lossy compressor SZ.
AB - Scientific simulation can generate petabyte-level data per run nowadays. To significantly reduce the data size while simultaneously maintaining the compression quality based on certain user requirements, error-bounded lossy compression techniques such as SZ and ZFP are now becoming popular. However, these techniques still cannot achieve a reduction ratio of more than two orders of magnitude with a low compression error. On the other hand, in deep learning, the autoencoder techniques have been widely used in data compression, especially images. As an alternative, the compression autoencoder (CAE) has recently been investigated to compress the scientific data. Although CAE provides a higher compression ratio than SZ and ZFP, it suffers from a high training overhead, which makes it almost impractical in real compression scenarios. In this paper, we propose a new locality-based transfer learning method in order to significantly increase the training speed of CAE while achieving a high compression ratio. We also adopt incremental learning to maintain a high prediction accuracy and use KL-divergence as an indicator to quickly identify whether a target domain has a low testing error. Our evaluation results show that, after using the locality-based transfer learning, the training time can be reduced by up to 1200 times, and still has a 2 to 4X compression ratio gain over the state-of-the-art scientific data lossy compressor SZ.
KW - Autoencoder
KW - HPC
KW - Incremental learning
KW - Lossy data compression
KW - Machine learning
KW - Transfer learning
UR - http://www.scopus.com/inward/record.url?scp=85133943100&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85133943100&partnerID=8YFLogxK
U2 - 10.1016/j.jnca.2022.103452
DO - 10.1016/j.jnca.2022.103452
M3 - Article
AN - SCOPUS:85133943100
SN - 1084-8045
VL - 205
JO - Journal of Network and Computer Applications
JF - Journal of Network and Computer Applications
M1 - 103452
ER -