Divide-and-Conquer Checkpointing for Arbitrary Programs with No User Annotation

B. Speelpenning, Compiling fast partial derivatives of functions given by algorithms , Ph.D. diss., Department of Computer Science, University of Illinois at Urbana-Champaign, 1980

1980

Earlier work this paper cites.

C.T. Haynes and D.P. Friedman, Engines build process abstractions , in Proceedings of the 1984 ACM Symposium on LISP and functional programming , ACM, 1984, pp. 18–24

1984

Earlier work this paper cites.

Y.M. Volin and G.M. Ostrovskii, Automatic computation of derivatives with the use of the multilevel differentiating technique — I: Algorithmic basis , Computers and Mathematics with Applications 11 (1985), pp. 1099–1114

1985

Earlier work this paper cites.

P.L. Wadler, Comprehending monads , in Proceedings of the 1990 ACM Conference on Lisp

1990

Earlier work this paper cites.

A. Griewank, Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation , Optimization Methods and Software 1 (1992), pp. 35–54

1992

Earlier work this paper cites.

P. Achten, J. Van Groningen, and R. Plasmeijer, High level specification of I/O in functional languages , in Functional Programming, Glasgow 1992 , Springer, 1993, pp. 1–17

1993

Earlier work this paper cites.

B. Christianson, Reverse accumulation of functions containing gradients , Tech. Rep. 278, University of Hertfordshire Numerical Optimisation Centre, 1993, Available at http://hdl.handle.net/2299/4337 , presented at the Theory Institute Argonne National Laboratory Illinois, Procs. of the Theory Institute on Combinatorial Challenges in Automatic Differentiation

1993

Earlier work this paper cites.

J.C. Reynolds, The discoveries of continuations , Lisp and Symbolic Computation 6 (1993), pp. 233–247

1993

Earlier work this paper cites.

R.A. Kelsey, A correspondence between continuation passing style and static single assignment form , ACM SIGPLAN Notices, Papers from the 1995 ACM SIGPLAN Workshop on Intermediate Representations 30 (1995), pp. 13–22

1995

Earlier work this paper cites.

C. Bendtsen and O. Stauning, FADBAD, a flexible C++ package for automatic differentiation , Technical Report IMM–REP–1996–17, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, 1996

1996

Cited alongside, same era.

A. Griewank, D. Juedes, and J. Utke, A package for the automatic differentiation of algorithms written in C/C++. User manual , Tech. Rep., Institute of Scientific Computing, Technical University of Dresden, Dresden, Germany, 1996, this version of the manual is superceded by http://www.math.tu-dresden.de/~adol-c/adolc110.ps

1996

Cited alongside, same era.

R. Heller, Checkpointing without operating system intervention: Implementing griewank’s algorithm , Master’s thesis, Ohio University, 1998

1998

Cited alongside, same era.

A. Stovboun, A tool for creating high-speed, memory efficient derivative codes for large scale applications , Master’s thesis, Ohio University, 2000

2000

Cited alongside, same era.

A. Kowarz and A. Walther, Optimal Checkpointing for Time-Stepping Procedures in ADOL-C , in Computational Science – ICCS 2006 , Lecture Notes in Computer Science, Vol. 3994, Springer, Heidelberg, 2006, pp. 566–573

2006

Later among the works it cites.

S. Weeks, Whole-program compilation in MLton (2006), Available at http://www.mlton.org/References.attachments/060916-mlton.pdf , workshop on ML

2006

Later among the works it cites.

J.M. Siskind and B.A. Pearlmutter, Nesting forward-mode AD in a functional framework , Higher-Order and Symbolic Computation 21 (2008), pp. 361–376

2008

Later among the works it cites.

N. Agarwal, B. Bullins, and E. Hazan, Second order stochastic optimization in linear time (2016), Available at https://arxiv.org/abs/1602.03943

Original

2016

Later among the works it cites.

M. Andrychowicz, M. Denil, S.G. Colmenarejo, M.W. Hoffman, D. Pfau, T. Schaul, and N. de Freitas, Learning to learn by gradient descent by gradient descent , in Neural Information Processing Systems , Available at https://arxiv.org/abs/1606.04474 , NIPS, 2016