Body: <p>Unsuccessfully, I tried to find out the &quot;depth&quot; (definition below) in large neural networks such as GPT-3, AlphaFold 2, and DALL-E 2.</p>
  <p>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.</p>
  <p>What is the longest path from an input node to an output node that visits unique nodes at most once?</p>
  <p>I would appreciate any answer/reference regarding large networks like those mentioned above.</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2022-04-08T16:55:07.837Z
Comments.Text: Please, **focus on 1 architecture per post.** So, edit your post to ask just about one architecture. If you have questions about other models, ask them in a separate post. If you're interested in a reference that summarises results about multiple models, then I would change the title not to be so specific and to actually emphasize that you're looking for some reference.
Comments.UserDisplayName: nbro
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2022-04-12T14:23:16.147Z
Comments.Text: Having said that, it seems that you're asking 2 distinct questions here: 1. "What is the longest path from an input node to an output node that visits unique nodes at most once?" and 2. "How many layers do GPT-3, AlphaFold 2, and DALL-E 2 have?". Please, **only 1 question per post.** If they are very related or the same question, explain why.
Comments.UserDisplayName: nbro
Tags: <neural-networks><deep-neural-networks><architecture><hidden-layers><alpha-fold>
Title: How many layers do GPT-3, AlphaFold 2, and DALL-E 2 have?
UserDisplayName: keyboardAnt
ThreadText: # How many layers do GPT-3, AlphaFold 2, and DALL-E 2 have?
  
  (Asked by: username_0 on 2022-04-08)
  
  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.
  
  **Tags:** neural-networks, deep-neural-networks, architecture, hidden-layers, alpha-fold
  
  > **Comments:**
  > **username_1**: Please, **focus on 1 architecture per post.** So, edit your post to ask just about one architecture. If you have questions about other models, ask them in a separate post. If you're interested in a reference that summarises results about multiple models, then I would change the title not to be so specific and to actually emphasize that you're looking for some reference.  
  > **username_1**: Having said that, it seems that you're asking 2 distinct questions here: 1. "What is the longest path from an input node to an output node that visits unique nodes at most once?" and 2. "How many layers do GPT-3, AlphaFold 2, and DALL-E 2 have?". Please, **only 1 question per post.** If they are very related or the same question, explain why.  
  
  ---
  
  ## 0 answers
  
  