Skip to content
Book

Bridging Information Theory and Practice for Scientific Lossy Compression

Jul 2026 · IEEE International Symposium on High-Performance Parallel Distributed Computing · pp. 207-220 · 0 citations · 53 references
Computer Science

TL;DR

This paper develops a novel framework that characterizes compressibility limits for scientific datasets under realistic tiling constraints, and is the first framework to rigorously characterize lossy compressibility limits for scientific datasets and compressor, moving beyond classical asymptotic 1D source models.

Abstract

Error-bounded lossy compressors have been developed for years to reduce the vast volumes of scientific data generated by high-performance computing (HPC) applications and advanced scientific instruments. While these compressors have been effective in mitigating the challenges posed by massive datasets, a significant gap remains in our understanding of the fundamental compressibility limits of scientific data–an issue that critically impacts the sustainable adoption and development of efficient lossy compression techniques in practice. Classical rate-distortion theory, established by Shannon, assumes stationary 1D sources with unconstrained coding–assumptions that do not hold for scientific datasets compressed under the tiling constraints imposed by modern parallel lossy compressors. This paper addresses this gap by developing a novel framework that characterizes compressibility limits for scientific datasets under realistic tiling constraints. The contribution is two-fold. First, we establish a tile-aware, finite-blocklength extension of rate–distortion theory that advances classical 1D asymptotic formulations into a rigorous framework for piecewise 2D Gaussian random fields. To our knowledge, this is the first framework to rigorously characterize lossy compressibility limits for scientific datasets and compressor, moving beyond classical asymptotic 1D source models. Second, we conduct a comprehensive validation of the proposed modeling framework using state-of-the-art error-bounded lossy compressors and diverse real-world HPC datasets, demonstrating that our theory accurately predicts rate-distortion trends and provides actionable insights for compressor design.

View source

Similar papers

Open access Jul 2026

Error-Bounded Point Cloud Compression Using Truncated Octahedron Quantization

XnYZip is introduced, an error-bounded lossy compressor based on provably optimal Truncated Octahedron quantization, combined with a locality-aware encoding pipeline using space-filling curves and run-length encoding, to develop a theory of point cloud compressibility for dense data.

You-Yuan Liu, Longtao Zhang, Ruoyu Li et al. · 0 citations

Cortado: Progressive Retrieval of Lossily Compressed Data with Guaranteed Error Bounds

Cortado is compared with state-of-the-art approaches and it is found that it is the only progressive compressor that guarantees the evaluated error bounds on all tested inputs while achieving the highest throughputs, comparable reconstruction quality, and on-par compression ratios.

B. Burtchell, Martin Burtscher · 0 citations
Preprint Aug 2026

FaCTz: Fast Critical-Point and Topology-Aware GPU Compression for Scientific Vector Fields

FaCTz is presented, the first GPU-based error-bounded lossy compressor that guarantees critical-point preservation and provides a block-wise mode optimized for throughput and a speculative per-point mode optimized for compression ratio.

Mingze Xia, Yu-Xiao Li, Sheng Di et al. · 0 citations
Preprint Jul 2026

Lossless Compression Performance for PETRA III Datasets

This first comprehensive study of data heterogeneity and lossless general-purpose compression performance for representative datasets from the PETRA III synchrotron radiation source provides a quantitative basis for future archival and storage decisions at PETRA III, its future successor, PETRA IV, and other large-scal...

M. Buschmann, Yannis Schumann, Christian Voss et al. · 0 citations
Preprint Aug 2026

Diffuse to Compress: Leveraging Diffusion LMs for Lossless Compression

It is argued that replacing autoregressive LLMs with DLMs within the same compression framework could overcome the throughput bottleneck caused by their one-symbol-per-step limitation, and the newly proposed DLM-based framework advances the state of the art in lossless text compression.

Angelo Nardone, P. Ferragina · 0 citations
Preprint Aug 2026

TOPIQ: Statistical Error Propagation for Quantity-of-Interest Prediction under Lossy Compression

TOPIQ is presented, a statistical error-propagation framework that predicts QoI-level bias and uncertainty from compact compression metadata (less than 0.1% of original data) and decomposes QoIs into primitive operators with closed-form propagation rules accounting for spatial error correlation and data-error coupling.

You-Yuan Liu, Bo Jiang, Taolue Yang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.