single mention · optimization
Minimal recomputation-graph extraction by backward graph traversal
Finds the minimal subgraph needed to recompute an annotated tensor by traversing the graph backward.
The sources on this page only mention it in passing. The line above is the extraction's one-line gloss. See training runtime for the methods filed beside it.
Filed under optimization › training runtime