The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation
Open accessAbstract
In its basic form, the reverse mode of computational differentiation yields the gradient of a scalar-valued function at a cost that is a small multiple of the computational work needed to evaluate the function itself. However, the corresponding memory requirement is proportional to the run-time of the evaluation program. Therefore, the practical applicability of the reverse mode in its original formulation is limited despite the availability of ever larger memory systems. This observation leads to the development of checkpointing schedules to reduce the storage requirements. This article presents the function revolve, which generates checkpointing schedules that are provably optimal with regard to a primary and a secondary criterion. This routine is intended to be used as an explicit “controller” for running a time-dependent applications program.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Numerical Methods for Conservation Laws
LeVeque, R. J. (1992) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8629-1 · Cited by 3,632
Optimal Control of Systems Governed by Partial Differential Equations.
Russell, D. L., Lions, J. L., & Mitter, S. K. (1972) · The American Mathematical Monthly · doi:10.2307/2318095 · Cited by 2,922
Optimal Control of Systems Governed by Partial Differential Equations
Lions, J. L. (1971) · Springer eBooks · doi:10.1007/978-3-642-65024-6 · Cited by 2,721
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,166
Self-citationAchieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
Griewank, A. (1992) · Optimization Methods and Software · doi:10.1080/10556789208805505 · Cited by 360
Self-citation
Cited by
Learning Transferable Visual Models From Natural Language Supervision
Radford, A., Kim, J. W., Hallacy, C., Ramesh, A., Goh, G., Agarwal, S., Sastry, G., Askell, A., Mishkin, P., Clark, J., et al. (2021) · arXiv · doi:10.48550/arxiv.2103.00020 · Cited by 15,293
GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism
Huang, Y., Cheng, Y., Bapna, A., Firat, O., Chen, M. X., Chen, D., Lee, H., Ngiam, J., Le, Q. V., Wu, Y., et al. (2018) · arXiv · doi:10.48550/arxiv.1811.06965 · Cited by 1,180
“One common method is to recompute the forward pass activations during backpropagation [21, 8], which significantly reduces memory required to cache activations.”
MethodEfficient large-scale language model training on GPU clusters using megatron-LM
Narayanan, D., Shoeybi, M., Casper, J., LeGresley, P., Patwary, M., Korthikanti, V., Vainbrand, D., Kashinkunti, P., Bernauer, J., Catanzaro, B., et al. (2021) · Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/3458817.3476209 · Cited by 639
“Activation recomputation [12, 18, 20, 21] is an optional technique that trades off an increase in the number of compute operations performed for additional memory footprint, by running the forward pass a second time just before the backward pass (and stashing only the input activations for a given pipeline stage, as o…”
BackgroundTraining Deep Nets with Sublinear Memory Cost
Chen, T., Xu, B., Zhang, C., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1604.06174 · Cited by 561
Development of the adjoint of GEOS-Chem
Henze, D. K., Hakami, A., & Seinfeld, J. H. (2007) · Atmospheric Chemistry and Physics · doi:10.5194/acp-7-2413-2007 · Cited by 447
Metadata
- Authors
- Griewank, A., & Walther, A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2000-03
- Volume
- 26
- Issue
- 1
- Pages
- 19-45
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1967134278
- Cited by
- 480
- References
- 5
- FWCI
- 3.24
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.