.png){kind=icon}
返回
OPTIMAL MULTISTAGE ALGORITHM FOR ADJOINT COMPUTATION
.png){kind=icon}
OA
AI
DOI：10.1137/15M1019222.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointing algorithm of Griewank and Walther. Stumm and Walther extended that binomial checkpointing algorithm to the case of two levels of checkpoints, but they did not provide any optimality results. We bridge the gap by designing the first optimal algorithm in this context. We experimentally compare our optimal algorithm with that of Stumm and Walther to assess the difference in performance.
Keyword:
optimal algorithms
checkpointing
adjoint computation
program reversal
automatic differentiation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Preliminary Safety, Pharmacokinetic, and Pharmacodynamic Results from a Phase 1b/2 Dose-Escalation and Cohort-Expansion Study of the Noncovalent, Reversible Bruton's Tyrosine Kinase Inhibitor (BTKi), Vecabrutinib, in B-Lymphoid Malignancies.png)
Blood
BloodIF0
PREAI
分享收藏