Lossless Tensor Compression as Program Synthesis
Brevis turns a tensor into a small reversible program, then runs that program to recover the checkpoint byte for byte.
The paper frames lossless checkpoint compression as program synthesis, using a typed DSL for structures such as repeated regions and floating-point fields. A learned checkpoint-specific prior guides bounded A* search over candidate programs. Across 10 public checkpoints, Brevis reports shrinking 2.13 TB to 1.41 TB, a 33.93% reduction. The authors say it beats gzip, zstd, ZipNN, and DFloat11 on archive size while preserving every source byte. HF Daily Papers' note
The paper frames lossless checkpoint compression as program synthesis, using a typed DSL for structures such as repeated regions and floating-point fields. A learned checkpoint-specific prior guides bounded A* search over candidate programs. Across 10 public checkpoints, Brevis reports shrinking 2.13 TB to 1.41 TB, a 33.93% reduction. The authors say it beats gzip, zstd, ZipNN, and DFloat11 on archive size while preserving every source byte. HF Daily Papers' note
score 5