S PONTANEOUS S YMMETRY B REAKING IN D EEP N EURAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
We propose a framework to understand the unprecedented performance and robustness of deep neural networks using ﬁeld theory.
Correlations between the weights within the same layer can be described by symmetries in that layer, and networks generalize better if such symmetries are broken to reduce the redundancies of the weights.
Using a two parameter ﬁeld theory, we ﬁnd that the network can break such symmetries itself towards the end of training in a process commonly known in physics as spontaneous symmetry breaking.
This corresponds to a network generalizing itself without any user input layers to break the symmetry, but by communication with adjacent layers.
In the layer decoupling limit applicable to residual networks (He et al., 2015), we show that the remnant symmetries that survive the non-linear layers are spontaneously broken.
The Lagrangian for the non-linear and weight layers together has striking similarities with the one in quantum ﬁeld theory of a scalar.
Using results from quantum ﬁeld theory we show that our framework is able to explain many experimentally observed phenomena, such as training on random labels with zero error (Zhang et al., 2017), the information bottleneck, the phase transition out of it and gradient variance explosion (Shwartz-Ziv & Tishby, 2017), shattered gradients (Balduzzi et al., 2017), and many more.
I NTRODUCTION
Deep Neural Networks have been used in image recognition tasks with great success.
The ﬁrst of its kind, AlexNet (Krizhevsky et al., 2012), led to many other neural architectures have been proposed to achieve start-of-the-art results in image processing at the time.
Some of the notable architectures include, VGG (Simonyan & Zisserman, 2015), Inception (Szegedy et al., 2015) and
Residual networks (ResNet)(He et al., 2015).
Understanding the inner working of deep neural networks remains a difﬁcult task until now.
It has been discovered that the training progress ceases when it goes through an information bottleneck (Shwartz-Ziv & Tishby, 2017) until learning rate is decreased to a suitable amount then the network under goes a phase transition.
Deep networks appear to be able to regularize themselves and able to train on randomly labeled data Zhang et al.
(2017) with zero training error.
The gradients in deep neural networks behaves as white noise over the layers Balduzzi et al.
And many other unexplained phenomona.
We have found a framework that can explain all the aforementioned results, among many others.
A recent work (Anonymous, 2018) showed that the ensemble behavior and binomial path lengths (Veit et al., 2016) of ResNets can be explained by just a Taylor series expansion to ﬁrst order in the decoupling limit.
They found that the series approximation generates a symmetry breaking layer that reduces the redundancy of weights, leading to a better generalization.
Because the ResNet does not contain such symmetry breaking layers in the architecture.
They suggest that ResNets are able to break the symmetry by the communication between the layers.
Another recent work also employed the Taylor expansion to investigate ResNets (Jastrzebski et al., 2017).
We show that a remnant symmetry subgroup can survive a ReLU layer and the weights can be thought as scalar ﬁelds covariant to this remnant symmetry.
The emergence of a scalar ﬁeld is intriguing, perhaps troubling.
A scalar ﬁeld can admit negative Hessian eigenvalues at the loss minimum.
Historically, this paradox is solved by promoting a scalar ﬁeld theory to a quantum ﬁeld theory incorporating Einstein’s special relativity (Srednicki, 2007).
But how does this apply to neural networks?
We now illustrate that a residual network behaves just like a quantum ﬁeld theory.
In the layer decoupling limit, the norm of the change in feature map representation through each layer has an upper bound, by deﬁnition of the layer decoupling.
This is similar to relativity where the speed of any particle is bounded from above by the speed of light.
In Residual networks, it has been shown that the network can be decomposed into a sum of subnetworks consisting of all possible paths between two layers Veit et al.
In quantum mechanics, the propagation of particle between two points is the sum of all paths connecting those two points.
So a residual network can be described by a quantum ﬁeld theory and the use of a scalar ﬁeld is justiﬁed.
In fact, the presence of negative Hessian eigenvalues drives phase transitions in deep neural networks, and such eigenvalues also have been observed (Chaudhari et al., 2017).
The organization of this paper is as follows.
The background on deep neural networks and ﬁeld theory is given in Section 2.
Section 3 shows that remnant symmetries can exist in a neural network and that the weights can be approximated by a scalar ﬁeld.
Experimental results that conﬁrm our theory is given in Section 4.
A review of ﬁeld theory is given in Appendix A.
An explicit example of spontaneous symmetry breaking is shown in Appendix B.
B ACKGROUND AND F RAMEWORK
In this section we introduce our frame work using a ﬁeld theory based on Lagrangian mechanics.
2. D EEP N EURAL N ETWORKS
A deep neural network consists of layers of neurons.
Suppose that the ﬁrst layer of neurons with weight matrix W (cid:48) 1 and bias b 1 takes input x (cid:48) 1 and outputs y
[Equation]
where x = ( x (cid:48) , 1) and W 1 =
( W (cid:48) 1 , b 1 ) , where W 1 and b 1 are real valued.
Now suppose that
R 1 denotes a nonlinear operator corresponding to a sigmoid or ReLU layer located after the weight layer, so that
[Equation]
For a neural network with T repeating units, the output for layer t is
[Equation]
2. S YMMETRIES IN N EURAL N ETWORKS
We now show the necessary and sufﬁcient conditions of preserving symmetry.
We explicitly include symmetry transformations in Equation (1) and investigate the effects caused by a symmetry transformation of the input in subsequent layers.
Suppose Q t ∈ G is a transformation matrix in some
Lie group G for all t .
Note that the Q t are not parameters to be estimated.
We write y t =
y t ( Q t ) , where the dependence on Q t is obtained from a transformation on the input, x t ( Q t ) =
Q t x t , and the weights, W t ( Q t )
y t ( Q t ) =
R t W t ( Q t ) x t ( Q t ) .
If G is a symmetry group, then y t is covariant with x t , such that y t ( Q t ) =
Q t y t .
This requires two conditions to be satisﬁed.
First, W t ( Q t ) =
Q t W t Q − 1 t , where Q − 1 t Q t
= I and the existence of the inverse is trivial because G is a group and Q t ∈ G .
The second is the commutativity between R t and
Q t , such that R t Q t = Q t R t .
For example, if g t ∈ Aff( D ), the group of afﬁne transformations, R t may not commute with g t .
However, commutativity is satisﬁed when the transformation corresponds to the 2D rotation of feature maps.
Including transformation matrices, the output at layer t is
[Equation]
2. T HE L OSS F UNCTIONAL
Statistical learning requires the loss function to be minimized.
It can be written in the form of a mutual information, training error, or the Kullback-Leibler divergence.
In this section we approximate the loss function in the continuum limit of samples and layers.
Then we deﬁne the loss functional to transition into Lagrangian mechanics and ﬁeld theory.
Let z i =
( X i , Y i ) ∈
X be the i -th input sample in data set X , ( X i , Y i ) are the features and the desired outputs, respectively, and i ∈ { 1 , . . .
, N } .
The loss function is
[Equation]
where W =
( W 1 , . . .
, W T ) , and Q =
( Q 1 , . . .
, Q T ) , Q t ∈ G where G is a Lie group, and T is the depth of the network.
Taking the continuum limit,
[Equation]
where p ( X , Y ) is the joint distribution of X and Y .
Now we deﬁne the loss density L x ,t in the continuous layer limit such that
[Equation]
where L x ( t = 0) is the value of the loss before training.
We let L x ,t = dL x /dt be the loss rate per layer.
The loss rate L x ,t is bounded from below.
Therefore
[Equation]
Minimizing the loss rate guarantees the minimization of the total loss.
We require L x ,t to be invariant under symmetry transformations.
That is, if Q 1 ( t ) , Q 2 ( t ) ∈ G .
Then
[Equation]
However if Q 1 ( t ) and Q 2 ( t ) do not belong in the same symmetry group, the above equality does not necessarily hold.
Now we deﬁne the loss functional for a deep neural network
[Equation]
2. L AGRANGIAN MECHANICS AND F IELD THEORY
Having deﬁned the loss functional now, we can transition into Lagrangian dynamics to give a description of the feature map ﬂow at each layer.
Let the minimizer of the loss rate be
[Equation]
From now on, we combine z
=
( X , Y ) as Y only appears in W ∗ in this formalism, each Y determines a trajactory for the feature map representation ﬂow determined by Lagrangian mechanics.
Now we deﬁne, for each i -th element of W ( t ) ,
[Equation]
, and we set the weights with a non-linear operator R ( t ) together such that, w i ( z , Q ( t ) , t ) =
R ( t ) v i ( z , Q ( t ) , t ) .
We now deﬁne the Lagrangian density,
[Equation]
and L = T − V , where T is the kinetic energy and V is the potential energy.
We deﬁne the potential energy to be
[Equation]
z , W ( t ) , Q ( t )) ,
The probability density p ( z ) and the loss rate L x ,t are invariant under symmetry transformations.
Then V is an invariant as well.
Deﬁnition: Orthogonal Group
The orthogonal group O( D ) is the group of all D × D matrices such that O T
O = I .
We now set up the conditions to obtain a series expansion of V around the minimum w i ( Q t )
= 0 .
First, since V is an invariant.
Each term in the series expansion must be an invariant such that f ( w i ( Q t ) , w i ( Q t ))
=
f ( w i , w i ) for all Q t ∈ G .
Suppose G
= O ( D ) , the orthogonal group and that w T ( Q t ) =
w T Q T and w ( Q t ) =
Q t w .
So w i w i is an invariant.
Then f = w i w i is invariant for all Q t where the Einstein summation convention was used
[Equation]
Now we perform a Taylor series expansion about the minimum w i = 0 of the potential,
[Equation]
where H ij = ∂ w i ∂ w j V is the Hessian matrix, and similarly for Λ ijmn .
Because V is an even function in w i around the minimum, we must have
[Equation]
The O( D ) symmetry enforces that all weight Hessian eigenvalues to be H ii =
m 2 / 2 for some constant m 2 .
This can be seen in the O(2) case, with constants a, b , a (cid:54)
=
b , Q ∈ O(2) such that w 1 ( Q ) =
w 2 and w 2 ( Q ) =
w 1 ,
[Equation]
this does not equal aw 21 + bw 22 , so the O(2) symmetry implies a = b .
This can be generalized to the
O( D ) case.
For the quartic term, the requirement that V be even around the minimum gives
[Equation]
Similarly the O( D ) symmetry implies Λ iiii =
λ/ 4 for some constant λ and zero for any other elements, the potential is
[Equation]
where the numerical factors were added for convention.
The power series is a good approximation in the decoupling limit which may be applicable for Residual Networks.
For the kinetic term T , we expand in power series of the derivatives,
[Equation]
where the coefﬁcient for ( ∂ t w ) 2 is ﬁxed by the Hamiltonian kinetic energy 12 ( ∂ t w ) 2 .
Higher order terms in ( ∂ t w ) 2 are negligible in the decoupling limit.
If the model is robust, then higher order terms in ( ∂ z w ) 2 can be neglected as well.
The Lagrangian density is
[Equation]
where we have set w 2 = w i w i and absorbed c into x without loss of generality.
This is precisely the
Lagrangian for a scalar ﬁeld in ﬁeld theory.
Standard results for a scalar ﬁeld theory can be found in Appendix A.
To account for the effect of the learning rate, we employ the results from thermal ﬁeld theory (Kapusta & Gale, 2006) and we identify the temperature with the learning rate η .
So that now m 2 = − µ 2 + 14 λη 2 , with µ 2 > 0 .
t 1 x t .
This means the pair of weights in adjacent layers is small also.
The kinetic term T is not invariant under transformation Q ( t ) .
To obtain invariance ∂ t w i is to be replaced by the covariant derivative D t w i so that ( D t w i ) 2 is invariant under Q ( t ) , (Peskin & Schroeder, 1995).
[Equation]
, with
[Equation]
The new ﬁelds B introduced for invariance is not responsible for spontaneous symmetry breaking, the focus of this paper.
So we will not consider them further.
Formally, the ∂ z w term should be part of the potential V , as T contains only ∂ t w terms.
However we adhere to the ﬁeld theory literature and put the ∂ z w term in T with a minus sign, owning to L = T − V .
2. S PONTANEOUS S YMMETRY B REAKING
Consider the following scalar ﬁeld potential invariant under O( D (cid:48) ) transformations,
[Equation]
where m 2 ( η ) = − µ 2 + 14 λη 2 , µ 2 > 0 and learning rate η .
There exists a value of η = η c such that m 2 = 0 .
For η > η c , w ∗ i ( η > η c ) = 0 , where
[Equation]
=
[Equation]
The Hessian eigenvalue m 2 ( η ) < 0 when η < η c .
The minimum bifurcates at η = η c into
[Equation]
This phenomenon has a profound implication.
It is responsible for phase transition in neural networks and generates long range correlation between the input and output.
Details from ﬁeld theory can be found in Appendix B.
S YMMETRIES IN N EURAL N ETWORKS
In this section we show that spontaneous symmetry breaking occurs in neural networks.
First, we show that learning by deep neural networks can be considered solely as breaking the symmetries in the weights.
Then we show that some non-linear layers can preserve symmetries across the nonlinear layers.
Then we show that weight pairs in adjacent layers, but not within the same layer, is approximately an invariant under the remnant symmetry leftover by the non-linearities.
We assume that the weights are scalar ﬁelds invariant under the orthogonal O( D (cid:48) ) group for some D (cid:48) and ﬁnd that experimental results show that deep neural networks undergo spontaneous symmetry breaking.
Theorem: Deep feedforward networks learn by breaking symmetries Proof : Let A i be an operator representing any sequence of layers, and let a network formed by applying A i repeatedly such that x out =
( (cid:81) Mi
=1 A i ) x in .
Suppose
that A i ∈ Aff
( D ), the symmetry group of all afﬁne transformations.
We have L = (cid:81) Di =
A
i , where L ∈ Aff( D ).
Then x out = Lx in for some L ∈
Aff( D ) and x out can be computed by a single afﬁne transformation L .
When A i contains a nonlinearity for some i , this symmetry is explicitly broken by the nonlinearity and the layers learn a more generalized representation of the input.
(cid:3)
Now we show that ReLU preserves some continuous symmetries.
Theorem: ReLU reduces the symmetry of an Aff( D ) invariant to some subgroup
Aff ( D (cid:48) ) , where D (cid:48) < D .
Proof : Suppose R denotes the ReLU operator with output y t and Q t
∈ Aff( D ) acts on the input x t , where R ( x ) = max(0 , x ) .
Let x T x be an invariant under Q ∈
Aff( D ) and let x T = ( γ, ν ) , ν < 0 and γ > 0 .
Let a = R x = ( γ, 0) .
Then a T a = x T RR x = γ T γ .
Then a T a is an invariant under Aff( D (cid:48) ) where D (cid:48)
=
dim γ .
Note that γ i can be transformed into a negative value as it has passed the ReLU already.
(cid:3)
Corollary If there exist some Q ∈ G that commutes with a nonlinear operator R , such that QR =
RQ , then R preserves the symmetry G .
Deﬁnition: Remnant Symmetry If Q t ∈ G commutes with a non-linear operator R t for all Q t , then G is a remnant symmetry at layer t .
For the loss function L i ( X i , Y i , W , Q ) to be invariant, we need the predicted output y T to be covariant with x i .
Similarly for an invariant loss rate L x ,t we require y t to be covariant with x t .
The following theorem shows that a pair of weights in adjacent layers can be considered an invariant for power series expansion.
Theorem: Neural network weights in adjacent layers form an approximate invariant Suppose a neural network consists of afﬁne layers followed by a continuous non-linearity, R t , and that the weights at layer t , W t transform as Q t W t Q − 1 t , and that Q t ∈ H is a remnant symmetry such that Q t R t =
R t Q t .
Then W t W t − 1 can be considered as an invariant for the loss rate.
Proof: Consider x ( Q t ) =
Q t x t , then
[Equation]
where in the last line Q t R t = R t Q t was used, so y t ( Q t ) =
Q t y t is covariant with x t .
Now, x
[Equation]
t − 1 x t − 1 , so that
[Equation]
The pair ( R t W t )( R t − 1 W t − 1 ) can be considered an invariant under the ramnant symmetry at layer t .
Recall that w t =
R t ( W t − W ∗ t ) .
Therefore w t w t − 1 is an invariant.
(cid:3)
In the continuous layer limit, w t w t − 1 tends to w ( t ) T w ( t ) such that w ( t ) is the ﬁrst layer and w ( t ) T corresponds to the one after.
Therefore w ( t ) can be considered as a scalar ﬁeld under the remnant symmetry.
The remnant symmetry is not exact in general.
For sigmoid functions it is only an approximation.
The crucial feature for the remnant symmetry is that it is continuous so that strong correlation between inputs and outputs can be generated from spontaneous symmetry breaking.
We will state the Goldstone Theorem from ﬁeld theory without proof.
Theorem (Goldstone)
For every spontaneous broken continuous symmetry, there exist a weight π with zero eigenvalue in the Hessian m 2 π = 0 .
In any case, we will adhere to the case where the remnant symmetry is an othogonal group
O
( D (cid:48) ) .
Note that W is a D × D matrix and D (cid:48) <
D .
We choose a subset Γ ∈ R D (cid:48) of W such that Γ T Γ is invariant under O ( D (cid:48) ) .
Now that we have an invariant, we can write down the Lagrangian for a deep feedforward network for the weights responsible for spontaneous symmetry breaking.
The Lagrangian for deep feedforward networks in the decoupling limit Let γ i
= R (Γ i − Γ ∗ i ) , using Equation (2)
[Equation]
Now we can use standard ﬁeld theory results and apply it to deep neural networks.
A review for ﬁeld theory is given in Appendix A.
The formalism for spontaneous symmetry breaking is given in
Appendix B.
M AIN R ESULTS
Spontaneous symmetry breaking splits the set of weight deviations γ into two sets ( σ, π ) with different behaviors.
Weights π with zero eigenvalues and a spectrum dominated by small frequencies k in its correlation function.
The other weights σ , have Hessian eigenvalues µ 2 as the weights before the symmetry is broken.
In Appendix B, a standard calculation in ﬁeld theory shows that the correlation functions of the weights have the form
[Equation]
where ω 0 = (cid:113) | k | 2 + m 2 σ,π , m 2 σ = − µ 2 σ + 14 λη 2 and m 2 π = 14 λη 2 .
The correlation function of π approaches inﬁnity as k → 0 , as m 2 π → 0 .
This corresponds to large correlation over all sample space and layers t .
Gradient variance explosion We can now prove the results found by Shwartz-Ziv & Tishby (2017).
In their Figure 4, they showed that the variance in the weight gradients grow by orders of magnitude near the end of training.
We claim that this is due to long range correlations generated by spontaneous symmetry breaking.
Note that during training, the weights or deviation from the mean are given by stochastic gradient descent,
[Equation]
where L is the loss function.
Suppose that early in the training, spontaneous symmetry breaking has yet to take place.
The loss rate is from Equation (2)
[Equation]
The correlation function 4 for γ i is localized due to a large Hessian eigenvalue m 2 .
After spontaneous symmetry breaking, the π ﬁelds with large long range correlation are generated.
So at each layer t
[Equation]
This can be seen by ﬁxing t in Equation (3), so (cid:104) ππ (cid:105) =
[Equation]
and λ
[Equation]
η (cid:39) 0 .
This means that the gradient variance after spontaneous symmetry breaking blows up as observed by
Shwartz-Ziv & Tishby (2017).
Recall that the correlation function corresponds to the weight deviation from the mean across sample space z , z (cid:48)
∈ X and layers t, t (cid:48) .
A large correlation across sample space means that the feature map representations, which are a product of weights, are independent to the input.
Together with a large correlation across the layers, means that the feature maps are highly correlated on the output.
This is precisely the behaviors observed by Shwartz-Ziv & Tishby (2017).
Robustness of deep neural networks We ﬁnd that neural networks are resilient to overﬁtting.
Recall that the ﬂuctuation in the weights can arise from sampling noise.
Then ( ∂ z w i ) 2 can be a measure of model robustness.
A small value denotes the weights’ resistance to sampling noise.
If the network were to overﬁt, the weights would be very sensitive to sampling error.
After spontaneous symmetry breaking, weights with zero eigenvalues obey the Klein-Gordon equation with m 2 π = 0 ,
[Equation]
The singularity in the correlation function suggests | k | 2 (cid:39) 0 .
The zero eigenvalue weights provide robustness to the model.
Zhang et al.
(2017) referred to this phenomenon as implicit regularization.
This is independent of the data distribution.
Therefore the network can learn data with random labels, also observed by Zhang et al.
The same argument hold to explain a recent result that in the presence of class imbalance, oversampling in convolution neural networks do not necessarily lead to overﬁtting (Buda et al., 2017).
Weight freeze out Similarly, we predict that there should be a set of weights that do not change, or very slowly varying, over the layers.
This can be seen by | ∂ t π | 2 = ω 2 .
And ω = | k | .
One could use this to identity the weights with zero Hessian eigenvalues.
4. V ALIDATION OF P ROPOSED F RAMEWORK FOR N EURAL N ETWORKS IN THE L ITERATURE
In this section we summarize other experimental ﬁndings that can be explained by the proposed ﬁeld theory and the perspective of symmetry breaking.
Here Q ∈ G acts on the the input and hidden variables x , h , as Q x , Q h .
• The shape of the loss function after spontaneous symmetry breaking has the same shape observed by Goodfellow et al.
(2014) towards the end of training.
• Identity mapping outperforms other skip connections (He et al., 2016) is a result of the residual unit’s output being small.
Then the residual units can be decoupled leading to a small λ and so it is easier for spontaneous symmetry breaking to occur, from m 2 = − µ 2 + 14 λη 2 .
• Skip connection across residual units breaks additional symmetry.
Suppose now an identity skip connection connects x 1 and the output of F 2 .
Now perform a symmetry transformation on x 1 and x 2 , Q 1 and Q 2 ∈ G , respectively.
Then the output after two residual untis is Q x
=
Q 1 x 1 + Q 2 x 2 + Q 2 F 2 .
Neither Q = Q 1 nor Q = Q 2 can satisﬁes the covariance under G .
This is observed by Orhan & Pitkow (2017).
• The shattered gradient problem (Balduzzi et al., 2017).
It is observed that the gradient in deep (non-residual) networks is very close to white noise.
This is reﬂected in the exponential in Equation (6).
This effect on ResNet is reduced because of the decoupling limit λ → 0 .
This leads to the weight eigenvalues m 2 being larger in non-residual networks owing to m 2 = − µ 2 + 14 λη 2 .
And so a higher oscillation frequency in the correlation function.
• Spontaneous symmetry breaking generates long range correlations of the weights and feature map representations across all input samples and layers such that feature map representations are almost independent of the input, but highly correlated with the output.
This is the result shown in Figure 2 and 3 by Shwartz-Ziv & Tishby (2017).
Further, spontaneous symmetry breaking causes the ﬂuctuation in the weights to grow dramatically and that is reﬂected in the increase in variance of the gradients during training, shown in Figure 4 of Shwartz-Ziv & Tishby (2017).
• In recurrent neural networks, multiplicative gating (Yuhuai et al., 2016) combines the input x and the hidden state h by an element-wise product.
Their method outperforms the method with an addition x + h because the multiplication gating breaks the covariance of the output.
A transformation Q x ∗ Q h (cid:54) =
Q ( x ∗ h ) , whereas for addition the output remains covariant Q x + Q h
= Q ( x + h ) .
C ONCLUDING R EMARKS
In this work we solved one of the most puzzling mysteries of deep learning by showing that deep neural networks undergo spontaneous symmetry breaking.
This is a ﬁrst attempt to describe a neural network with a scalar quantum ﬁeld theory.
We have shed light on many unexplained phenomenon observed in experiments.
From the observation that deep networks can learn random training labels with no error (Zhang et al., 2017), well generalized models have many zero valued weights (Chaudhari et al., 2017), to the phenomenon that feature maps becomes highly correlated with the output in early layers (Shwartz-Ziv & Tishby, 2017).
These are all direct consequences of spontaneous symmetry breaking and their experimental results conﬁrm our theory.
There are also other experiments that validates our theory.
The observation that gradients are highly oscillatory across the layers in a network without skip connections (Balduzzi et al., 2017) and that the oscillation is reduced in
ResNets conﬁrm the form of the correlation function in Equation (3).
We believe that this work provides an understanding of deep neural network which will motivate further experimental and theoretical investigations.
We have shown that we can predict the performance of a deep network by considering the symmetry in the layers.
This gives practitioners a guide to design better performing architectures more efﬁciently.
We have also provided an alternate framework to information theory which can be experimentally tested against.
A R EVIEW OF F IELD T HEORY
In this section we state the relevant results in ﬁeld theory without proof.
We use Lagrangian mechanics for ﬁelds w ( x , t ) .
Equations of motion for ﬁelds are the solution to the Euler-Lagrange equation, which is a result from the principle of least action.
The action, S , is
[Equation]
where L is the Lagrangian.
Deﬁne the Lagrangian density
[Equation]
The action in term of the Lagrangian density is
[Equation]
The Lagrangian can be written as a kinetic term T , and a potential term V (loss function),
[Equation]
For a real scalar ﬁeld w ( x , t ) ,
[Equation]
where we have set the constant c 2 = 1 without loss of generality.
The potential for a scalar ﬁeld that allows spontaneous symmetry breaking has the form
[Equation]
In the decoupling limit, λ → 0 , the equation of motion for w is the Klein-Gordon Equation
[Equation]
In the limit of m 2 → 0 , the Klein-Gordon Equation reduces to the wave equation with solution
[Equation]
where i = √− 1 .
One can treat w as a random variable such that the probability distribution (a functional) of the scalar ﬁeld w ( z , t ) is p [ w ] = exp( − S [ w ]) /
Z , where Z is some normalizing factor.
The distribution peaks at the solution of the Klein-Gordon equation since it minimizes the action S .
Now we can deﬁne the correlation function between w ( z 1 , t 1 ) and w ( z 2 , t 2 ) ,
[Equation]
where (cid:82) D w denotes the integral over all paths from ( z 1 , t 1 ) to ( z 2 , t 2 ) .
In the decoupling limit λ → 0 , it can be shown that
[Equation]
where Stokes theorem was used and the term on the boundary of (sample) space is set to zero.
The above integral in the exponent is quadratic in w and the integral over D w can be done in a similar manner to Gaussian integrals.
The correlation function of the ﬁelds across two points in space and time is
[Equation]
where G ( z 1 , t 1 , z 2 , t 2 ) is the Green’s function to the Klein-Gordon equation, satisfying
[Equation]
The Fourier transformation of the correlation function is
[Equation]
An inverse transform over ω gives
[Equation]
with ω 2 0 =
| k | 2 + m 2 .
B S PONTANEOUS S YMMETRY B REAKING IN THE O RTHOGONAL G ROUP O( D (cid:48) )
In this section we show that weights π with small, near zero, eigenvalues m 2 π = 14 λη 2 are generated by spontaneous symmetry breaking.
Note that we can write the Lagrangian in Equation (2) as
L = T − V .
Consider weights γ that transforms under O ( D (cid:48) ) , from Equation (2)
[Equation]
When m 2 = − µ 2 + 14 λη 2 < 0 , it can be shown that in this case the loss minimum is no longer at γ i = 0 , but it has a degenerate minima on the surface such that (cid:80) i ( γ i ) 2 = v , where v = (cid:112) − m 2 /λ .
Now we pick a point on this loss minima and expand around it.
Write γ i =
( π k , v + σ ) , where k ∈ { 1 , . . .
, D (cid:48) − 1 } .
Intuitively, the π k ﬁelds are in the subspace of degenerate minima and σ is the ﬁeld orthogonal to π .
Then it can be shown that the Lagrangian can be written as
[Equation]
where, in the weak coupling limit λ → 0 ,
[Equation] [Equation]
the ﬁelds π and σ decouple from each other and can be treated separately.
The σ ﬁelds satisfy the Klein-Gordon Equation ( (cid:3) − m 2 ) σ = 0 , with (cid:3) =
∂ 2 t − ∂ 2 z .
The π ﬁelds satisfy the waveequation, (cid:3) π = 0 .
The correlation functions of the weights across sample space and layers, P σ = (cid:104) σ ( z (cid:48) , t (cid:48) )
σ ( z , t ) (cid:105) and P π = (cid:104) π
( z (cid:48) , t (cid:48) )
π ( z , t ) (cid:105) are the Green’s functions of the respective equations of motion.
Fourier transforming the correlation functions give
[Equation]
where ω 0 = (cid:113) | k | 2 + | m 2 σ,π | , and m 2 π = 14 λη 2 (cid:39) 0 .
The correlation function P π is dominated by values of | k | (cid:39) 0 .
Therefore (cid:104) ππ (cid:105) → ∞ as λη 2 → 0 .
On the other hand, it can be shown that (cid:104) σσ (cid:105) is damped by the weight eigenvalues | m 2 | .
The singularity in the correlation function means that the value of the weights at the start of the layer is highly correlated with the ones in later layers.
In the language of group theory.
The O( D ) symmetry is broken down to O
( D − 1) .
Elements of O( D ) are the D × D orthogonal matrices, which have D ( D − 1) /
2 independent continous symmetries (e.g. the Euler angles in D = 3 ).
The number of continuous broken from O( D ) to O
( D − 1 ) is D − 1 .
In the above example we showed that this corresponds to the D − 1 π k ﬁelds.
Each of which have inﬁnite correlation functions.
Even though we formulated our ﬁeld theory based on the decoupling limit of ResNets, the result of inﬁnite correlation is very general and can be applied even if the decoupling limit is not valid.
It is a direct result of spontaneous symmetry breaking.
We state the Goldstone Theorem without proof.
Theorem (Goldstone): For every continuous symmetry that is spontaneously broken, a weight π with corresponding eigenvalue m 2 π = 0 is generated at zero temperature (learning rate η ).
(cid:3)