Year: 2019

Abstract:
Batch Normalization (BN) improves both convergence and generalization in training neural networks. This work understands these phenomena theoretically. We analyze BN by using a basic block of neural networks, consisting of a kernel layer, a BN layer, and a nonlinear activation function. This basic network helps us understand the impacts of BN in three aspects. First, by viewing BN as an implicit regularizer, BN can be decomposed into population normalization (PN) and gamma decay as an explicit regularization. Second, learning dynamics of BN and the regularization show that training converged with large maximum and effective learning rate. Third, generalization of BN is explored by using statistical mechanics. Experiments demonstrate that BN in convolutional neural networks share the same traits of regularization as the above analyses.

heading: 1 INTRODUCTION
text: Batch Normalization (BN) is an indispensable component in many deep neural networks (He et al., 2016; Huang et al., 2017). BN has been widely used in various areas such as machine vision, speech and natural language processing. Experimental studies (Ioffe & Szegedy, 2015) suggested that BN improves convergence and generalization by enabling large learning rate and preventing overfitting when training deep networks. Understanding BN theoretically is a key question.
This work investigates regularization of BN as well as its optimization and generalization in a singlelayer perceptron, which is a building block of deep models, consisting of a kernel layer, a BN layer, and a nonlinear activation function such as ReLU. The computation of BN is written by
y = g(ĥ), ĥ = γ h− µB σB + β and h = wTx. (1)
This work denotes a scalar and a vector by using lowercase letter (e.g. x) and bold lowercase letter (e.g. x) respectively. In Eqn.(1), y is the output of a neuron, g(·) denotes an activation function, h and ĥ are hidden values before and after batch normalization, w and x are kernel weight vector and network input respectively. In BN, µB and σB represent the mean and standard deviation of h. They are estimated within a batch of samples for each neuron independently. γ is a scale parameter and β is a shift parameter. In what follows, Sec.1.1 overviews assumptions and main results, and Sec.1.2 presents relationships with previous work.

heading: 1.1 OVERVIEW OF RESULTS
text: We overview results in three aspects.
• First, Sec.2 decomposes BN into population normalization (PN) and gamma decay. To better understand BN, we treat a single-layer perceptron with ReLU activation function as an illustrative case. Despite the simplicity of this case, it is a building block of deep networks and has been widely adopted in theoretical analyses such as proper initialization (Krogh & Hertz, 1992; Advani & Saxe, 2017), dropout (Wager et al., 2013), weight decay and data augmentation (Bös, 1998). The results in Sec.2 can be extended to deep neural networks as presented in Appendix C.4.
Our analyses assume that neurons at the BN layer are independent similar to (Salimans & Kingma, 2016; van Laarhoven, 2017; Teye et al., 2018), as the mean and the variance of BN are estimated individually for each neuron of each layer. The form of regularization in this study does not rely on ∗The first three authors contribute equally. Corresponding to pluo.lhi@gmail.com, {wangxinjiang, pengzhanglin}@sensetime.com, weqish@link.cuhk.edu.hk.
Gaussian assumption on the network input and the weight vector, meaning our assumption is milder than those in (Yoshida et al., 2017; Ba et al., 2016; Salimans & Kingma, 2016).
Sec.2 tells us that BN has an explicit regularization form, gamma decay, where µB and σB have different impacts: (1) µB discourages reliance on a single neuron and encourages different neurons to have equal magnitude, in the sense that corrupting individual neuron does not harm generalization. This phenomenon was also found empirically in a recent work (Morcos et al., 2018), but has not been established analytically. (2) σB reduces kurtosis of the input distribution as well as correlations between neurons. (3) The regularization strengths of these statistics are inversely proportional to the batch size M , indicating that BN with large batch would decrease generalization. (4) Removing either one of µB and σB could imped convergence and generalization.
• Second, by using ordinary differential equations (ODEs), Sec.3 shows that gamma decay enables the network trained with BN to converge with large maximum learning rate and effective learning rate, compared to the network trained without BN or trained with weight normalization (WN) (Salimans & Kingma, 2016) that is a counterpart of BN. The maximum learning rate (LR) represents the largest LR value that allows training to converge to a fixed point without diverging, while effective LR represents the actual LR in training. Larger maximum and effective LRs imply faster convergence rate.
• Third, Sec.4 compares generalization errors of BN, WN, and vanilla SGD by using statistical mechanics. The “large-scale” regime is of interest, where number of samples P and number of neurons N are both large but their ratio P/N is finite. In this regime, the generalization errors are quantified both analytically and empirically.
Numerical results in Sec.5 show that BN in CNNs has the same traits of regularization as disclosed above.

heading: 1.2 RELATED WORK
text: Neural Network Analysis. Many studies conducted theoretical analyses of neural networks (Opper et al., 1990; Saad & Solla, 1996; Bs & Opper, 1998; Pennington & Bahri, 2017; Zhang et al., 2017b; Brutzkus & Globerson, 2017; Raghu et al., 2017; Mei et al., 2016; Tian, 2017). For example, for a multilayer network with linear activation function, Glorot & Bengio (2010) explored its SGD dynamics and Kawaguchi (2016) showed that every local minimum is global. Tian (2017) studied the critical points and convergence behaviors of a 2-layered network with ReLU units. Zhang et al. (2017b) investigated a teacher-student model when the activation function is harmonic. In (Saad & Solla, 1996), the learning dynamics of a committee machine were discussed when the activation function is error function erf(x). Unlike previous work, this work analyzes regularization emerged in BN and its impact to both learning and generalization, which are still unseen in the literature.
Normalization. Many normalization methods have been proposed recently. For example, BN (Ioffe & Szegedy, 2015) was introduced to stabilize the distribution of input data of each hidden layer. Weight normalization (WN) (Salimans & Kingma, 2016) decouples the lengths of the network parameter vectors from their directions, by normalizing the parameter vectors to unit length. The dynamic of WN was studied by using a single-layer network (Yoshida et al., 2017). Li et al. (2018) diagnosed the compatibility of BN and dropout (Srivastava et al., 2014) by reducing the variance shift produced by them.
Moreover, van Laarhoven (2017) showed that weight decay has no regularization effect when using together with BN or WN. Ba et al. (2016) demonstrated when BN or WN is employed, backpropagating gradients through a hidden layer is scale-invariant with respect to the network parameters. Santurkar et al. (2018) gave another perspective of the role of BN during training instead of reducing the covariant shift. They argued that BN results in a smoother optimization landscape and the Lipschitzness is strengthened in networks trained with BN. However, both analytical and empirical results of regularization in BN are still desirable. Our study explores regularization, optimization, and generalization of BN in the scenario of online learning.
Regularization. Ioffe & Szegedy (2015) conjectured that BN implicitly regularizes training to prevent overfitting. Zhang et al. (2017a) categorized BN as an implicit regularizer from experimental results. Szegedy et al. (2015) also conjectured that in the Inception network, BN behaves similar to dropout to improve the generalization ability. Gitman & Ginsburg (2017) experimentally compared
BN and WN, and also confirmed the better generalization of BN. In the literature there are also implicit regularization schemes other than BN. For instance, random noise in the input layer for data augmentation has long been discovered equivalent to a weight decay method, in the sense that the inverse of the signal-to-noise ratio acts as the decay factor (Krogh & Hertz, 1992; Rifai et al., 2011). Dropout (Srivastava et al., 2014) was also proved able to regularize training by using the generalized linear model (Wager et al., 2013).

heading: 2 A PROBABILISTIC INTERPRETATION OF BN
text: The notations in this work are summarized in Appendix Table 2 for reference.
Training the above single-layer perceptron with BN in Eqn.(1) typically involves minimizing a negative log likelihood function with respect to a set of network parameters θ = {w, γ, β}. Then the loss function is defined by
1
P P∑ j=1 `(ĥj) = − 1 P P∑ j=1 log p(yj |ĥj ; θ) + ζ‖θ‖22, (2)
where p(yj |ĥj ; θ) represents the likelihood function of the network and P is number of training samples. As Gaussian distribution is often employed as prior distribution for the network parameters, we have a regularization term ζ‖θ‖22 known as weight decay (Krizhevsky et al., 2012) that is a popular technique in deep learning, where ζ is a coefficient.
To derive regularization of BN, we treat µB and σB as random variables. Since one sample x is seen many times in the entire training course, and at each time x is presented with the other samples in a batch that is drawn randomly, µB and σB can be treated as injected random noise for x.
Prior of µB,σB. By following (Teye et al., 2018), we find that BN also induces Gaussian priors for µB and σB. We have µB ∼ N (µP , σ 2 P M ) and σB ∼ N (σP , ρ+2 4M ), where M is batch size, µP and σP are population mean and standard deviation respectively, and ρ is kurtosis that measures the peakedness of the distribution of h. These priors tell us that µB and σB would produce Gaussian noise in training. There is a tradeoff regarding this noise. For example, when M is small, training could diverge because the noise is large. This is supported by experiment of BN (Wu & He, 2018) where training diverges when M = 2 in ImageNet (Russakovsky et al., 2015). When M is large, the noise is small because µB and σB get close to µP and σP . It is known that M > 30 would provide a moderate noise, as the sample statistics converges in probability to the population statistics by the weak Law of Large Numbers. This is also supported by experiment (Ioffe & Szegedy, 2015) where BN with M = 32 already works well in ImageNet.

heading: 2.1 A REGULARIZATION FORM
text: The loss function in Eqn.(2) can be written as an expected loss by integrating over the priors of µB and σB, that is, 1P ∑P j=1 EµB,σB [`(ĥj)] where E[·] denotes expectation. We show that µB and σB impose regularization on the scale parameter γ by decomposing BN into population normalization (PN) and gamma decay. To see this, we employ a single-layer perceptron and ReLU activation function as an illustrative example. A more rigorous description is provided in Appendix C.1.
Regularization of µB,σB. Let `(ĥ) be the loss function defined in Eqn.(2) and ReLU be the activation function. We have
1
P P∑ j=1 EµB,σB`(ĥ j) ' 1 P P∑ j=1
`(h̄j)︸ ︷︷ ︸ PN + ζ(h)γ2︸ ︷︷ ︸ gamma decay , and ζ(h) = ρ+ 2 8M I(γ)︸ ︷︷ ︸ from σB + 1 2M 1 P
P∑ j=1
σ(h̄j)︸ ︷︷ ︸ from µB , (3)
where h̄j = γ h j−µP σP + β and hj = wTxj represent the computations of PN. ζ(h)γ2 represents gamma decay, where ζ(h) is an adaptive decay factor depended on the hidden value h. Moreover, ρ is the kurtosis of distribution of h, I(γ) represents an estimation of the Fisher information of γ and I(γ) = 1P ∑P j=1( ∂`(ĥj) ∂γ ) 2, and σ(·) is a sigmoid function.
From Eqn.(3), we have several observations that have both theoretical and practical values.
• First, PN replaces the batch statistics µB, σB in BN by the population statistics µP , σP . In gamma decay, computation of ζ(h) is data-dependent, making it differed from weight decay where the
coefficient is determined manually. In fact, Eqn.(3) recasts the randomness of BN in a deterministic manner, not only enabling us to apply methodologies such as ODEs and statistical mechanics to analyze BN, but also inspiring us to imitate BN’s performance by WN without computing batch statistics in empirical study.
• Second, PN is closely connected to WN, which is independent from sample mean and variance. WN (Salimans & Kingma, 2016) is defined by υ w
Tx ||w||2 that normalizes the weight vector w to have
unit variance, where υ is a learnable parameter. Let each diagonal element of the covariance matrix of x be a and all the off-diagonal elements be zeros. h̄j in Eqn.(3) can be rewritten as
h̄j = γ wTxj − µP
σP + β = υ
wTxj ||w||2 + b, (4)
where υ = γa and b = − γµP a||w||2 + β. Eqn.(4) removes the estimations of statistics and eases our analyses of regularization for BN.
• Third, µB and σB produce different strengths in ζ(h). As shown in Eqn.(3), the strength from µB depends on the expectation of σ(h̄j) ∈ [0, 1], which represents excitation or inhibition of a neuron, meaning that a neuron with larger output may exposure to larger regularization, encouraging different neurons to have equal magnitude. This is consistent with empirical result (Morcos et al., 2018) which prevented reliance on single neuron to improve generalization. The strength from σB works as a complement for µB. For a single neuron, I(γ) represents the norm of gradient, implying that BN punishes large gradient norm. For multiple neurons, I(γ) is the Fisher information matrix of γ, meaning that BN would penalize correlations among neurons. Both σB and µB are important, removing either one of them would imped performance.
Extensions to Deep Networks. The above results can be extended to deep networks as shown in Appendix C.4 by decomposing the expected loss at a certain hidden layer. We also demonstrate the results empirically in Sec.5, where we observe that CNNs trained with BN share similar traits of regularization as discussed above.

heading: 3 OPTIMIZATION WITH REGULARIZATION
text: Now we show that BN converges with large maximum and effective learning rate (LR), where the former one is the largest LR when training converged, while the latter one is the actual LR during training. With BN, we find that both LRs would be larger than a network trained without BN. Our result explains why BN enables large learning rates used in practice (Ioffe & Szegedy, 2015).
Our analyses are conducted in three stages. First, we establish dynamical equations of a teacherstudent model in the thermodynamic limit and acquire the fixed point. Second, we investigate the eigenvalues of the corresponding Jacobian matrix at this fixed point. Finally, we calculate the maximum and the effective LR.
Teacher-Student Model. We first introduce useful techniques from statistical mechanics (SM). With SM, a student network is dedicated to learn relationship between a Gaussian input and an output by using a weight vector w as parameters. It is useful to characterize behavior of the student by using a teacher network with w∗ as a ground-truth parameter vector. We treat single-layer perceptron as a student, which is optimized by minimizing the euclidian distance between its output and the supervision provided by a teacher without BN. The student and the teacher have identical activation function.
Loss Function. We define a loss function of the above teacher-student model by 1P ∑P j=1 `(x
j) = 1 P ∑P j=1 [ g(w∗Txj) − g( √ Nγw Txj ‖w‖2 ) ]2 + ζγ2, where g(w∗Txj) represents supervision from the teacher, while g( √ Nγw Txj
‖w‖2 ) is the output of student trained to mimic the teacher. This student is
defined by following Eqn.(4) with ν = √ Nγ and the bias term is absorbed into w. The above loss function represents BN by using WN with gamma decay, and it is sufficient to study the learning rates of different approaches. Let θ = {w, γ} be a set of parameters updated by SGD, i.e. θj+1 = θj − η ∂`(x
j) ∂θj where η denotes learning rate. The update rules for w and γ are
wj+1 −wj = ηδj(γ j √ N
‖wj‖2 xj − w̃
jTxj
‖wj‖22 wj) and γj+1 − γj = η(δ
j √ NwjTxj
‖wj‖2 − ζγj), (5)
where w̃j denotes a normalized weight vector of the student, that is, w̃j = √ Nγj w j
‖wj‖2 , and δj = g′(w̃jTxj)[g(w∗Txj)− g(w̃jTxj)] represents the gradient1 for clarity of notations. Order Parameters. As we are interested in the “large-scale” regime where both N and P are large and their ratio P/N is finite, it is difficult to examine a student with parameters in high dimensions directly. Therefore, we transform the weight vectors to order parameters that fully characterize interactions between the student and the teacher network. In this case, the parameter vector can be reparameterized by using a vector of three elements including γ, R, and L. In particular, γ measures length of the normalized weight vector w̃, that is, w̃Tw̃ = Nγ2 w
Tw ‖w‖22 = Nγ2. The parameter R measures angle (overlapping ratio) between the weight vectors of student and teacher. We have R = w̃ Tw∗
‖w̃‖‖w∗‖ = 1 Nγ w̃ Tw∗, where the norm of the ground-truth vector is 1Nw ∗Tw∗ = 1. Moreover,
L represents length of the original weight vector w and L2 = 1Nw Tw.
Learning Dynamics. The update equations (5) can be transformed into a set of differential equations (ODEs) by using the above order parameters. This is achieved by treating the update step j as a continuous time variable t = jN . They can be turned into differential equations because the contiguous step ∆t = 1N approaches zero in the thermodynamic limit when N →∞. We obtain a dynamical system of three order parameters
dγ dt = η I1 γ − ηζγ, dR dt = η γ L2 I3 − η R L2 I1 − η2
γ2R 2L4 I2, and dL dt = η2 γ2 2L3 I2, (6)
where I1 = Ex[δw̃Tx], I2 = Ex[δ2xTx], and I3 = Ex[δw∗Tx] are defined to simplify notations. The derivations of Eqn.(6) can be found in Appendix C.5.

heading: 3.1 FIXED POINT OF THE DYNAMICAL SYSTEM
text: (γ0, R0, L0) ηmax (R) ηeff (R) BN (γ0, 1, L0) ( ∂(γ0I3−I1) γ0∂R −
ζγ0 ) / ∂I2 2∂R
ηγ0 L20
WN (1, 1, L0) ∂(I3−I1) ∂R / ∂I2 2∂R
η
L20
SGD (1, 1, 1) ∂(I3−I1)∂R / ∂I2 2∂R η
does not depend on the value of L0 because their weight vectors are normalized. In other words, WN and BN are easier to optimize than vanilla SGD, unlike SGD where both R0 and L0 have to be optimized to ‘1’. Furthermore, γ0 in BN depends on the activation function. For ReLU, we have γbn0 = 1 2ζ+1 (see Proposition 1 in Appendix C.5), meaning that norm of the normalized weight vector relies on the decay factor ζ. In WN, we have γwn0 = 1 as WN has no regularization on γ.

heading: 3.2 MAXIMUM AND EFFECTIVE LEARNING RATES
text: With the above fixed points, we derive the maximum and the effective LR. Specifically, we analyze eigenvalues and eigenvectors of the Jacobian matrix corresponding to Eqn.(6). We are interested in the LR to approachR0. We find that this optimum value only depends on its corresponding eigenvalue denoted as λR. We have λR = ∂I2∂R ηγ0 2L20
(ηmax − ηeff), where ηmax and ηeff represent the maximum and effective LR (proposition 2 in Appendix C.5), which are given in Table 1. We demonstrate that λR < 0 if and only if ηmax > ηeff , such that the fixed point R0 is stable for all approaches (proposition 3 in Appendix C.6). Moreover, it is also able to show that ηmax of BN (ηbnmax) is larger than WN and SGD, enabling R to converge with a larger learning rate. For ReLU as an example, we find that ηbnmax ≥ η {wn,sgd} max + 2ζ (proposition 4 in Appendix C.7). The larger maximum LRs enables the network to be trained more stably and has the potential to be combined with other stabilization techniques (Fagan & Iyengar, 2018) during optimization. The effective LRs shown in Table 1 are consistent with previous work (van Laarhoven, 2017).
1g′(x) denotes the first derivative of g(x).

heading: 4 GENERALIZATION ANALYSIS
text: Here we investigate generalization of BN by using a teacher-student model that minimizes a loss function 1P ∑P j=1((y
∗)j−yj)2, where y∗ represents the teacher’s output and y is the student’s output. We compare BN with WN+gamma decay and vanilla SGD. All of them share the same teacher network whose output is a noise-corrupted linear function y∗ = w∗Tx + s, where x is drawn from N (0, 1N ) and s is an unobserved Gaussian noise. We are interested to see how the above methods resist this noise by using student networks with both identity (linear) and ReLU activation functions.
For vanilla SGD, the student is computed by y = g(wTx) with g(·) being either identity or ReLU, and w being the weight vector to optimize, where w has the same dimension as w∗. The loss function of vanilla SGD is `sgd = 1P ∑P j=1 ( y∗ − g(wTxj) )2 . For BN, the student is defined as y = γw Tx−µB σB
+ β. As our main interest is the weight vector, we freeze the bias by setting β = 0. Therefore, the batch average term µB is also unnecessary to avoid additional parameters, and the loss function is written as `bn = 1P ∑P j=1 ( (y∗)j − γwTxj/σB )2 . For WN+gamma decay, the student is computed similar to Eqn.(4) by using y = √ Nγ w
Tx ‖w‖2 . Then the loss function is defined by `wn = 1P ∑P j=1 ( (y∗)j− √ Nγw Txj ‖w‖2 )2 +ζ‖γ‖22. With the above definitions, the three approaches are studied under the same teacher-student framework, where their generalization errors can be strictly compared with the other factors ruled out.
4.1 GENERALIZATION ERRORS
We provide closed-form solutions of the generalization errors (see Appendix D.1) for vanilla SGD with both linear and ReLU student networks. The theoretical solution of WN+gamma decay can also be solved for the linear student, but still remains difficult for ReLU student whose numerical verification is provided instead. Both vanilla SGD and WN+gamma decay are compared with numerical solutions of BN.
vanilla SGD. In an identity (linear) student, the solution of generalization error depends on the rank of correlation matrix Σ = xTx. Here we define an effective load α = P/N that is the ratio between number of samples P and number of input neurons N (number of learnable parameters).
The generalization error of the identity student is denoted as sgdid , which can be acquired by using the distribution of eigenvalues of Σ following (Advani & Saxe, 2017). If α < 1, sgdid = 1 − α + αS/(1− α). Otherwise, sgd id = S/(α− 1) where S is the variance of the injected noise to the teacher network. The values of sgdid with respect to α are plotted in blue curve of Fig.1(a). It first decreases but then increases as α increases from 0 to 1. sgdid diverges at α = 1. And it would decrease again when α > 1.
In a ReLU student, the nonlinear activation yields difficulty to derive the theoretical solution. Here we utilize the statistical mechanics and calculate that sgdrelu = 1 − α/4 + αS 2(2−α) and α < 2 (see AppendixD.2). When comparing to the lower bound (trained without noisy supervision) shown as the red curve in Fig.1(b), we see that sgdrelu (blue curve) diverges at α = 2. This is because the student overfits the noise in the teacher’s output. The curve of numerical solution is also plotted in dashed line in Fig.1(b) and it captures the diverging trend well. It should be noted that obtaining the theoretical curve empirically requires
an infinitely long time of training and an infinitely small learning rate. This unreachable limit explains the discrepancies between the theoretical and the numerical solution.
WN+gamma decay. In a linear student, the gamma decay term turns the correlation matrix to Σ = ( xTx + ζI ) , which is positive definite. Following statistical mechanics
(Krogh & Hertz, 1992), the generalization error is wnid = δ 2 ∂(ζG) ∂ζ − ζ 2 ∂G ∂ζ where G = 1− α− ζ + ( ζ + (1 + √ α)2 ) 1 2 ( ζ + (1− √ α)2 ) 1 2 /
2ζ. We see that wnid can be computed quantitatively given the values of ζ and α. Let the variance of noise injected to the teacher be 0.25. Fig.1(a) shows that no other curves could outperform the red curve when ζ = 0.25, a value equal to the noise magnitude. The ζ smaller than 0.25 (green curve ζ = 12M and M = 32) would exhibit overtraining around α = 1, but they still perform significantly better than vanilla SGD.
For the ReLU student in Fig,1(b), a direct solution of the generalization error wnrelu remains an open problem. Therefore, the numerical results of ‘WN+gamma decay’ (green curve) are run at each α value. It effectively reduces over-fitting compared to vanilla SGD.
Numerical Solutions of BN. In the linear student, we employ SGD with M = 32 to find solutions of w for BN. The number of input neurons is 4096 and the number of training samples can be varied to change α. The results are marked as black squares in Fig.1(a). After applying the analyses for linear student (Appendix C.3), BN is equivalent to ‘WN+gamma decay’ when ζ = 12M (green curve). It is seen that BN gets in line with the curve ‘ζ = 1/2M ’ (M = 32) and thus quantitatively validates our derivations.
In the ReLU student, the setting is mostly the same as the linear case, except that we employ a smaller batch size M = 16. The results are shown as black squares in Fig.1(b). For ReLU units, the equivalent ζ of gamma decay is ζ = 14M . If one compares the generalization error of BN with ‘WN+gamma decay’ (green curve), a clear correspondence is found, which also validates the derivations for the ReLU activation function.

heading: 5 EXPERIMENTS IN CNNS
text: This section shows that BN in CNNs follows similar traits of regularization as the above analyses.
To compare different methods, the CNN architectures are fixed while only the normalization layers are changed. We adopt CIFAR10 (Krizhevsky, 2009) that contains 60k images of 10 categories (50k images for training and 10k images for test). All models are trained by using SGD with momentum, while the initial learning rates are scaled proportionally (Goyal et al., 2017) when different batch sizes are presented. More empirical setting can be found in Appendix B.
Evaluation of PN+Gamma Decay. This work shows that BN can be decomposed into PN and gamma decay. We empirically compare ‘PN+gamma decay’ with BN by using ResNet18 (He et al., 2016). For ‘PN+gamma decay’, the population statistics of PN and the decay factor of gamma decay are estimated by using sufficient amount of training samples. For BN, BN trained with a normal batch size M = 128 is treated as baseline as shown in Fig.2(a&b). We see that when batch size increases, BN would imped both loss and accuracy. For example, when increasing M to 1024, performance decreases because the regularization from the batch statistics reduces in large batch, resulting in overtraining (see the gap between train and validation loss in (a) when M = 1024).
In comparison, we train PN by using 10k training samples to estimate the population statistics. Note that this further reduces regularization. We see that the release of regularization can be complemented by gamma decay, making PN outperformed BN. This empirical result verifies our derivation of regularization for BN. Similar trend can be observed by experiment in a down-sampled version of ImageNet (see Appendix B.1). We would like to point out that ‘PN+gamma decay’ is of interest in theoretical analyses, but it is computation-demanding when applied in practice because evaluating µP , σP and ζ(h) may require sufficiently large number of samples.
Comparisons of Regularization. We study the regulation strengths of vanilla SGD, BN, WN, WN+mean-only BN, and WN+variance-only BN. At first, the strength of regularization terms from both µB and σB are compared by using a simpler network with 4 convolutional and 2 fully connected layers as used in (Salimans & Kingma, 2016). Fig.2(c&d) compares their training and validation losses. We see that the generalization error of BN is much lower than WN and vanilla SGD. The reason has been disclosed in this work: stochastic behaviors of µB and σB in BN improves generalization.
To investigate µB and σB individually, we decompose their contributions by running a WN with mean-only BN as well as a WN with variance-only BN, to simulate their respective regularization.
As shown in Fig.2(c&d), improvements from the mean-only and the variance-only BN over WN verify our conclusion that noises from µB and σB have different regularization strengths. Both of them are essential to produce good result.
Regularization and parameter norm. We further demonstrate impact of BN to the norm of parameters. We compare BN with vanilla SGD. A network is first trained by BN in order to converge to a local minima where the parameters do not change much. At this local minima, the weight vector is frozen and denoted as wbn. Then this network is finetuned by using vanilla SGD with a small learning rate 10−3 and its kernel parameters are initialized by wsgd = γw bn
σ , where σ is the moving average of σB.
Fig.4 in Appendix B.2 visualizes the results. As µB and σB are removed in vanilla SGD, it is found that the training loss decreases while the validation loss increases, implying that reduction in regularization makes the network converged to a sharper local minimum that generalizes less well. The magnitudes of kernel parameters wsgd at different layers are also observed to increase after freezing BN, due to the release of regularization on these parameters.
Batch size. To study BN with different batch sizes, we train different networks but only add BN at one layer at a time. The regularization on the γ parameter is compared in Fig.2(e) when BN is located at different layers. The values of γ2 increase along with the batch size M due to the weaker regularization for the larger batches. The increase of γ2 also makes all validation losses increased as shown in Fig.2(f).
BN and WN trained with dropout. As PN and gamma decay requires estimating the population statistics that increases computations, we utilize dropout as an alternative to improve regularization of BN. We add a dropout after each BN layer. Fig.2(g&h) plot the classification results using ResNet18. The generalization of BN deteriorates significantly when M increases from 128 to 1024. This is observed by the much higher validation loss (Fig.2(g)) and lower validation accuracy (Fig.2(h)) when M = 1024. If a dropout layer with ratio 0.1 is added after each residual block layer for M = 1024 in ResNet18, the validation loss is suppressed and accuracy increased by a great margin. This superficially contradicts with the original claim that BN reduces the need for dropout (Ioffe & Szegedy, 2015). As discussed in Appendix B.3, we find that there are two differences between our study and previous work (Ioffe & Szegedy, 2015).
Fig.2(g&h) also show that WN can also be regularized by dropout. We apply dropout after each WN layer with ratio 0.2 and the dropout is applied at the same layers as that for BN. We found that the improvement on both validation accuracy and loss is surprising. The accuracy increases from 0.90 to 0.93, even close to the results of BN. Nevertheless, additional regularization on WN still cannot make WN on par with the performance BN. In deep neural networks the distribution after each layer would be far from a Gaussian distribution, in which case WN is not a good substitute for PN.

heading: 6 CONCLUSIONS
text: This work investigated an explicit regularization form of BN, which was decomposed into PN and gamma decay where the regularization strengths from µB and σB were explored. Moreover, optimization and generalization of BN with regularization were derived and compared with vanilla SGD, WN, and WN+gamma decay, showing that BN enables training to converge with large maximum and effective learning rate, as well as leads to better generalization. Our analytical results explain many existing empirical phenomena. Experiments in CNNs showed that BN in deep networks share the same traits of regularization. In future work, we are interested in analyzing optimization and generalization of BN in deep networks, which is still an open problem. Moreover, investigating the other normalizers such as instance normalization (IN) (Ulyanov et al., 2016) and layer normalization (LN) (Ba et al., 2016) is also important. Understanding the characteristics of these normalizers should be the first step to analyze some recent best practices such as whitening (Luo, 2017b;a), switchable normalization (Luo et al., 2019; 2018; Shao et al., 2019), and switchable whitening (Pan et al., 2019).

heading: APPENDICES

heading: A NOTATIONS

heading: B MORE EMPIRICAL SETTINGS AND RESULTS
text: All experiments in Sec.5 are conducted in CIFAR10 by using ResNet18 and a CNN architecture similar to (Salimans & Kingma, 2016) that is summarized as ‘conv(3,32)-conv(3,32)-conv(3,64)conv(3,64)-pool(2,2)-fc(512)-fc(10)’, where ‘conv(3,32)’ represents a convolution with kernel size 3 and 32 channels, ‘pool(2,2)’ is max-pooling with kernel size 2 and stride 2, and ‘fc’ indicates a full connection. We follow a configuration for training by using SGD with a momentum value of 0.9 and continuously decaying the learning rate by a factor of 10−4 each step. For different batch sizes, the initial learning rate is scaled proportionally with the batch size to maintain a similar learning dynamics (Goyal et al., 2017).

heading: B.1 RESULTS IN DOWNSAMPLED IMAGENET
text: Besides CIFAR10, we also evaluate ‘PN+gamma decay’ by employing a downsampled version of ImageNet (Loshchilov & Hutter, 2016), which contains identical 1.2 million data and 1k categories as the original ImageNet, but each image is scaled to 32×32. We train ResNet18 in downsampled ImageNet by following the training protocol used in (He et al., 2016). In particular, ResNet18 is trained by using SGD with momentum of 0.9 and the initial learning rate is 0.1, which is then decayed by a factor of 10 after 30, 60, and 90 training epochs.
In downsampled ImageNet, we observe similar trends as those presented in CIFAR10. For example, we see that BN would imped both loss and accuracy when batch size increases. When increasing M to 1024 as shown in Fig.3, both the loss and validation accuracy decrease because the regularization from the random batch statistics reduces in large batch size, resulting in overtraining. This can be seen by the gap between the training and the validation loss. Nevertheless, we see that the reduction of regularization can be complemented when PN is trained with adaptive gamma decay, which makes PN performed comparably to BN in downsampled ImageNet.
B.2 IMPACT OF BN TO THE NORM OF PARAMETERS
We demonstrate the impact of BN to the norm of parameters. We compare BN with vanilla SGD, where a network is first trained by BN in order to converge to a local minima when the parameters do not change much. At this local minima, the weight vector is frozen and denoted as wbn. Then this
network is finetuned by using vanilla SGD with a small learning rate 10−3 with the kernel parameters initialized by wsgd = γw bn
σ , where σ is the moving average of σB.
Fig.4 below visualizes the results. As µB and σB are removed in the vanilla SGD, it is found from the last two figures that the training loss decreases while the validation loss increases, meaning that the reduction in regularization makes the network converged to a sharper local minimum that generalizes less well. The magnitudes of kernel parameters wsgd at different layers are also displayed in the first four figures. All of them increase after freezing BN, due to the release of regularization on these parameters.

heading: B.3 BN AND WN WITH DROPOUT
text: BN+dropout. Despite the better generalization of BN with smaller batch sizes, large-batch training is more efficient in real cases. Therefore, improving generalization of BN with large batch is more desiring. However, gamma decay requires estimating the population statistics that
increases computations. We also found that treating the decay factor as a constant hardly improves generalization for large batch. Therefore, we utilize dropout as an alternative to compensate for the insufficient regularization. Dropout has also been analytically viewed as a regularizer (Wager et al., 2013). We add a dropout after each BN layer to impose regularization.
Fig.2(g&h) in the main paper plot the classification results using ResNet18. The generalization of BN deteriorates significantly when M increases from 128 to 1024. This is observed by the much higher validation loss (Fig.2(g)) and lower validation accuracy (Fig.2(h)) when M = 1024. If a dropout layer with ratio 0.1 is added after each residual block layer for M = 1024 in ResNet18, the validation loss is suppressed and accuracy increased by a great margin. This superficially contradicts with the original claim that BN reduces the need for dropout (Ioffe & Szegedy, 2015). We find that there are two differences between our study and (Ioffe & Szegedy, 2015).
First, in pervious study the batch size was fixed at a quite small value (e.g. 32), at which the regularization was already quite strong. Therefore, an additional dropout could not further cause better regularization, but on the contrary increases the instability in training and yields a lower accuracy. However, our study explores relatively large batch that degrades the regularization of BN, and thus dropout with a small ratio can complement. Second, usual trials put dropout before BN and cause BN to have different variances during training and test. In contrast, dropout follows BN in this study and the distance between two dropout layers is large (a residual block separation), thus the problem can be alleviated. The improvement by applying dropout after BN has also been observed by a recent work (Li et al., 2018).
WN+dropout. Since BN can be treated as WN trained with regularization as shown in this study, combining WN with regularization should be able to match the performance of BN. As WN outperforms BN in running speed (without calculating statistics) and it suits better in RNNs than BN, an improvement of its generalization is also of great importance. Fig.2(g&h) also show that WN can also be regularized by dropout. We apply dropout after each WN layer with ratio 0.2 and the dropout is applied at the same layers as that for BN. We found that the improvement on both validation accuracy and loss is surprising. The accuracy increases from 0.90 to 0.93, even close to the results of BN. Nevertheless, additional regularization on WN still cannot make WN on par with the performance BN. In deep neural networks the distribution after each layer would be far from a Gaussian distribution, in which case WN is not a good substitute for PN. A potential substibute of BN would require us for designing better estimations of the distribution to improve the training speed and performance of deep networks.

heading: C PROOF OF RESULTS

heading: C.1 PROOF OF EQN.(3)
text: Theorem 1 (Regularization of µB, σB). Let a single-layer perceptron with BN and ReLU activation function be defined by y = max(0, ĥ), ĥ = γ h−µBσB +β and h = w Tx, where x and y are the network input and output respectively, h and ĥ are the hidden values before and after batch normalization, and w is the weight vector. Let `(ĥ) be the loss function. Then
1
P P∑ j=1 EµB,σB`(ĥj) ' 1 P P∑ j=1 `(h̄j) + ζ(h)γ2 and ζ(h) = ρ+ 2 8M I(γ) + 1 2M 1 P P∑ j=1 σ(h̄j),
where h̄j = γw Txj−µP σP + β represents population normalization (PN), ζ(h)γ2 represents gamma decay and ζ(h) is a data-dependent decay factor. ρ is the kurtosis of the distribution of h, I(γ) is an estimation of the Fisher information of γ and I(γ) = 1P ∑P j=1( ∂`(ĥj) ∂γ )
2, and σ(·) is a sigmoid function.
Proof. We have ĥj = γw Txj−µB σB +β and h̄j = γw Txj−µP σP
+β. We prove theorem 1 by performing a Taylor expansion on a function A(ĥj) at h̄j , where A(ĥj) is a function of ĥj defined according to a particular activation function. The negative log likelihood function of the above single-layer perceptron can be generally defined as − log p(yj |ĥj) = A(ĥj)− yj ĥj , which is similar to the loss
function of the generalized linear models with different activation functions. Therefore, we have
1
P P∑ j=1 EµB,σB [l(ĥj)] = 1 P P∑ j=1 EµB,σB [ A(ĥj)− yj ĥj ]
= 1
P P∑ j=1 (A(h̄j)− yj h̄j) + 1 P P∑ j=1 EµB,σB [ −yj(ĥj − h̄j) +A(ĥj)−A(h̄j) ]
= 1
P P∑ j=1 l(h̄j) + 1 P P∑ j=1 EµB,σB [ (A′(h̄j)− yj)(ĥj − h̄j) ]
+ 1
P P∑ j=1 EµB,σB [ A′′(h̄j) 2 (ĥj − h̄j)2 ]
= 1
P P∑ j=1 l(h̄j) +Rf +Rq,
where A′(·) and A′′(·) denote the first and second derivatives of function A(·). The first and second order terms in the expansion are represented by Rf and Rq respectively. To derive the analytical forms of Rf and Rq , we take a second-order Taylor expansion of of 1σB and 1 σ2B
around σP , it suffices to have
1 σB ≈ 1 σP + (− 1 σ2P )(σB − σP) + 1 σ3P (σB − σP)2
and 1
σ2B ≈ 1 σ2P + (− 2 σ3P )(σB − σP) + 3 σ4P (σB − σP)2.
By applying the distributions of µB and σB introduced in section 2, we have µB ∼ N (µP , σ 2 P
M ) and σB ∼ N (σP , ρ+24M ). Hence, R f can be derived as in the paper, Rf can be derived as
Rf = 1
P P∑ j=1 EµB,σB [ (A′(h̄j)− yj)(ĥj h̄j) ]
= 1
P P∑ j=1 EµB,σB [ (A′(h̄j)− yj) ( γ wTxj − µB σB − γw Txj − µP σP )]
= 1
P P∑ j=1 EµB,σB [ (A′(h̄jyj) ( γwTxj ( 1 σB − 1 σP ) + γ ( −µB σB + µP σP ))]
= 1
P P∑ j=1 γ(A′(h̄j)− yj)(wTxj − µP)EσB [ 1 σB − 1 σP ]
= 1
P P∑ j=1 ρ+ 2 4M γ(A′(h̄j)− yj)w Txj − µP σP .
This Rf term can be understood as below. Let h = w Tx−µP σP
and the distribution of the population data be pxy . We establish the following relationship
E(x,y)∼pxyEµB,σB [ (A′(h̄)− y)h ] = EµB,σBEx∼pxEy|x∼py|x [ (A′(h̄)− y)h ] = EµB,σBEx∼px [ (E [y|x]− Ey|x∼py|x [y])h
] = 0.
Since the sample mean converges in probability to the population mean by the Weak Law of Large Numbers, for all > 0 and a constant number K (∃K > 0 and ∀P > K), we have
p (∣∣Rf − E(x,y)∼pxyEµB,σB [(A′(h̄)− y)h] ∣∣ ≥ ρ+24M ) = 0. This equation implies that Rf is sufficiently small with a probability of 1 given moderately large number of data points P (the above inequality holds when P > 30).
On the other hand, Rq can be derived as
Rq = 1
P P∑ j=1 EµB,σB [ A′′(h̄j) 2 (ĥj − h̄j)2 ]
= 1
P P∑ j=1 A′′(h̄j) 2 EµB,σB [ (γ wTxj − µB σB + β − γw Txj − µP σP + β)2 ]
= 1
P P∑ j=1 A′′(h̄j) 2 EµB,σB [ (γwTxj)2( 1 σB − 1 σP )2 − 2γµPwTxj( 1 σB − 1 σP )2 + ( µB σB − µP σP )2 ]
' 1 P P∑ j=1 γ2A′′(h̄j) 2 ( (wTxj − µP)2EµB,σB [ ( 1 σB − 1 σP )2 ] + EµB,σB [( µB − µP σB )2])
= 1
P P∑ j=1 γ2A′′(h̄j) 2 ( ( wTxj − µP σP )2 ρ+ 2 4M + 1 M (1 + 3(ρ+ 2) 4M ) ) .
Note that ∂ 2l(h̄j) ∂γ2 = A ′′(h̄j)(w Txj−µP σP )2, we have I(γ) = 1P ∑P j=1A ′′(h̄j)(w Txj−µP σP
)2 been an estimator of the Fisher information with respect to the scale parameter γ. Then, by neglecting O(1/M2) high-order term in Rq , we get
Rq ' ρ+ 2 8M I(γ)γ2 + µd 2A 2M γ2,
where µd2A indicates the mean of the second derivative of A(h).
The results of both ReLU activation function and identity function are provided as below.

heading: C.2 RELU ACTIVATION FUNCTION
text: For the ReLU non-linear activation function, that is g(h) = max(h, 0), we use its continuous approximation softplus function g(h) = log(1+exp(h)) to derive the partition functionA(h). In this case, we have µd2A = 1P ∑P j=1 σ(h̄ j). Therefore, we have ζ(h) = ρ+28M I(γ) + 1 2M 1 P ∑P j=1 σ(h̄
j) as shown in Eqn.(3).

heading: C.3 LINEAR STUDENT NETWORK WITH IDENTITY ACTIVATION FUNCTION
text: For a loss function with identity (linear) units, 1P ∑P j=1 ( w∗Txj − γ(wTxj − µB)/σB )2 , we have I(γ) = 2λ and ρ = 0 for Gaussian input distribution. The exact expression of Eqn.(3) is also possible for such linear regression problem. Under the condition of Gaussian input x ∼ N (0, 1/N), h = wTx is also a random variable satisfying a normal distribution N (0, 1). It can be derived that E ( σ−1B ) = √ M√
2σP Γ(M−22 ) Γ(M−12 )
and E ( σ−2B ) = M
σ2P Γ(M−12 −1) Γ(M−12 ) . Therefore
ζ = λ ( 1 + MΓ ( (M − 3)/2 ) 2Γ ( (M − 1)/2 ) −√2M Γ((M − 2)/2) Γ ( (M − 1)/2 )) . Furthermore, the expression of ζ can be simplified as ζ = 34M . If the bias term is neglected in a simple linear regression, contributions from µB to the regularization term is neglected and thus ζ = 14M . Note that if one uses mean square error without being divided by 2 during linear regression, the values for ζ should be multiplied by 2 as well, where ζ = 12M .

heading: C.4 BN REGULARIZATION IN A DEEP NETWORK
text: The previous derivation is based on the single-layer perceptron. In deep neural networks, the forward computation inside one basic building block of a deep network is written by
zli = g(ĥi), ĥ l i = γ l i hli − (µB)li
(σB)li + βli and h l i = (w l i) Tzl−1, (7)
where the superscript l ∈ [1, L] is the index of a building block in a deep neural network, and i ∈ [1, N l] indexes each neuron inside a layer. z0 and zL are synonyms of input x and output y, respectively. In order to analyze the regularization of BN from a specific layer, one needs to isolate its input and focus on the noise introduced by the BN layer in this block. Therefore, the loss function `(ĥl) can also be expanded at `(h̄l). In BN, the batch variance is calculated with regard to each neuron under the assumption of mutual independence of neurons inside a layer. By following this assumption and the above derivation in Appendix C.1, the loss function with BN in deep networks can also be similarly decomposed.
Regularization of µlB, σlB in a deep network. Let ζl be the strength (coefficient) of the regularization at the l-th layer. Then
1
P P∑ j=1 EµlB,σlB` ( (ĥl)j ) ' 1 P P∑ j=1 ` ( (h̄l)j ) + N l∑ i ζli · (γli)2,
and ζli = 1
P P∑ j=1
diag ( H`(h̄l)j ) i
2
( ρli + 2
4M
( (wli)
T (zl−1)j − (µP)li (σP)li
)2 + 1
M
) +O(1/M2),
where i is the index of a neuron in the layer, (h̄li) j = γli
(wli) T (zl−1)j−(µP)li
(σP)li +βli represents population
normalization (PN),H`(h̄l) is the Hessian matrix at h̄l regarding to the loss ` and diag(·) represents the diagonal vector of a matrix.
It is seen that the above equation is compatible with the results from the single-layer perceptron. The main difference of the regularization term in a deep model is that the Hessian matrix is not guaranteed to be positive semi-definite during training. However, this form of regularization is also seen from other regularization such as noise injection (Rifai et al., 2011) and dropout (Wager et al., 2013), and has long been recognized as a Tikhonov regularization term (Bishop, 1995).
In fact, it has been reported that in common neural networks, where convex activation functions such as ReLU and convex loss functions such as common cross entropy are adopted, the Hessian matrix H`(h̄l) can be seen as ‘locally’ positive semidefinite (Santurkar et al., 2018). Especially, as training converges to its mimimum training loss, the Hessian matrix of the loss can be viewed as positive semi-definite and thus the regularization term on γl is positive.

heading: C.5 DYNAMICAL EQUATIONS
text: Here we discuss the dynamical equations of BN. Let the length of teacher’s weight vector be 1, that is, 1Nw ∗Tw∗ = 1. We introduce a normalized weight vector of the student as w̃ = √ Nγ w‖w‖ . Then the overlapping ratio between teacher and student, the length of student’s vector, and the length of student’s normalized weight vector are 1N w̃ Tw∗ = QR = γR, 1N w̃ Tw̃ = Q2 = γ2, and
1 Nw Tw = L2 respectively, where Q = γ. And we have 1Nw Tw = LR.
We transform update equations (5) by using order parameters. The update rule for variable Q2 can be obtained by ( Q2 )j+1− (Q2)j = 1N [2ηδjw̃jTxj−2ηζ(Q2)j] following update rule of γ. Similarly, the update rules for variables RL and L2 are calculated as follow:
( RL )j+1 − (RL)j = 1
N (ηQj Lj δjw∗Txj − ηR j Lj δjw̃jTxj ) ,(
L2 )j+1 − (L2)j = 1
N [η2(Q2)j (L2)j δj 2 xjTxj − η 2 N(L2)j δj 2 (w̃jTxj)2 ] .
(8)
Let t = jN is a normalized sample index that can be treated as a continuous time variable. We have ∆t = 1N that approaches zero in the thermodynamic limit when N →∞. In this way, the learning dynamic of Q2, RL and L2 can be formulated as the following differential equations: dQ2 dt = 2ηI1 − 2ηζQ 2, dRL dt = η Q L I3 − η R L I1,
dL2
dt = η 2Q
2
L2 I2,
(9)
where I1 = 〈δw̃Tx〉x, I2 = 〈δ2xTx〉x, and I3 = 〈δw∗Tx〉x, which are the terms presented in dQ2
dt , dRL dt , and
dL2
dt and 〈·〉x denotes expectation over the distribution of x. They are used to simplify notations. Note that we neglect the last term of dL2/dt in Eqn.(8) since η 2
N(L2)δ 2(w̃Tx)2
can be approximately equal to zero when N approaches infinity. On the other hand, we have dQ2 = 2QdQ, dRL = RdL+ LdR and dL2 = 2LdL. Hence, Eqn.(9) can be reduced to dQ dt = η I1 Q − ηζQ, dR dt = η Q L2 I3 − η R L2 I1 − η 2Q 2R
2L4 I2, dL dt = η 2 Q 2 2L3 I2.
(10)
Proposition 1. Let (Q0, R0, L0) denote a fixed point with parameters Q, R and L of Eqn.(10). Assume the learning rate η is sufficiently small when training converges and x ∼ N (0, 1N I). If activation function g is ReLU, then we have Q0 = 12ζ+1 , R0 = 1 and L0 could be arbitrary.
Proof. First, L has no influence on the output of student model since w is normalized, which implies that if (Q0, R0, L0) is a fixed point of Eqn.(10), L0 could be arbitrary. Besides, we have η η2 because the learning rate η is sufficiently small. Therefore, the terms in Eqn.(10) proportional to η2 can be neglected. If (Q0, R0, L0) is a fixed point, it suffices to have
η I1(Q0, R0)
Q0 − ηζQ0 = 0, (11)
η Q0 L20 I3(Q0, R0)− η R0 L20 I1(Q0, R0) = 0, (12)
To calculate I1 and I3, we define s and t as w̃Tx and wTx. Since x ∼ N (0, 1N I), we can acquire[ s t ] ∼ N (([ 0 0 ] , [ Q2 QR QR 1 ])) so probability measure of [s, t]T can be written as
DsDt = 1
2πQ √ 1−R2 exp
{ −1
2
[ s t ]T [ Q2 QR QR 1 ]−1 [ s t ]} Then,
I1 = 〈 g′(w̃Tx) [ g(w∗Tx)− g(w̃Tx) ] w̃Tx 〉 x
= ∫ u,v [g′(s) (g(t)− g(s) s]DsDt
= ∫ +∞ 0 ∫ +∞ 0 stDsDt− ∫ +∞ 0 s2 ∫ +∞ −∞ DsDt
= Q(πR+ 2
√ 1−R2 + 2Rarcsin(R))
4π − Q
2
2
(13)
and
I3 = ∫ u,v [g′(s) (g(t)− g(s) t]DsDt
= ∫ u,v g′(s)g(t)tDsDt− ∫ u,v g′(s)g(s)tDsDt
= ∫ +∞ 0 ∫ +∞ 0 t2DsDt− ∫ +∞ 0 ∫ +∞ −∞ stDsDt
= π + 2R
√ 1−R2 + 2 arcsin(R)
4π − QR 2
(14)
By substituting Eqn.(13) and (14) into Eqn.(11) and (12), we get Q0 = 12ζ+1 and R0 = 1.
Proposition 2. Given conditions in proposition1, let λbnQ , λbnR be the eigenvalues of the Jacobian matrix at fixed point (Q0, R0, L0) corresponding to the order parameters Q and R respectively in BN. Then
{ λbnQ = η Q0 ∂I1 ∂Q − ηζQ0,
λbnR = ∂I2 2∂R ηQ0 2L20 (ηbnmax − ηbneff),
where ηbnmax and η bn eff are the maximum and effective learning rates respectively in BN.
Proof. At fixed point (Q0, R0, L0) = ( 12ζ+1 , 1, L0) obtained in proposition1, the Jacobian of dynamic equations of BN can be derived as
Jbn =  η Q0 ∂I1 ∂Q − 2ηζ
η Q0 ∂I1 ∂R 0
0 η L20 ( Q0∂I3 ∂R − ∂I1 ∂R − ζQ 2 0 ) − η 2Q20 2L40 ∂I2 ∂R 0 0 η2Q20 2L30 ∂I2 ∂R 0  , and the eigenvalues of Jbn can be obtained by inspection
 λbnQ = η Q0 ∂I1 ∂Q − 2ηζ, λbnR = η L20 ( Q0∂I3 ∂R − ∂I1 ∂R − ζQ 2 0 ) − η 2Q20 2L40 ∂I2 ∂R = ∂I2 ∂R ηQ0 2L20 ( ηbnmax − ηbneff ) ,
λbnL = 0.
Since γ0 = Q0, we have ηbnmax = ( ∂(γ0I3−I1) γ0∂R − ζγ0)/ ∂I22∂R and η bn eff = ηγ0 L20 .

heading: C.6 STABLE FIXED POINTS OF BN
text: Proposition 3. Given conditions in proposition1, when activation function is ReLU, then (i) λbnQ < 0, and (ii) λbnR < 0 iff η bn max > η bn eff .
Proof. When activation function is ReLU, we derive I1 = Q(πR+2
√ 1−R2+2R arcsin(R))
4π − Q2
2 , which gives
∂I1 ∂Q
= −Q+ πR+ 2 √
1−R2 + 2R arcsin(R) 4π .
Therefore at the fixed point of BN (Q0, R0, L0) = ( 12ζ+1 , 1, L0), we have
λbnQ = η( 1
Q0
∂I1 ∂Q − 2ζ) = η( 1 Q0 (−1 + 1 2Q0 − 2ζ) = −ζ − 1 2 < 0.
Note that xTx approximately equals 1. We get
I2 = ∫ u,v [g′(s) (g(t)− g(s))]2DsDt
= ∫ +∞ 0 ∫ +∞ 0 v2DsDt+ ∫ +∞ 0 ∫ +∞ −∞ s2DsDv − 2 ∫ +∞ 0 ∫ +∞ −∞ stDsDt
= Q2 2 + πR+ 2R
√ 1−R2 + 2 arcsin(R)
4π − Q(πR+ 2
√ 1−R2 + 2R arcsin(R))
2π .
(15)
At the fixed point we have ∂I2∂R = −Q0 < 0. Therefore, we conclude that λ bn R < 0 iff η bn max > η bn eff .

heading: C.7 MAXIMUM LEARNING RATE OF BN
text: Proposition 4. When the activation function is ReLU, then ηbnmax ≥ η {wn,sgd} max + 2ζ , where ηbnmax and η {wn,sgd} max indicate the maximum learning rates of BN, WN, and vanilla SGD respectively.
Proof. From the above results, we have I1 = Q(πR+2
√ 1−R2+2R arcsin(R))
4π − Q2
2 , which gives ∂I1/∂R ≥ 0 at the fixed point of BN. Then it can be derived that ∂I2∂R < 0. Furthermore, at the fixed point of BN, Q0 = γ0 = 12ζ+1 < 1, then we have
ηbnmax = ( ∂(γ0I3 − I1)
γ0∂R − ζγ0)/ ∂I2 2∂R
= ∂(I3 − I1) ∂R / ∂I2 2∂R + (1− 1 γ0 ) ∂I1 ∂R / ∂I2 2∂R − ζγ0/ ∂I2 2∂R ≥ ∂(I3 − I1) ∂R / ∂I2 2∂R + 2ζ
where the inequality sign holds because (1 − 1γ0 ) ∂I1 ∂R / ∂I2 2∂R is positive. Note that ∂(I3−I1) ∂R / ∂I2 2∂R is also defined as maximum learning rates of WN, and vanilla SGD in Yoshida et al. (2017). Hence, we conclude that ηbnmax ≥ η {wn,sgd} max + 2ζ.

heading: D PROOFS REGARDING GENERALIZATION AND STATISTICAL MECHANICS (SM)
text: In this section, we build an analytical model for the generalization ability of a single-layer network. The framework is based on the Teacher-Student model, where the teacher network output y∗ = g∗ ( w∗T · x + s ) is learned by a student network. The weight parameter of the teacher network satisfies 1N (w ∗)T · w∗=1 and the bias term s is a random variable s ∼ N (0, S) fixed for each training example x to represent static errors in training data from observations. In the generalization analysis, the input is assumed to be drawn from x ∼ N ( 0, 1N I ) . The output of the student can also be written as a similar form y = g (w̃ · x), where the activation function g (·) can be either linear or ReLU in the analysis and w̃ is a general weight parameter which can be used in either WN or common linear perceptrons. Here we take WN for example, since it has been derived in this study that BN can be decomposed into WN with a regularization term on γ. In WN w̃ = γ w‖w‖2 and we defined the same order parameter as the previous section that γ2 = 1N w̃ T · w̃ and γR = 1N w̃ T ·w∗ .

heading: D.1 GENERALIZATION ERROR
text: Since the learning task is a regression problem with teacher output biased by a Gaussian noise, it comes natural that we can use the the average mean square error loss t = 1P ∑ j ( y∗j − yj )2 for the regression. The generalization error defined as the estimation over the distribution of input x and is written as
gen(w̃) = 〈 (y∗ − y)2 〉 x
(16)
where 〈·〉x denotes an average over the distribution over x. The generalization error is a function of its weight parameter and can be converted to a function only with regard to the aformentioned order parameters, detailed derivation can be seen in (Bös, 1998; Krogh & Hertz, 1992).
gen(γ,R) = ∫∫ Dh1Dh2 [ g∗(h1)− g(γRh1 + γ √ 1−R2h2) ]2 (17)
where h1and h2 are variables drawn from standard Gaussian distribution and Dh1 := N (0, 1) dh1. When both the teacher network and student network have a linear activation function, the above integration can be easily solved and
gen(γ,R) = 1 + γ 2 − 2γR (18)
As for the case where the teacher network is linear and the student network has a ReLU activation, it can still be solved first by decomposing the loss function
gen(γ,R) = ∫∫ Dh1Dh2 [ h1 − g(γRh1 + γ √ 1−R2h2) ]2 = ∫∫ Dh1Dh2 [ h21 + g(γRh1 + γ √ 1−R2h2)2 − 2h1g(γRh1 + γ √ 1−R2h2)
]2 = 1 + γ2
2 − 2
∫∫ Dh1Dh2 [ h1g(γRh1 + γ √ 1−R2h2) ]2 It should be noted that the last two terms should only be integrated over the half space γRh1 + γ √
1−R2h2 > 0, and therefore if we define the angle of this line with the h2 axis θ0 = arccos (R) the integration is transformed to polar coordinate
gen(γ,R) = 1 + γ2
2 − 2
∫∫ Dh1Dh2 [ h1g(γRh1 + γ √ 1−R2h2) ]2 = 1 + γ2
2 − 2 ∫ π−θ0 −θ0 dθ ∫ ∞ 0 rdr 1 2π exp(−r 2 2 ) ( γRr2 sin2(θ) + γ √ 1−R2r2 cos (θ) sin (θ) ) = 1 + γ2
2 − γR

heading: D.2 EQUILIBRIUM ORDER PARAMETERS
text: Following studies on statistical mechanics, the learning process of a neural network resembles a Langevin process (Mandt et al., 2017) and at the equilibrium the network parameters θ follow a Gibbs distribution. That is, the weight vector that yields lower training error produces higher probability. We have p(θ) = Z−1 exp{−β t(θ; x)}, where β = 1/T and T is temperature, representing the variance of noise during training and implicitly controlling the learning process. t(θ; x) is an energy term of the training loss function, Z = ∫ dP(θ) exp{− t(θ; x)/T} is the partition function, and P(θ) is a prior distribution. Instead of directly minimizing the energy term above, statistical mechanics finds the minima of free energy, f , which is a function over T , considering the fluctuations of θ at finite temperatures. We have −βf = 〈lnZ〉x. By substituting the parameters that minimize f back into the generalization errors calculated above, we are able to calculate the averaged generalization error, at a certain temperature.
The solution of SM requires the differentiation of f with respect to the order parameters.
In general, the expression of free energy under the replica theory is expressed as(Seung et al., 1992)
− βf = 1 2 (γ2 − γ2R2) q2 − γ2 + 1 2 ln(q2 − γ2) + α
∫∫ Dh1Dh2 ln [∫ Dh3 exp ( −β (g − g ∗) 2
2
)] (19)
where
g := g ( γRh1 + √ γ2 − γ2R2h2 + √ q2 − γ2h3 ) g∗ := g∗(h1 + s)
(20)
In the above expression, h1, h2, h3 are three independent variables following the standard Gaussian distribution and α = P/N represents the ratio of the number of training samples P to number of unknown parameters N in the network, R = 1N w ‖w‖2 ·w ∗, q is the prior value of γ..
The above equation can be utilized for a general SM solution of a network. However, the solution is notoriously difficult to solve and only a few linear settings for the student network have close-form solutions(Bös, 1998). Here we extend the previous analysis of linear activations to a non-linear one, though still under the condition that β → ∞, which means that the student network undergoes a exhaustive learning that minimizes the training error. In the current setting, the student network is a nonlinear ReLU network while the teacher is a noise-corrupted linear one.
Proposition 5. Given a single-layer linear teacher y∗ = w∗x + s and a student ReLU network y = g(γ w‖w‖2 x) linear student network with g being a ReLU activation function, x ∼ N (0, I N ) the free energy f satisfies as β →∞
−βf = 1 2 (γ2 − γ2R2) q2 − γ2 + 1 2 ln(q2 − γ2)
− α 4
ln ( 1 + β ( q2 − γ2 )) − αβ ( 1− 2γR+ γ2 + S ) 4 (1 + β (q2 − γ2)) − αβ 4 − αβ 4 S
(21)
where S is the variance of the Gaussian noise s injected to the output of the teacher.
Proof. The most difficult process in Eqn.19 is to solve the inner integration over h3. Here as β →∞, it is noted that the function exp (−βx) only notches up only at x = 0 and is 0 elsewhere. Therefore, the integration ∫ Dh3 exp ( −β(g−g ∗)2
2
) depends on the value of g∗. If g∗ < 0, no solution exists for
g − g∗ = 0 as g is a ReLU activation, and thus the integration is equivalent to the maximum value of the integral under the limit of β →∞. As g∗ > 0, the integration over the “notch” is equivalent to the one at full range. That is,
∫ Dh3 exp ( −β (g − g ∗) 2
2
) =  ∫ Dh3 exp ( −β(g−g ∗)2 2 ) h1 + s > 0 maxh3 exp ( −β(g−g ∗)2
2
) h1 + s ≤ 0
The above equation can be readity integrated out and we obtain
ln ∫ Dh3 exp ( −β (g − g ∗) 2
2
) = −1
2 ln ( 1 + β ( q2 − γ2 ))
− β 2
( (1− γR)h1 − √ γ2 − γ2R2h2 + s )2 1 + β (q2 − γ2)
Substituting it back to Eqn.19, we have its third term equivalent
Term3 = α ∫∫
h1+s>0
Dh1Dh2 −β 2 ( (1− γR)h1 − √ γ2 − γ2R2h2 + s )2 1 + β (q2 − γ2)  = α
∫∫ h1+s>0 Dh1Dh2 −β 2 ( (1− γR)2 h21 − √ γ2 − γ2R2h2 + s )2 1 + β (q2 − γ2)  To solve the above integration, we first realize that s is a random variable to corrupt the output of the teacher output and the above integration should be averaged out over s. Given that s ∼ N (0, S) , it is easy to realize that〈∫
h+s>0
s2Dh 〉 s = S 2 , 〈∫ h+s>0 Dh 〉 s = 1 2 , and 〈∫ h+s>0 hsDh 〉 s = 0
Through simple Gaussian integraions, we get
Term3 = α [ −1
4 ln ( 1 + β ( q2 − γ2
)) − β ( 1− 2γR+ γ2 + S ) 4 (1 + β (q2 − γ2)) − β 4 − β 4 S ]
Substituting Term3 back yields the results of the free energy.
Therefore, by locating the values that minimizes f in the above proposition, we have equilibrium order parameters
γ2 = α
2a +
αS
2a− α (22)
and γR = α
2a (23)
where a is defined as a = 1+β(q2−γ2) β(q2−γ2) . Substituting the order parameters back to the generalization error, we have
gen = 1− α
4a +
αS
2a (2a− α) (24)
When α < 2 and β →∞, a = 1, the generalization error is
gen = 1− α
4 +
αS
2 (2− α) (25)

Review summaries:
This is a thought provoking paper that aims to understand the regularization effects of batch-normalization (BN) under a probabilistic interpretation. The authors connect BN to population normalization (PN) and a gamma-decay term that penalizes the scale of the weights. They analyze the generalization error of BN for a single-layer perceptron using ideas in statistical physics.