Any kind of network can be naturally represented by a Directed Acyclic Graph (DAG); additionally, activation functions can determine the reaction of each node of the network with respect to the signal(s) incoming. We study the characterization of the signal distribution in a network under the lens of tensor algebra. More specifically, we describe every activation function as tensor distributions with respect to the nodes, called . The distribution of the signal is encoded in the of the network. We formally prove that the total tensor can be obtained by computing the (BMP), an -ary operation for tensors of order , on the set of the activation tensors properly ordered and processed via two basic operations, that we call and . Our theoretical framework can be validated through the related code developed in Python.

生成讲解博客的中文版本

生成AI智能校验的中文版本