Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.05357 v1 pith:5C4IBS2L submitted 2024-09-09 cs.LG

classification cs.LG
keywords datacompressionmethodreductionapplicationscorrelationstechniquestimes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Generative Latent Diffusion for Efficient Spatiotemporal Data Reduction

    cs.LG 2025-07 conditional novelty 6.0 of 10

    A latent diffusion model conditioned on keyframe latents reconstructs non-key frames, giving higher compression ratios than prior scientific data compressors.

  2. FLARE: A Dataflow-Aware and Scalable Hardware Architecture for Neural-Hybrid Scientific Lossy Compression

    cs.DC 2025-07 reject novelty 5.0 of 10

    The paper proposes a scalable ASIC architecture for neural-hybrid scientific lossy compression and claims large speedups, but the evaluation compares against baselines that produce much lower compression ratios.

Pith tools