The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
Abstract
In its basic form the reverse mode of automatic differentiation yields gradient vectors at a small multiple of the computational work needed to evaluate the underlying scalar function. The practical applicability of this temporal complexity result, due originally to Linnainmaa, seemed to be severely limited by the fact that the memory requirement of the basic implementation is proportional to the run timeT, of the original evaluation program. It is shown here that, by a recursive scheme related to the multilevel differentiation approach of Volin and Ostrovskii, the growth in both temporal and spatial complexity can be limited to a fixed multiple of log(T). Other compromises between the run time and memory requirement are possible, so that the reverse mode becomes applicable to computational problems of virtually any size.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Taylor expansion of the accumulated rounding error
Linnainmaa, S. (1976) · BIT · doi:10.1007/bf01931367 · Cited by 315
Compiling fast partial derivatives of functions given by algorithms
Speelpenning, B. (1980) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/5254402 · Cited by 153
Cited by
Machine learning–accelerated computational fluid dynamics
Kochkov, D., Smith, J. A., Alieva, A., Wang, Q., Brenner, M. P., & Hoyer, S. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2101784118 · Cited by 1,042
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
The Tapenade automatic differentiation tool: Principles, model, and specification
Hascoet, L., & Pascual, V. (2013) · ACM Transactions on Mathematical Software · doi:10.1145/2450153.2450158 · Cited by 498
Griewank, A., & Walther, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/347837.347846 · Cited by 480
Self-citationADIFOR–Generating Derivative Codes from Fortran Programs
Bischof, C., Carle, A., Corliss, G., Griewank, A., & Hovland, P. (1992) · Scientific Programming · doi:10.1155/1992/717832 · Cited by 436
Self-citation
Metadata
- Authors
- Griewank, A.
- Venue
- Optimization Methods and Software
- Publisher
- Informa UK Limited
- Published
- 1992-01
- Volume
- 1
- Issue
- 1
- Pages
- 35-54
- ISSN
- 1026-7670 (ISSN-L)
- 1055-6788
- 1029-4937
- OpenAlex
- W2020527870
- Cited by
- 360
- References
- 3
- FWCI
- 10.10
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. https://app.cochat.ai/papers/10.1080/10556789208805505
- The paper
- Griewank, A. (1992). Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optimization Methods and Software. https://doi.org/10.1080/10556789208805505
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.