Patent ID: 11868771
Assignee: PURDUE RESEARCH FOUNDATION
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 8:
9. A method for applying an arbitrary adjoint computation to the reversal of the computation graph of an arbitrary computer program using a processor and a memory, comprising:
a. representing the computation as a sequence of steps involving primitive corn putations;
b. splitting the sequence in (a) at its midpoint, or at a point selected to optimize the trade off between computation and storage;
c. computing the intermediate state of the computation at the point selected in (b), applying the portion of the computation prior to the point selected in (b);
d. recursively applying the method to the second portion of the computation beginning at the point selected in (b) to compute both the value of the entire computation and the value of the adjoint computation at the point selected in (b);
e. recursively applying the method to the first portion of the computation up to the point selected in (b) to compute the value of the adjoint computation at the input when the number of computational steps exceeds a minimum.