Propose an optimization strategy for your computational graph implementation using the chain rule, considering both memory efficiency and computation speed.

Implement a sparse representation for intermediate results by only storing edges between nodes that are actually connected in the computation. This can significantly reduce memory usage while maintaining efficient computation of derivatives during back-propagation.