Methods › General › Stochastic Optimization › Gradient Checkpointing
Gradient Checkpointing
Introduced by Tianqi Chen et al. in Training Deep Nets with Sublinear Memory Cost
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Gradient Checkpointing is a method used for reducing the memory footprint when training deep neural networks, at the cost of having a small increase in computation time.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: gradient EM; Gradient Cuff; Gradient Mirage; pathway gradient; Gradient Sealing; Gradient Surgery; Gradient Surgery; phantom gradient.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 14 · with a code link: 8 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 14 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 14 of 14, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Optimal Gradient Checkpointing for Sparse and Recurrent Architectures using Off-Chip Memory 16 Dec 2024 · 0 repositories · arXiv:2412.11810
-
Look Every Frame All at Once: Video-Ma²mba for Efficient Long-form Video Understanding with Multi-Axis Gradient Checkpointing 29 Nov 2024 · 0 repositories · arXiv:2411.19460
-
Superior Scoring Rules for Probabilistic Evaluation of Single-Label Multi-Class Classification Tasks 25 Jul 2024 · 1 repository · arXiv:2407.17697
-
A Study of Optimizations for Fine-tuning Large Language Models 4 Jun 2024 · 0 repositories · arXiv:2406.02290
-
DITTO: Diffusion Inference-Time T-Optimization for Music Generation 22 Jan 2024 · 0 repositories · arXiv:2401.12179
-
CAPIVARA: Cost-Efficient Approach for Improving Multilingual CLIP Performance on Low-Resource Languages 20 Oct 2023 · 1 repository · arXiv:2310.13683
-
Unsupervised Discovery of Interpretable Directions in h-space of Pre-trained Diffusion Models 15 Oct 2023 · 0 repositories · arXiv:2310.09912
-
DISTFLASHATTN: Distributed Memory-efficient Attention for Long-context LLMs Training 5 Oct 2023 · 1 repository · arXiv:2310.03294
-
Colossal-Auto: Unified Automation of Parallelization and Activation Checkpoint for Large-scale Models 6 Feb 2023 · 1 repository · arXiv:2302.02599
-
GLEAM: Greedy Learning for Large-Scale Accelerated MRI Reconstruction 18 Jul 2022 · 1 repository · arXiv:2207.08393
-
Combined Scaling for Zero-shot Transfer Learning 19 Nov 2021 · 0 repositories · arXiv:2111.10050
-
Doc2Dict: Information Extraction as Text Generation 16 May 2021 · 1 repository · arXiv:2105.07510
-
Self-supervised Pretraining of Visual Features in the Wild 2 Mar 2021 · 1 repository · arXiv:2103.01988
-
Training Deep Nets with Sublinear Memory Cost 21 Apr 2016 · 6 repositories · arXiv:1604.06174Syntology 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
Tasks archive 2025-07-28
20 shown of 29 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections