Unsuccessfully, I tried to find out the "depth" (definition below) in large neural networks such as GPT-3, AlphaFold 2, and DALL-E 2.
Formally, my question is about their computational graph: consider a path from some node (a.k.a. neuron) to another. The length of a path is the number of its edges.
What is the longest path from an input node to an output node that visits unique nodes at most once?
I would appreciate any answer/reference regarding large networks like those mentioned above.
