Pith. sign in

REVIEW 1 cited by

On Efficient Constructions of Checkpoints

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 2009.13003 v1 pith:7Q6VEUD3 submitted 2020-09-28 cs.LG stat.ML

classification cs.LGstat.ML
keywords compressionlc-checkpointcheckpointsconstructionsefficientraterecoverytimes
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Efficient construction of checkpoints/snapshots is a critical tool for training and diagnosing deep learning models. In this paper, we propose a lossy compression scheme for checkpoint constructions (called LC-Checkpoint). LC-Checkpoint simultaneously maximizes the compression rate and optimizes the recovery speed, under the assumption that SGD is used to train the model. LC-Checkpointuses quantization and priority promotion to store the most crucial information for SGD to recover, and then uses a Huffman coding to leverage the non-uniform distribution of the gradient scales. Our extensive experiments show that LC-Checkpoint achieves a compression rate up to $28\times$ and recovery speedup up to $5.77\times$ over a state-of-the-art algorithm (SCAR).

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. An Efficient Compression of Deep Neural Network Checkpoints Based on Prediction and Context Modeling

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Using previous checkpoint values as LSTM context for arithmetic coding reduces compressed checkpoint size by 14% to 31% over ExCP on ViT-L32 and Pythia-410M, with the coding stage lossless.

Pith tools