I don’t want to inspect the backward graph, I want to inspect the graph backwards, i.e. starting from the final value (which is NaN) and traversing until I find the first non-NaN value, in order to identify the operation that introduced the NaN value. I thought the backward nodes need access to the values of the forward pass in order to compute the local gradient so I though there could be a possibility to access the forward buffers from backward nodes.
I’m not sure I understand what you mean by doing binary search on the code. Could you clarify this point? Thanks.