Chapter 2: Backward - Automatic Gradient Computation
📰 Dev.to · Gary Jackson
Implement Backward() on Value: topologically sort the graph, then walk it in reverse using the chain rule to fill every .Grad.
Implement Backward() on Value: topologically sort the graph, then walk it in reverse using the chain rule to fill every .Grad.