示例:
输入:A modern neural network admitting gauge symmetry
补全:In an earlier article by myself we discussed the fact that a neural network model that has a function that satisfies two conditions for it to operate is also a neural network model that has gauge symmetry.
In other words, a featureful structure that is always a symmetric network but never has any gauge symmetry (with some exceptions), is a neural network model with a gauge symmetry.
I was initially interested in how closely gauge symmetry can be maintained in this case. I decided to take a closer look at the case that there is a binary tree with only a couple of leaves and an element with two properties. By looking at other features such as the number of non-zero elements and some properties of the tree, I can decide that a neural network model with gauge symmetry in this case can be considered stable.
In addition there are some other features which we can make use of as well. If my graph is given a set of nodes, I can be confident that the set of leaves is always equal to the set. This can be very useful, if it is assumed that my feature list is only used in combination with the trees in place of graph nodes.
输入:A modern neural network admitting gauge symmetry
补全:In an earlier article by myself we discussed the fact that a neural network model that has a function that satisfies two conditions for it to operate is also a neural network model that has gauge symmetry.
In other words, a featureful structure that is always a symmetric network but never has any gauge symmetry (with some exceptions), is a neural network model with a gauge symmetry.
I was initially interested in how closely gauge symmetry can be maintained in this case. I decided to take a closer look at the case that there is a binary tree with only a couple of leaves and an element with two properties. By looking at other features such as the number of non-zero elements and some properties of the tree, I can decide that a neural network model with gauge symmetry in this case can be considered stable.
In addition there are some other features which we can make use of as well. If my graph is given a set of nodes, I can be confident that the set of leaves is always equal to the set. This can be very useful, if it is assumed that my feature list is only used in combination with the trees in place of graph nodes.