Skip to content

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

· 0 citations · 32 references

TL;DR

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.

View source

Similar papers

Structural-Similarity-Preserving Lossy Data Compression for CPUs and GPUs

The minSSIM metric and SBLC, the first SSIM-bounded compressor, are introduced, which is fully CPU-GPU compatible and guarantees the user-provided minSSIM bound, which it enforces by strategically tightening the error bound on specific values in the data.

Alex Fallin, M. Burtscher · 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
Preprint Sep 2026

Improving Progressive Compression with Adaptive Interpolation and Coefficient Decomposition

This work presents an adaptive progressive compression framework that improves retrieval efficiency for two common targets, namely error-bound and peak Signal-to-Noise ratios and proposes coefficient decomposition, a novel method that exploits the commonly overlooked spatial correlations among decorrelated data.

Wenbo Li, Xuan Wu, Qian Gong et al. · 0 citations
Preprint Aug 2026

Beyond Sparse Weights: When Is Attention Compressible?

Results motivate CertKV, a training-free compressor that reserves one tail-summary slot per head and allocates the rest by value dispersion, which is top-two in seven of nine LongBench-v2 settings, remains in the leading compressed tier on 128K RULER, and realizes a ten-fold cache budget in a packed Llama prototype.

Chi-Wun Yang, Xiaoyu Li · 0 citations

LLM-based Source Code Compression via Thresholded Symbol Ranking

This work introduces LLM-based compressors deploying two novel symbol-ranking variants that bound predictions to the top-$T$ ranks, and conducts the first large-scale evaluation of LLM-based source code compression across 30 LLMs, including general-domain, code-specialized, and quantized models.

Angelo Nardone, P. Ferragina · 0 citations
Jul 2026

EVOLVE: Efficient Learned Volume Compression with Variable-Rate Encoding on a Cross-Domain Database

Experiments on multiple unseen scientific simulation datasets demonstrate that EVOLVE achieves substantially higher CRs than conventional compressors at comparable reconstruction quality, while delivering compression speeds that are orders of magnitude faster than INR-based methods, highlighting its promise as a strong...

Kai-Yuan Tang, Maizhe Yang, Chaoli Wang · 1 citation

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