Pith. sign in

REVIEW 2 cited by

Floating-Point Data Transformation for Lossless Compression

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 2506.18062 v2 pith:DSVYB4ME submitted 2025-06-22 cs.DB cs.DC

classification cs.DBcs.DC
keywords compressiondatabytesfloating-pointlosslesstransformationacrossleverage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Floating-point data is widely used across various domains. Depending on the required precision, each floating-point value can occupy several bytes. Lossless storage of this information is crucial due to its critical accuracy, as seen in applications such as medical imaging and language model weights. In these cases, data size is often significant, making lossless compression essential. Previous approaches either treat this data as raw byte streams for compression or fail to leverage all patterns within the dataset. However, because multiple bytes represent a single value and due to inherent patterns in floating-point representations, some of these bytes are correlated. To leverage this property, we propose a novel data transformation method called Typed Data Transformation (TDT) that groups related bytes together to improve compression. We implemented and tested our approach on various datasets across both CPU and GPU. TDT achieves a geometric mean compression ratio improvement of 1.16$\times$ over state-of-the-art compression tools such as zstd, while also improving both compression and decompression throughput by 1.18--3.79$\times$.

Discussion (0). Continue with ORCID 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. Lossless Tensor Compression as Program Synthesis

    cs.SE 2026-08 conditional novelty 7.0 of 10

    By expressing each tensor as a synthesized reversible program and storing the shortest one, Brevis losslessly compresses 2.13 TB of model checkpoints to 1.41 TB, beating ZipNN, zstd, gzip, LZ4, and Snappy.

  2. VIREL: Route-Local Lattice Residual Compression for Exact and Error-Bounded Floating-Point Time Series

    cs.DB 2026-07 conditional novelty 6.0 of 10

    VIREL compresses floating-point time series by predicting residuals in route-local integer/lattice coordinates, beating exact and error-bounded baselines on smooth streams.

Pith tools