pith. sign in

arxiv: 2010.14501 · v3 · pith:G4AXPC6Tnew · submitted 2020-10-27 · 💻 cs.LG · cs.CV

Memory Optimization for Deep Networks

classification 💻 cs.LG cs.CV
keywords memorymonetcheckpointingcomputationdeepnetworksautomatedavailable
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Techniques for Peak Memory Reduction for LoRA Fine-tuning of LLMs on Edge Devices

    cs.LG 2026-06 unverdicted novelty 4.0

    Presents quantization, checkpointing, softmax approximation, and logits masking to achieve substantial peak memory reductions in LoRA fine-tuning of 3B LLMs.