Pith. sign in

REVIEW 1 cited by

Memory Optimization for Deep Networks

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 2010.14501 v3 pith:G4AXPC6T submitted 2020-10-27 cs.LG cs.CV

classification cs.LGcs.CV
keywords memorymonetcheckpointingcomputationdeepnetworksautomatedavailable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning is slowly, but steadily, hitting a memory bottleneck. While the tensor computation in top-of-the-line GPUs increased by 32x over the last five years, the total available memory only grew by 2.5x. This prevents researchers from exploring larger architectures, as training large networks requires more memory for storing intermediate outputs. In this paper, we present MONeT, an automatic framework that minimizes both the memory footprint and computational overhead of deep networks. MONeT jointly optimizes the checkpointing schedule and the implementation of various operators. MONeT is able to outperform all prior hand-tuned operations as well as automated checkpointing. MONeT reduces the overall memory requirement by 3x for various PyTorch models, with a 9-16% overhead in computation. For the same computation cost, MONeT requires 1.2-1.8x less memory than current state-of-the-art automated checkpointing frameworks. Our code is available at https://github.com/utsaslab/MONeT.

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. DaCe AD: Unifying High-Performance Automatic Differentiation for Machine Learning and Scientific Computing

    cs.LG 2025-09 conditional novelty 6.0 of 10

    DaCe AD automatically differentiates scientific Python and Fortran code through an SDFG intermediate representation, beating JAX JIT across NPBench with a 4.1x geometric mean speedup.

Pith tools