Rate-Distortion Bounds for Heterogeneous Random Fields on Finite Lattices
Sujata Sinha, Vishwas Rao, Robert Underwood, David Lenz, Sheng Di, Franck Cappello, Lingjia Liu

TL;DR
This paper develops a finite-blocklength rate-distortion theory for heterogeneous random fields on finite lattices, accounting for practical tiling constraints and spatial heterogeneity in scientific data compression.
Contribution
It introduces a novel framework that models piecewise homogeneous fields with tiling constraints, extending finite-blocklength analysis to realistic high-dimensional, spatially correlated data.
Findings
Establishes non-asymptotic achievability and converse bounds for heterogeneous fields.
Derives a second-order expansion quantifying effects of heterogeneity and tiling.
Highlights the impact of spatial correlation and region geometry on compression rates.
Abstract
Since Shannon's foundational work, rate-distortion theory has defined the fundamental limits of lossy compression. Classical results, derived for memoryless and stationary ergodic sources in the asymptotic regime, have shaped both transform and predictive coding architectures, as well as practical standards such as JPEG. Finite-blocklength refinements, initiated by the non-asymptotic achievability and converse bounds of Kostina and Verdu, provide precise characterizations under excess-distortion probability constraints, but primarily for memoryless or statistically homogeneous models. In contrast, error-bounded practical lossy compressors for scientific computing, such as SZ, ZFP, MGARD, and SPERR, are designed for finite, high-dimensional, spatially correlated, and statistically heterogeneous random fields. These compressors partition data into fixed-size tiles that are processed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques · Advanced Data Storage Technologies · Algorithms and Data Compression
