paper-with-me

홈 › Papers

Attention Based Machine Learning Methods for Data Reduction with Guaranteed Error Bounds

2024-09-09 · Xiao Li, Jaemoon Lee, Anand Rangarajan, Sanjay Ranka

Scientific applications in fields such as high energy physics, computational fluid dynamics, and climate science generate vast amounts of data at high velocities. This exponential growth in data production is surpassing the advancements in computing power, network capabilities, and storage capacities. To address this challenge, data compression or reduction techniques are crucial. These scientific datasets have underlying data structures that consist of structured and block structured multidimensional meshes where each grid point corresponds to a tensor. It is important that data reduction techniques leverage strong spatial and temporal correlations that are ubiquitous in these applications. Additionally, applications such as CFD, process tensors comprising hundred plus species and their attributes at each grid point. Reduction techniques should be able to leverage interrelationships between the elements in each tensor. In this paper, we propose an attention-based hierarchical compression method utilizing a block-wise compression setup. We introduce an attention-based hyper-block autoencoder to capture inter-block correlations, followed by a block-wise encoder to capture block-specific information. A PCA-based post-processing step is employed to guarantee error bounds for each data block. Our method effectively captures both spatiotemporal and inter-variable correlations within and between data blocks. Compared to the state-of-the-art SZ3, our method achieves up to 8 times higher compression ratio on the multi-variable S3D dataset. When evaluated on single-variable setups using the E3SM and XGC datasets, our method still achieves up to 3 times and 2 times higher compression ratio, respectively.

📄 PDF Abstract BibTeX arXiv:2409.05357

Code (0)

등록된 구현이 없습니다.

Tasks

Data Compression

Similar Papers 제목 키워드 기반

Safety Verification of Neural Network Control Systems Using Guaranteed Neural Network Model Reduction

2023-01-17 · Weiming Xiang, Zhongzhu Shao

This paper aims to enhance the computational efficiency of safety verification of neural network control systems by developing a guaranteed neural network model reduction method. First, a concept of model reduction preci…

Computational Efficiency

Speed-Constrained Tuning for Statistical Machine Translation Using Bayesian Optimization

2016-04-18 · NAACL 2016 6 · Daniel Beck, Adrià De Gispert, Gonzalo Iglesias, Aurelien Waite 외

We address the problem of automatically finding the parameters of a statistical machine translation system that maximize BLEU scores while ensuring that decoding speed exceeds a minimum value. We propose the use of Bayes…

Bayesian OptimizationMachine TranslationTranslation

Harnessing Structures in Big Data via Guaranteed Low-Rank Matrix Estimation

2018-02-23 · Yudong Chen, Yuejie Chi

Low-rank modeling plays a pivotal role in signal processing and machine learning, with applications ranging from collaborative filtering, video surveillance, medical imaging, to dimensionality reduction and adaptive filt…

Collaborative FilteringDimensionality Reduction

MKL-RT: Multiple Kernel Learning for Ratio-trace Problems via Convex Optimization

2014-10-16 · Raviteja Vemulapalli, Vinay Praneeth Boda, Rama Chellappa

In the recent past, automatic selection or combination of kernels (or features) based on multiple kernel learning (MKL) approaches has been receiving significant attention from various research communities. Though MKL ha…

Cross-Modal RetrievalDimensionality ReductionRetrieval

The Unreasonable Effectiveness of Structured Random Orthogonal Embeddings

2017-03-02 · NeurIPS 2017 12 · Krzysztof Choromanski, Mark Rowland, Adrian Weller

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both t…

BIG-bench Machine LearningDimensionality Reduction