Pith. sign in

REVIEW 1 cited by

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding

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 2403.07320 v2 pith:DNPMXJWJ submitted 2024-03-12 cs.IT cs.LGeess.SPmath.IT

classification cs.ITcs.LGeess.SPmath.IT
keywords codingquantizationneuraloptimalcompressionlatticecomplexitylatent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural compression has brought tremendous progress in designing lossy compressors with good rate-distortion (RD) performance at low complexity. Thus far, neural compression design involves transforming the source to a latent vector, which is then rounded to integers and entropy coded. While this approach has been shown to be optimal on a few specific sources, we show that it can be highly sub-optimal on synthetic sources whose intrinsic dimensionality is greater than one. With integer rounding in the latent space, the quantization regions induced by neural transformations, remain square-like and fail to match those of optimal vector quantization. We demonstrate that this phenomenon is due to the choice of scalar quantization in the latent space, and not the transform design. By employing lattice quantization instead, we propose Lattice Transform Coding (LTC) and show that it approximately recovers optimal vector quantization at reasonable complexity. On real-world sources, LTC improves upon standard neural compressors. LTC also provides a framework that can integrate structurally (near) optimal information-theoretic designs into lossy compression; examples include block coding, which yields coding gain over optimal one-shot coding and approaches the asymptotically-achievable rate-distortion function, as well as nested lattice quantization for low complexity fixed-rate coding.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. HyperVQ: Enabling Hyperprior Entropy Modeling for VQ-Based Generative Image Compression

    cs.CV 2025-12 conditional novelty 6.0 of 10

    A hyperprior predicts a Gaussian in codebook space and converts it to index probabilities, enabling content-adaptive entropy coding for VQ image compression.

Pith tools