T HE O NSET OF V ARIANCE -L IMITED B EHAVIOR FOR N ETWORKS IN THE L AZY AND R ICH R EGIMES
A BSTRACT
For small training set sizes P , the generalization error of wide neural networks is well-approximated by the error of an infinite width neural network (NN), either in the kernel or mean-field/feature-learning regime.
However, after a critical sample size P ∗ , we empirically find the finite-width network generalization becomes worse than that of the infinite width network.
In this work, we empirically study the transition from infinite-width behavior to this variance-limited regime as a function of sample size P and network width N .
We find that finite-size effects can become relevant for very small dataset sizes on the order of P ∗ ∼ √ N for polynomial regression with ReLU networks.
We discuss the source of these effects using an argument based on the variance of the NN’s final neural tangent kernel (NTK).
This transition can be pushed to larger P by enhancing feature learning or by ensemble averaging the networks.
We find that the learning curve for regression with the final NTK is an accurate approximation of the NN learning curve.
Using this we provide a toy model which also exhibits P ∗ ∼ √ N scaling and has P -dependent benefits from feature learning.
I NTRODUCTION
Deep learning systems are achieving state of the art performance on a variety of tasks (Tan & Le, 2019; Hoffmann et al., 2022).
Exactly how their generalization is controlled by network architecture, training procedure, and task structure is still not fully understood.
One promising direction for deep learning theory in recent years is the infinite-width limit.
Under a certain parameterization, infinitewidth networks yield a kernel method known as the neural tangent kernel (NTK) (Jacot et al., 2018;
Lee et al., 2019).
Kernel methods are easier to analyze, allowing for accurate prediction of the generalization performance of wide networks in this regime (Bordelon et al., 2020; Canatar et al., 2021; Bahri et al., 2021;
Simon et al., 2021).
Infinite-width networks can also operate in the meanfield regime if network outputs are rescaled by a small parameter α that enhances feature learning (Mei et al., 2018;
Chizat et al., 2019; Geiger et al., 2020b; Yang & Hu, 2020; Bordelon & Pehlevan, 2022).
While infinite-width networks provide useful limiting cases for deep learning theory, real networks have finite width.
Analysis at finite width is more difficult, since predictions are dependent on the initialization of parameters.
While several works have attempted to analyze feature evolution and kernel statistics at large but finite width (Dyer & Gur-Ari, 2020; Roberts et al., 2021), the implications of finite width on generalization are not entirely clear.
Specifically, it is unknown at what value of the training set size P the effects of finite width become relevant, what impact this critical P has on the learning curve, and how it is affected by feature learning.
To identify the effects of finite width and feature learning on the deviation from infinite width learning curves, we empirically study neural networks trained across a wide range of output scales α , widths N , and training set sizes P on the simple task of polynomial regression with a ReLU neural network.
Concretely, our experiments show the following:
• Learning curves for polynomial regression transition exhibit significant finite-width effects very early, around P ∼ √ N .
Finite-width NNs at large α are always outperformed by their infinite-width counterparts.
We show this gap is driven primarily by variance of the predictor over initializations (Geiger et al., 2020a).
Following prior work (Bahri et al., 2021), we refer to this as the variance-limited regime .
We compare three distinct ensembling methods to reduce error in this regime.
• Feature-learning NNs show improved generalization both before and after the transition to the variance limited regime.
Feature learning can be enhanced through re-scaling the output of the network by a small scalar α or by training on a more complex task (a higher-degree polynomial).
We show that alignment between the final NTK and the target function on test data improves with feature learning and sample size.
• We demonstrate that the learning curve for the NN is well-captured by the learning curve for kernel regression with the final empirical NTK, eNTK f , as has been observed in other works (Vyas et al., 2022;
Geiger et al., 2020b; Atanasov et al., 2021;
Wei et al., 2022).
• Using this correspondence between the NN and the final NTK, we provide a cursory account of how fluctuations in the final NTK over random initializations are suppressed at large width N and large feature learning strength.
In a toy model, we reproduce several scaling phenomena, including the P ∼ √ N transition and the improvements due to feature learning through an alignment effect.
We validate that these effects qualitatively persist in the realistic setting of wide ResNets Zagoruyko & Komodakis (2017) trained on CIFAR in appendix E.
Overall, our results indicate that the onset of finite-width corrections to generalization in neural networks become relevant when the scale of the variance of kernel fluctuations becomes comparable to the bias component of the generalization error in the bias-variance decomposition.
The variance contribution to generalization error can be reduced both through ensemble averaging and through feature learning, which we show promotes higher alignment between the final kernel and the task.
We construct a model of noisy random features which reproduces the essential aspects of our observations.
1. R ELATED W ORKS
Geiger et al.
(2020a) analyzed the scaling of network generalization with the number of model parameters.
Since the NTK fluctuates with variance O ( N − 1 ) for a width N network (Dyer & GurAri, 2020; Roberts et al., 2021), they find that finite width networks in the lazy regime generically perform worse than their infinite width counterparts.
The scaling laws of networks over varying N and P were also studied, both empirically and theoretically by Bahri et al.
They consider two types of learning curve scalings.
First, they describe resolution-limited scaling, where either training set size or width are effectively infinite and the scaling behavior of generalization error with the other quantity is studied.
There, the scaling laws can been obtained by the theory in Bordelon et al.
Second, they analyze variance-limited scaling where width or training set size are fixed to a finite value and the other parameter is taken to infinity.
While that work showed for any fixed P that the learning curve converges to the infinite width curve as O ( N − 1 ) , these asymptotics do not predict, for fixed N , at which value of P the NN learning curve begins to deviate from the infinite width theory.
This is the focus of our work.
The contrast between rich and lazy networks has been empirically studied in several prior works.
Depending on the structure of the task, the lazy regime can have either worse (Fort et al., 2020) or better (Ortiz-Jim´enez et al., 2021; Geiger et al., 2020b) performance than the feature learning regime.
For our setting, where the signal depends on only a small number of relevant input directions, we expect representation learning to be useful, as discussed in (Ghorbani et al., 2020; Paccolat et al., 2021b).
Consequently, we posit and verify that the rich network will outperform the lazy one.
Our toy model is inspired by the literature on random feature models.
Analysis of generalization for two layer networks at initialization in the limit of high dimensional data have been carried out using techniques from random matrix theory (Mei & Montanari, 2022; Hu & Lu, 2020; Adlam &
Pennington, 2020a; Dhifallah & Lu, 2020; Adlam & Pennington, 2020b) and statistical mechanics (Gerace et al., 2020; d’Ascoli et al., 2020; d’Ascoli et al., 2020).
Several of these works have identified that when N is comparable to P , the network generalization error has a contribution from variance over initial parameters.
Further, they provide a theoretical explanation of the benefit of ensembling predictions of many networks trained with different initial parameters.
Recently, Ba et al.
(2022) studied regression with the hidden features of a two layer network after taking one step of gradient descent, finding significant improvements to the learning curve due to feature learning.
Zavatone-Veth et al.
(2022) analyzed linear regression for Bayesian deep linear networks with width N comparable to sample size P and demonstrated the advantage of training multiple layers compared to only training the only last layer, finding that feature learning advantage has leading correction of scale ( P/N ) 2 at small P/N .
P ROBLEM S ETUP AND N OTATION
We consider a supervised task with a dataset D = { x µ , y µ } Pµ =1 of size P .
The pairs of data points are drawn from a population distribution p ( x , y ) .
Our experiments will focus on training networks to interpolate degree k polynomials on the sphere (full details in Appendix A).
For this task, the infinite width network learning curves can be found analytically.
In particular at large P the generalization error scales as 1 /P
(Bordelon et al., 2020).
We take a single output feed-forward NN ˜ f θ : R D
→ R with hidden width N for each layer.
We let θ denote all trainable parameters of the network.
Using
NTK parameterization (Jacot et al., 2018), the activations for an input x are given by
[Equation]
Here, the output of the network is ˜ f
θ = h ( L ) 1 .
We take φ to be a positively homogenous function, in our case a ReLU nonlinearity, but this is not strictly necessary (Appendix C.2).
At initialization we have W ij ∼ N (0 , 1) .
Consequently, the scale of the output at initialization is O ( σ L ) .
As a consequence of the positive homogeneity of the network, the scale of the output is given by α = σ L .
α controls the feature learning strength of a given NN.
Large α corresponds to a lazy network while small α yields a rich network with feature movement.
More details on how α controls feature learning are given in Appendix C.1 and C.2.
In what follows, we will denote the infinite width NTK limit of this network by NTK ∞ .
We will denote its finite width linearization by eNTK 0 ( x , x ′ ) :
= (cid:80) θ
∂ θ f
( x ) ∂ θ f ( x ′ )
| θ = θ 0 , and we will denote its linearization around its final parameters θ f by eNTK f
( x , x ′ ) :
= (cid:80) θ
∂ θ f
( x ) ∂ θ f ( x ′ )
| θ = θ f .
Following other authors (Chizat et al., 2019; Adlam & Pennington, 2020a), we will take the output to be f θ ( x ) :=
˜ f
θ ( x ) − ˜ f
θ 0 ( x ) .
Thus, at initialization the function output is 0 .
We explain this choice further in Appendix A.
The parameters are then trained with full-batch gradient descent on a mean squared error loss.
We denote the final network function starting from initialization θ 0 on a dataset D by f ∗ θ 0 , D ( x ) or f ∗ for short.
The generalization error is calculated using a held-out test set and approximates the population risk E g ( f ) :
= (cid:10) ( f ( x ) − y ) 2 (cid:11) x ,y ∼ p ( x ,y ) .
E MPIRICAL R ESULTS
In this section, we will study learning curves for ReLU NNs trained on polynomial regression tasks of varying degrees.
We take our task to be learning y =
Q k ( β · x ) where β is random vector of norm 1 /D and Q k is the k th gegenbauer polynomial.
We will establish the following key observations, which we will set out to theoretically explain in Section 4.
Both eNTK 0 and sufficiently lazy networks perform strictly worse than NTK ∞ , but the ensembled predictors approach the NTK ∞ test error.
NNs in the feature learning regime of small α can outperform NTK ∞ for an intermediate range of P .
Over this range, the effect of ensembling is less notable.
Even richly trained finite width NNs eventually perform worse than NTK ∞ at sufficiently large P .
However, these small α feature-learning networks become variance-limited at larger P than lazy networks.
Once in the variance-limited regime, all networks benefit from ensembling over initializations.
For all networks, the transition to the variance-limited regime begins at a P ∗ that scales sub-linearly with N .
For polynomial regression, we find P ∗ ∼ √ N .
These findings support our hypothesis that finite width introduces variance in eNTK 0 over initializations, which ultimately leads to variance in the learned predictor and higher generalization error.
Although we primarily focus on polynomial interpolation tasks in this paper [Figure] in Appendix F we provide results for wide ResNets trained on CIFAR and observe that rich networks also outperform lazy ones [Figure]
and that lazy ones benefit more significantly from ensembling
[Figure]
3. F INITE WIDTH EFFECTS CAUSE THE ONSET OF A VARIANCE LIMITED REGIME
[Figure]
a Lazy networks perform strictly worse than NTK ∞ while rich networks can outperform it for an intermediate range of P before their performance is also limited.
b) Ensembling 20 networks substantially improves lazy network and eNTK 0 generalization, as well as asymptotic rich network generalization.
This indicates that at sufficiently large P , these neural networks become limited by variance due to initialization.
The error bars in a) and c) denote the variance due to both both training set and initialization.
The error bars in b), d) denote the variance due to the train set.
In this section, we first investigate how finite width NN learning curves differ from infinite width
NTK regression.
In Figure 1 we show the generalization error E g ( f ∗ θ 0 , D ) for a depth 3 network with width N = 1000 trained on a quadratic k = 2 and quartic k = 4 polynomial regression task.
Additional plots for other degree polynomials are provided in Appendix F. We sweep over P to show the effect of more data on generalization, which is the main relationship we are interested in studying.
For each training set size we sweep over a grid of 20 random draws of the train set andrandom network initializations.
This for 400 trained networks in total at each choice of P, k, N, α .
We see that a discrepancy arises at large enough P where the neural networks begin to perform worse than NTK ∞ .
We probe the source of the discrepancy between finite width NNs and NTK ∞ by ensemble averaging network predictions ¯ f D ( x ) := ⟨ f ∗ θ 0 , D ( x ) ⟩ θ 0 over E = 20 initializations θ 0 .
In Figures 1b and 1d, we calculate the error of ¯ f D ( x ) , each trained on the same dataset.
We then plot E g ( ¯ f D ) .
This
3.5 log P 1.
l o g log E g L=3, k=3, N= 3.
l o g 10 E g (a) k = 3 generalization error 2.
3.5 log P 1.
l o g var/ E g ( f ), L=3, k=3, N= 0.
(b) k = 3 variance fraction 2.
3.5 log P 1.
l o g
Alignment, L=3, k=3, N= 0.
(c) k
= 3 alignment ensembled error approximates the bias in a bias-variance decomposition (Appendix B). Thus, any gap between 1 (a) and 1 (b) is driven by variance of f θ, D over θ . We sharpen these observations with phase plots of NN generalization, variance and kernel alignment over P, α , as shown in Figure 2.
In Figure 2a, generalization for NNs in the rich regime (small α ) have lower final E g than lazy networks.
As the dataset grows, the fraction of E g due to initialization variance (that is, the fraction removed by ensembling) strictly increases (2 (b)).
We will show why this effect occurs in section 3.2.
Figure 2b shows that, at any fixed P , the variance is lower for small α .
To measure the impact of feature learning on the eNTK f , we plot its alignment with the target function, measured as y ⊤ Ky
| y |
Tr K for a test set of targets [ y ] µ and kernel [ K ] µν = eNTK
f
( x µ , x ν ) .
Alignment of the kernel with the target function is known to be related to good generalization (Canatar et al., 2021).
In Section 4, we revisit these effects in a simple model which relates kernel alignment and variance reduction.
In addition to initialization variance, variance over dataset D contributes to the total generalization error.
Following (Adlam & Pennington, 2020b), we discuss a symmetric decomposition of the variance in Appendix B, showing the contribution from dataset variance and the effects of bagging.
We find that most of the variance in our experiments is due to initialization.
We show several other plots of the results of these studies in the appendix.
We show the effect of bagging (Figure 7), phase plots of different degree target functions (Figures 10, 9), phase plots over N, α (Figure 11) and a comparison of network predictions against the initial and final kernel regressors (Figures 18, 19).
3. F INAL NTK V ARIANCE LEADS TO G ENERALIZATION P LATEAU
In this section, we show how the variance over initialization can be interpreted as kernel variance in both the rich and lazy regimes.
We also show how this implies a plateau for the generalization error.
To begin, we demonstrate empirically that all networks have the same generalization error as kernel regression solutions with their final eNTKs.
At large α , the initial and the final kernel are already close, so this follows from earlier results of Chizat et al.
In the rich regime, the properties of the eNTK f have been studied in several prior works.
Several have empirically demonstrated that the eNTK f is a good match to the final network predictor for a trained network (Long, 2021; Vyas et al., 2022; Wei et al., 2022) while others have given conditions under which such an effect would hold true (Atanasov et al., 2021; Bordelon & Pehlevan, 2022).
We comment on this in appendix C.4.
We show in Figure 3 how the final network generalization error matches the generalization error of eNTK f .
As a consequence, we can use eNTK f to study the observed generalization behavior.
Next, we relate the variance of the final predictor f ∗ θ 0 , D to the corresponding infinite width network f ∞D .
The finite size fluctuations of the kernel at initialization have been studied in (Dyer & Gur-Ari, 2020; Hanin & Nica, 2019; Roberts et al., 2021).
The variance of the kernel elements has been [Figure] [Figure] shown to scale as 1 /N .
We perform the following bias-variance decomposition:
Take f θ 0 , D to be the eNTK 0 predictor, or a sufficiently lazy network trained to interpolation on a dataset D .
Then,
[Equation]
We demonstrate this equality using a relationship between the infinite-width network and an infinite ensemble of finite-width networks derived in Appendix B.
There we also show that the O (1 /N ) term is strictly positive for sufficiently large N .
Thus, for lazy networks of sufficiently large N , finite width effects lead to strictly worse generalization error.
The decomposition in Equationcontinues to hold for rich networks at small α if f ∞ is interpreted as the infinite-width mean field limit.
In this case one can show that ensembles of rich networks are approximating an infinite width limit in the mean-field regime.
See Appendix B for details.
3. F EATURE L EARNING DELAYS VARIANCE LIMITED TRANSITION
We now consider how feature learning alters the onset of the variance limited regime, and how this onset scales with α, N .
We define the onset of the variance limited regime to take place at the value P ∗ =
P 1 / 2 where over half of the generalization error is due to variance over initializations.
Equivalently we have E g ( ¯ f ∗ ) /E
g ( f ∗ ) = 1 / 2 .
By using an interpolation method together with bisection, we solve for P 1 / 2 and plot it in Figure 4.
[Figure]
101010 3 P
E g E g ( NN ) =1.
Avg.
f Avg.
K Avg.
101010 3 P 1010=2.
101010 3 P
[Figure]
[Figure]
[Figure] [Figure]
We analyze ensembling for a 1 task with a width N 100 ReLU network
While all ensembling methods improve generalization, averaging either the kernel K or features ⟨ ⟩ gives a better improvement to generalization than averaging the output many
Figure 4b shows that P 1 / 2 scales as √ N for this task.
In the next section, we shall show that this scaling is governed by the fact that P 1 / 2 is close to the value where the infinite width network generalization curve E ∞ g is equal to the variance of eNTK f .
In this case the quantities to compare are E ∞ g ≈ P − 2 and Var eNTK
f ≈ N −
We can understand the delay of the variance limited transition, as well as the lower value of the final plateau using a mechanistic picture similar to the effect observed in Atanasov et al.
In that setting, under small initialization, the kernel follows a deterministic trajectory, picking up a low rank component in the direction of the train set targets yy ⊤ , and then changing only in scale as the network weights grow to interpolate the dataset.
In their case, for initial output scale σ L , eNTK f is deterministic up to a variance of O ( σ ) .
In our case, the kernel variance at initialization scales as σ 2 L /N .
As σ → 0 the kernel’s trajectory becomes deterministic up to a variance term scaling with σ as O ( σ ) , which implies that the final predictor also has a variance scaling as O ( σ ) .
S IGNAL PLUS NOISE CORRELATED FEATURE MODEL
In Section 3.2 we have shown that in both the rich and lazy regimes, the generalization error of the
NN is well approximated by the generalization of a kernel regression solution with eNTK f .
This finding motivates an analysis of the generalization of kernel machines which depend on network initialization θ 0 .
Unlike many analyses of random feature models which specialize to two layer networks and focus on high dimensional Gaussian random data (Mei & Montanari, 2022; Adlam & Pennington, 2020a; Gerace et al., 2020; Ba et al., 2022), we propose to analyze regression with the eNTK f for more general feature structures.
This work builds on the kernel generalization theory for kernels developed with statistical mechanics (Bordelon et al., 2020; Canatar et al., 2021;
Simon et al., 2021; Loureiro et al., 2021).
We will attempt to derive approximate learning curves in terms of the eNTK f ’s signal and noise components, which provide some phenomenological explanations of the onset of the variance limited regime and the benefits of feature learning.
Starting with the final NTK K θ 0 ( x , x ′ ) which depends on the random initial parameters θ 0 , we project its square root
K 1 / 2 θ 0 ( x , x ′ )
(as defined in equation 32) on a fixed basis { b k ( x ) } ∞ k =1 orthonormal with respect to p ( x ) .
This defines a feature map
[Equation]
The kernel can be reconstructed from these features K θ
( x , x ′ )
= (cid:80) k
ψ k ( x , θ 0 ) ψ k ( x ′ , θ 0 ) .
The kernel interpolation problem can be solved by performing linear regression with features ψ ( x , θ 0 ) .
Here, w ( θ 0 ) =
lim λ → 0 argmin w (cid:80)
Pµ =1 [ w · ψ ( x µ , θ 0 ) − y µ ]
+ λ | w | 2 .
The learned function f ( x , θ 0 ) =
w ( θ 0 ) · ψ ( x , θ 0 ) is the minimum norm interpolator for the kernel K ( x , x ′ ; θ 0 ) and matches the neural network learning curve as seen in Section 3.2.
In general, since the rank of K is finite for a finite size network, the ψ k ( x , θ 0 ) have correlation matrix of finite rank N H .
Since the target function y does not depend on the initialization θ 0 , we decompose it in terms of a fixed set of features ψ M ( x ) ∈ R M (for example, the first M basis functions { b k } Mk =1 ).
In this random feature model, one can interpret the initialization-dependent fluctuations in K ( x , x ′ ; θ 0 ) as generating fluctuations in the features ψ ( x , θ 0 ) which induce fluctuations in the learned network predictor f ( x , θ 0 ) .
To illustrate the relative improvements to generalization from denoising these three different objects, in Figure 5, we compare averaging the final kernel K , averaging the induced features ψ , and averaging network predictions f directly.
For all α , all ensembling methods provide improvements over training a single NN.
However, we find that averaging the kernel directly and performing regression with this kernel exhibits the largest reduction in generalization error.
Averaging features performs comparably.
However, ensemble averaging network predictors does not perform as well as either of these other two methods.
The gap between ensembling methods is more significant in the lazy regime (large α ) and is negligible in the rich regime (small α ).
4. T OY M ODELS AND A PPROXIMATE L EARNING C URVES
To gain insight into the role of feature noise, we characterize the test error associated with a Gaussian covariate model in a high dimensional limit P, M, N H → ∞ with α = P/M, η = N H /M .
[Equation]
This model was also studied by Loureiro et al.
and subsumes the classic two layer random feature models of prior works (Hu & Lu, 2020; Adlam & Pennington, 2020a; Mei & Montanari, 2022).
The expected generalization error for any distribution of A ( θ 0 ) has the form[-E θ 
 E g ( θ 0 ) = E A-]
[Equation]
where α = P/M and γ =
α ( λ + q )
Tr G 2 [ A Σ M A ⊤ + Σ ϵ ] 2 .
Details of the calculation can be found in
Appendix D. We also provide experiments showing the predictive accuracy of the theory in Figure 6.
In general, we do not know the induced distribution of A ( θ 0 ) over disorder θ 0 .
In Appendix D.5, we compute explicit learning curves for a simple toy model where A ( θ 0 ) ′
s entries as i.i.d.
Gaussian over the random initialization θ 0 .
A similar random feature model was recently analyzed with diagrammatic techniques by Maloney et al.
In the high dimensional limit M, P, N H → ∞ with P/M = α, N H /M
=
η , our replica calculation demonstrates that test error is self-averaging (the same for every random instance of A ) which we describe in Appendix D.5 and Figure 16.
4. E XPLAINING F EATURE L EARNING B ENEFITS AND E RROR P LATEAUS
Using this theory, we can attempt to explain some of the observed phenomena associated with the onset of the variance limited regime.
First, we note that the kernels exhibit fluctuations over initialization with variance O (1 /N ) , either in the lazy or rich regime.
In Figure 6 (a), we show learning curves for networks of different widths in the lazy regime.
Small width networks enter the variance limited regime earlier and have higher error.
Similarly, if we alter the scale of the noise Σ
ϵ
= σ 2 ϵ Σ M in our toy model, the corresponding transition time P 1 / 2 is smaller and the asymptotic error is higher.
In Figure 6 (c), we show that our theory also predicts the onset of the variance limited regime at P 1 / 2 ∼ √ N if σ 2 ϵ ∼ N − 1 .
We stress that this scaling is a consequence of the structure of the task.
Since the target function is an eigenfunction of the kernel, the infinite width error goes as 1 /P
(Bordelon et al., 2020).
Since variance scales as 1 /N , bias and variance become comparable at P ∼ √ N .
Often, realistic tasks exhibit power law decays where E N = ∞ g
[Equation]
(Spigler et al., 2020; Bahri et al., 2021), where we’d expect a transition around P 1 / 2 ∼ N 1 /β .
Using our model, we can also approximate the role of feature learning as enhancement in the signal correlation along task-relevant eigenfunctions.
In Figure 6 (d) we plot the learning curves for networks trained with different levels of feature learning, controlled by α .
We see that feature learning leads to improvements in the learning curve both before and after onset of variance limits.
In Figure
[Figure]
toy model of noisy features reproduces qualitative dependence of learning curves on kernel fluctuations and feature learning.
(a) The empirical learning curves for networks of varying width N at large α .
(b) Noisy kernel regression learning curve with noise Σ ϵ
= σ 2 ϵ Σ M and A is a projection matrix preserving 20 -k top eigenmodes of Σ M , which was computed from the NTK ∞ for a depth 3 ReLU network.
(c) This toy model reproduces the approximate scaling of the transition sample size P 1 / 2 ∼ N 1 / 2 if σ 2 ϵ ∼ N − 1 .
(d) NNs trained with varying richness
α .
Small α improves the early learning curve and asymptotic behavior.
(e) Theory curves for a kernel with amplified eigenvalue λ k → λ k + ∆ λ k for the target eigenfunction.
This amplification mimics the effect of enhanced kernel alignment in the low α regime.
Large amplification improves generalization performance.
(f) P -dependent alignment where ∆ λ k ∼ √ P gives a better qualitative match to (d).
6 (e)-(f), we plot the theoretical generalization for kernels with enhanced signal eigenvalue for the task eigenfunction y
( x ) =
ϕ k ( x ) .
This enhancement, based on the intuition of kernel alignment, leads to lower bias and lower asymptotic variance.
However, this model does not capture the fact that feature learning advantages are small at small P and that the slopes of the learning curves are different at different α .
Following the observation of Paccolat et al.
(2021a) that kernel alignment can occur with scale √ P , we plot the learning curves for signal enhancements that scale as √ P .
Though this toy model reproduces the onset of the variance limited regime P 1 / 2 and the reduction in variance due to feature learning, our current result is not the complete story.
A more refined future theory could use the structure of neural architecture to constrain the structure of the A distribution.
C ONCLUSION
We performed an extensive empirical study for deep ReLU NNs learning a fairly simple polynomial regression problems.
For sufficiently large dataset size P , all neural networks under-perform the infinite width limit, and we demonstrated that this worse performance is driven by initialization variance.
We show that the onset of the variance limited regime can occur early in the learning curve with P 1 / 2 ∼ √ N , but this can be delayed by enhancing feature learning.
Finally, we studied a simple random-feature model to attempt to explain these effects and qualitatively reproduce the observed behavior, as well as quantitatively reproducing the relevant scaling relationship for P 1 / 2 .
This work takes a step towards understanding scaling laws in regimes where finite-size networks undergo feature learning.
This has implications for how the choice of initialization scale, neural architecture, and number networks in an ensemble can be tuned to achieve optimal performance under a fixed compute and data budget.
A D ETAILS ON E XPERIMENTS
We generated the dataset D = { x µ , y µ } Pµ =1 by sampling x µ uniformly on S D − 1 , the unit sphere in R D .
˜
y was then generated as a Gegenbauer polynomial of degree k of a 1D projection of x , ˜ y
= Q k ( β · x ) .
Because the scale of the output of the neural network relative to the target is a central quantity in this work, it is especially important to make sure the target is appropriately scaled to unit norm.
We did this by defining the target to be y =
˜ y/ (cid:112) ⟨ Q k ( β · x ) 2 ⟩ x ∼ S D − 1 .
The denominator can be easily and accurately approximated by Monte Carlo sampling.
We used JAX (Bradbury et al., 2018) for all neural network training.
We built multi-layer perceptrons (MLPs) of depth 2 and 3.
Most of the results are reported for depth 3 perceptrons, where there is a separation between the width of the network N and the number of parameters N 2 .
Sweeping over more depths and architectures is possible, but because of the extensive dimensionality of the hyperparameter search space, we have not yet experimented with deeper networks.
We considered MLPs with no bias terms.
Since the Gegenbauer polynomials are mean zero, we do not need biases to fit the training set and generalize well.
We have also verified that adding trainable biases does not change the final results in any substantial way.
As mentioned in the main text, we consider the final output function to be the initial network output minus the output at initialization:
[Equation]
Here, only θ is differentiated through, while θ 0 is held fixed.
The rationale for this choice is that without this subtraction, in the lazy limit the trained neural network output can be written as
[Equation]
This is the same as doing eNTK 0 regression on the shifted targets y µ − ˜ f
θ 0 ( x ) .
At large initialization the shift ˜ f θ 0 ( x ) amounts to adding random, initialization-dependent noise to the targets.
By instead performing the subtraction, the lazy limit can be interpreted as a kernel regression on the targets themselves, which is preferable.
We trained this network with full batch gradient descent with a learning rate η so that
[Equation]
Each network was trained to an interpolation threshold of 10 − 6 .
If a network could not reach this threshold in under 30k steps, we checked if the training error was less than 10 times the generalization error.
If this was not satisfied, then that run of the network was discarded.
For each fixed P, k , we generated 20 independent datasets.
For each fixed N, α we generatedindependent neural network initializations.
This 20 × 20 table yields a total of 400 neural networks trained on every combination of initialization and dataset choice.
The infinite width network predictions were calculated using the Neural Tangents package (Novak et al., 2020).
The finite width eNTK 0 s were also calculated using the empirical methods in Neural
Tangents.
They were trained to interpolation using the gradient descent mse method.
This is substantially faster than training the linearized model using standard full-batch gradient descent, which we have found to take a very long time for most networks.
We use the same strategy for the eNTK f s.
For the experiments in the main text, we have taken the input dimension to be D = 10 and sweep over k = 1 , 2 , 3 , 4 .
We swept over 15 values P in logspace from size 30 to size 10k, and over 6 values of N in logspace from size 30 to size 2150 .
We then swept over alpha values 0 .
Depending on α, N , we tuned the learning rate η of the network small enough to stay close to the gradient flow limit, but allow for the interpolation threshold to be feasibly reached.
For each of the 1800 settings of P, N, α, k and each of the 400 networks, 400 eNTK 0 s, 400 eNTK f s, and 20 NTK ∞ s, the generalization error was saved, as well as a vector of ˆ y predictions on a test set of 2000 points.
In addition, for the neural networks we saved both initial and final parameters.
All are saved as lists of numpy arrays in a directory of about 1TB.
We plan to make the results of our experiments publicly accessible, alongside the code to generate them.
A. CIFAR E XPERIMENTS
We apply the same methodology of centering the network and allowing α to control the degree of laziness by redefining
[Equation]
We consider the task of binary classification for CIFAR-10.
In order to allow P to become large we divide the data into two classes: animate and inanimate objects.
We choose to subsample eight classes and superclass them into two: (cat, deer, dog, horse) vs (airplane, automobile, ship, truck).
Each superclass consists of 20,000 training examples and 4,000 test examples retrieved from the CIFAR-10 dataset. On subsets of this dataset, we train wide residual networks (ResNets) Zagoruyko & Komodakis (2017) of width 64 and block size 1 with the NTK parameterization Jacot et al. (2018) on this task using mini-batch gradient descent with batch size of 256 and MSE loss.
Step sizes are governed by the Adam optimizer Kingma & Ba (2014) with initial learning rate η 0 = 10 − 3 .
Every network is trained for 24,000 steps, such that under nearly all settings of α and dataset size the network has attained infinitesimal train loss.
We sweep α from 10 − 3 to 10 0 and P from 2 9 to 2 15 .
For each value of P , we randomly sample five training datasets of size P and compute ensembles of size 20. For each network in an ensemble the initialization and the order of the training data is randomly chosen independently of those for the other networks.
B F INE - GRAINED BIAS - VARIANCE DECOMPOSITION B. F INE G RAINED D ECOMPOSITION OF G ENERALIZATION E RROR
Let D be a dataset of ( x µ , y µ )
Pµ =1 ∼ p ( x , y ) viewed as a random variable.
Let θ 0 represent the initial parameters of a neural network, viewed as a random variable.
In the case of no label noise, as in section 2.2.1 of Adlam & Pennington (2020b), we derive the symmetric decomposition of the generalization error in terms of the variance due to initialization and the variance due to the dataset.
We have
[Equation]
Here we have defined
[Equation]
V D and V θ 0 give the components of the variance explained by variance in D , θ 0 respectively.
V D ,θis the remaining part of the variance not explained by either of these two sources.
As in the main text, ¯ f ∗D ( x ) is the ensemble average of the trained predictors over initializations.
E D [ f ∗ θ 0 , D ( x )
| θ 0 ] is commonly referred to as the bagged predictor.
In the next subsection we study these terms empirically.
B. E MPIRICAL S TUDY OF D ATASET V ARIANCE
Using the network simulations, one can show that the bagged predictor does not have substantially lower generalization error in the regimes that we are interested in.
This implies that most of the variance driving higher generalization error is due to variance over initializations.
In figure 7, we make phase plots of the fraction of E g that arises from variance due to initialization, variance over datasets, and total variance for width 1000.
This can be obtained by computing the ensembled predictor, the bagged predictor, and the ensembled-bagged predictor respectively.
3.5 log P 1.
l o g var/ E g ( f ), NN, L=3, k=2, N= 0.
[Table]
[Table] [Table] [Table]
3.5 log P 1.
l o g bagging var/ E g ( f ), NN, L=3, k=2, N= 0.
3.5 log
[Table] [Table]
[Table]
l o g bagging [Figure] / E g ( f ), NN, L=3, k=3, N= [Figure]
(e) Dataset variance k
=2.
3.5 log P 1.
l o g bagging var/ E g ( f ), NN, L=3, k=4, N= 0.
[Figure]
Dataset variance k
[Figure]
[Figure]
P 1.
l o g
[Figure] / E g ( f ), NN, L=3, k=2, N= [Figure] (g) Total variance k =2.
3.5 log P 1.
l o g [Figure] var/ E g ( f ), NN, L=3, k=3, N= 0.
(h)
Total variance k
=2.
3.5 log P 1.
l o g [Figure] / E g ( f ), NN, L=3, k=4, N= 0. [Figure]
Notice that
the
initialization variance dominates
in the
large P large α regime B. R ELATING E NSEMBLED N ETWORK G ENERALIZATION TO I NFINITE W IDTH G ENERALIZATION Making use of the fact that at leading order, the eNTK f (either in the rich or lazy regime) of a trained network has θ 0 -dependent fluctuations with variance 1 /N , one can write the kernel Gram matrices as
[Equation]
Here, δK θ 0 , δk θ 0 are the leading order fluctuations around the infinite width network.
Because of how we have written them, their variance is O (1) with respect to N .
Using perturbation theory (Dyer & Gur-Ari, 2020), one can demonstrate that these leading order terms have mean zero around their infinite-width limit.
The predictor for the eNTK 0 (or for a sufficiently large α neural network) for a training set with target labels y is given by:
[Equation]
This implies (Geiger et al., 2020a): [Equation]
[Equation]
Upon taking the ensemble, because of the mean zero property of the deviations [Equation] we get that
[Equation]
We can now bound the generalization error of the ensemble of networks in terms of the infinite-width generalization:
[Equation]
By equation 18, the second term yields a positive contribution going as O ( N − 2 ) .
The last term can be bounded by Cauchy-Schwarz:
[Equation]
After we enter the variance limited regime by taking P > P 1 / 2 we get E ∞ g ≤ O (1 /N )
so this last term is bounded by N − 3 / 2 .
Consequently, the difference in generalization error between the infinite width NTK and an ensemble of lazy network or eNTK 0 predictors is subleading in 1 /N compared to the generalization gap, which goes as N − 1 .
The same argument can be extended to any predictor that differs from some infinite width limit.
In particular Bordelon & Pehlevan (2022) show that the fluctuations of the eNTK f in any mean field network are asymptotically mean zero with variance
N − 1 .
The above argument then applies to the predictor obtained by ensembling networks that have learned features.
This implies that in the variance limited regime, ensemble averages of feature learning networks have the same generalization as the infinite-width mean field solutions up to a term that decays faster than N − 3 / 2 .
C F EATURE L EARNING C. C ONTROLLING F EATURE L EARNING T HROUGH I NITIALIZATION S CALE
Given the feed-forward network defined in equation 1, one can see that the components of the activations satisfy h ( ℓ ) i
=
O ( σh i ) ( ℓ − 1) and consequently that the output h ( L )=
O ( σ L ) .
Because of the way the network is parameterized, the changes in the output ∂f∂θ also scale as O ( σ L ) .
This implies that the eNTK at any given time scales as
[Equation]
[Equation]
After appropriately rescaling learning rate to η = σ − 2 L we get
[Equation]
Under the assumption that σ L ≪ 1 and y µ = O (1) so that the error term is O (1) we get that the output changes in time as df/dt = O (1) .
On the other hand, using the chain rule one can show that the features change as a product of the gradient update and the features in the prior layer, yielding the scaling
[Equation]
This gives us that the change in the features scales as ( α √ N ) − 1 while the change in the output scales as O (1) .
Thus, for α √ N sufficiently small, the features can move dramatically.
C. O UTPUT R ESCALING WITHOUT R ESCALING W EIGHTS
In the main text, we use the scale σ at every layer to change the scale of the output function.
This relies on the homogeneity of the activation function so that W ℓ → σW ℓ for all ℓ leads to a rescaling f → fσ L .
This would not work for nonhomogenous activations like ϕ ( h ) =
tanh( h ) .
However, following Chizat et al.
; Geiger et al.
(2020a), we note that we can set all weights to be O α (1) and introduce the α only in the definition of the neural network function
[Equation]
We note that all preactivations h ℓ have scale O α (1) for any choice of nonlinearity, but that f = Θ α ( α ) .
Several works have established that the α ∼ 1 √ N allows feature learning even as the network approaches infinite width Mei et al.
; Yang & Hu (2020); Bordelon & Pehlevan (2022).
This is known as the mean field or µ -limit.
C. K ERNEL A LIGNMENT
In this section we comment on our choice of kernel alignment metric
[Equation]
For kernels that are diagonally dominant, such as those encountered in the experiments, this metric is related to another alignment metric
[Equation]
Here | K | F is the Frobenius norm of the Gram matrix of the kernel.
This metric was extensively used in Baratin et al.
The advantage of the first metric over the second is that one can quickly estimate the denominator of A ( K ) via Monte Carlo estimation of ⟨ u ⊤ Ku ⟩ u ∼N (0 , 1 ) .
We use A ( K f ) as a measure of feature learning, as we have found that this more finely captures elements of feature learning than other related metrics.
We list several metrics we tried that did not work.
One option for a representation-learning metric involves measuring the magnitude of the change between the initial and final kernels, K i , K f :
[Equation]
However, this is more sensitive to the raw parameter change than any task-relevant data.
If one instead were to normalize the kernels to be unit norm at the beginning and the end, the modified metric
[Equation]
This metric however remains remarkably flat over the whole range of α, P , as does the centered kernel alignment (CKA) of Cortes et al.
[Equation]
Here C is the centering matrix that subtracts off the mean components of the kernel for a P × P kernel.
This alignment metric has been shown to be useful in comparing neural representations (Kornblith et al., 2019).
For our task, however, because the signal is low-dimensional, only a small set of eigenspaces of the kernel align to this task.
As a result, the CKA, which counts all eigenspaces equally, appears to be too coarse to capture the low-dimensional feature learning that is happening.
On the other hand, we find that A ( K f ) (with K f given by the eNTK f evaluated on a test set) can very finely detect alignment along the task relevant directions.
This produces a clear signal of feature learning at small α and large P as shown in Figure 2c.
A ( K f ) can be related to the centered kernel alignment between the eNTK f and the (mean zero) task kernel yy ⊤ , where y is a vector of draws from the population distribution p ( x , y ) .
C. R ELATIONSHIP B ETWEEN T RAINED N ETWORK AND F INAL K ERNEL
In general, the learned function contains contributions from the instantaneous NTKs at every point in the training.
Concretely, following Atanasov et al.
we have the following formula for the final network predictor f ( x )
[Equation]
where [ k ( x, t )] µ = K ( x, x µ , t ) and [ K ( s )]
µν = K
( x µ , x ν , s ) and [ y ] µ = y µ .
In general there are contributions from earlier kernels k ( x, t ) for t < ∞ and so the function f cannot always be written as a linear combination of the final NTK K f on training data:
f = (cid:80) µ α µ K f ( x, x µ ) .
However, as
Vyas et al.
; Atanasov et al.
(2021) have shown, the final predictions of the network are often well modeled by regression with the final NTK.
We verify this for our task in section 3.2.
D G ENERIC R ANDOM F EATURE M ODEL D. S ETTING UP THE P ROBLEM : F EATURE D EFINITIONS
For a random kernel, K ( x , x ′ ; θ ) , we first compute its Mercer decomposition
[Equation]
From the eigenvalues λ k and eigenfunctions ϕ k , we can construct the square root
[Equation]
[Equation]
Lastly, using K 1 / 2 , we can get a feature map by projecting against a static basis { b k } giving
[Equation]
These features reproduce the kernel so that K ( x , x ′ ; θ ) = (cid:80)
k ψ k ( x ) ψ k ( x ′ ) .
This can be observed from the following observation
[Equation]
34) ⇒ (cid:88)
[Equation]
[Equation]
where the last line follows from the orthogonality of U km and recovers K ( x , x ′ ; θ ) .
D. D ECOMPOSITION OF F INITE W IDTH F EATURES
We now attempt to characterize the variance in the features over the sample distribution.
We will first consider the case of a fixed realization of θ 0 before providing a typical case analysis over random θ 0 .
For a fixed initialization θ 0 we define the following covariance matrices
[Equation]
[Equation] where ψ M are the truncated (but deterministic) features induced by the deterministic infinite width kernel.
We will mainly be interested in the case where M → ∞ and where the target function can be expressed as the linear combination y ( x )
=
w ∗ · ψ M ( x ) of these features.
For example, in the case of our experiments on the sphere, ψ M could be the spherical harmonic functions.
Further, in the M → ∞ limit, we will be able to express the target features ψ as linear combinations of the features ψ M
[Equation]
The matrix A ( θ 0 ) are the coefficients of the decomposition which can vary over initializations.
Crucially A ( θ 0 ) projects to the subspace of dimension N H where the finite width features have variance over x .
The population risk for this θ 0 has an irreducible component
[Equation]
38) where the bound is tight for the optimal weights w = (cid:0)
A ( θ 0 ) Σ M A ( θ 0 ) ⊤ (cid:1) − 1 A
( θ 0 )
Σ M w ∗ .
The irreducible error is determined by a projection matrix which preserves the subspace where the features ψ ( x , θ 0 )
have variance: I − A ( θ ) ⊤ (cid:0)
A ( θ 0 )
Σ M A ( θ 0 ) ⊤ (cid:1) − 1 A
( θ 0 ) Σ M .
In general, this will preserve some fraction of the variance in the target function, but some variance in the target function will not be expressible by linear combinations of the features ψ ( x , θ ) .
We expect that random finite width N neural networks will have unexplained variance in the target function on the order ∼ 1 /N .
D. G AUSSIAN C OVARIATE M ODEL
Following prior works on learning curves for kernel regression (Bordelon et al., 2020; Canatar et al., 2021; Loureiro et al., 2021), we will approximate the learning problem with a Gaussian covariates model with matching second moments.
The features ψ M ( x ) will be treated as Gaussian over random draws of datapoints.
We will assume centered features.
We decompose the features in the orthonormal basis b ( x ) , which we approximate as a Gaussian vector b ∼ N (0 , I ) .
[Equation]
[Equation]
This is a special case of the Gaussian covariate model introduced by Loureiro et al.
and subsumes the popular two-layer random feature models (Mei & Montanari, 2022; Adlam & Pennington, 2020b) as a special case.
In a subsequent section, we go beyond Loureiro et al.
(2021) by computing typical case learning curves over Gaussian A ( θ 0 ) matrices.
In particular, we have for the two layer random feature model in the proportional asymptotic limit P, N, D → ∞ with P/D
= O (1) and P/N =
O (1) with ψ ( x ) =
ϕ
( F x µ ) for fixed feature matrix F ∈ R N × D nonlinearity ϕ and x = b ∼ N (0 , D
[Equation]
I
[Equation]
We refer readers to Hu & Lu (2020) for a discussion of this equivalence between random feature regression and this Gaussian covariate model.
D. R EPLICA C ALCULATION OF THE L EARNING C URVE
To analyze the typical case performance of kernel regression
[Equation]
we define the following partition function which is dominated
[Equation]
[Equation]
For proper normalization, we assume that (cid:10) ψ M ψ ⊤ M (cid:11)
= 1 M Σ M and (cid:10) ϵϵ ⊤ (cid:11) =
1 M Σ ϵ .
We note that in the β → ∞ limit, the partition function is dominated by the unique minimizer of the regularized least squares objective (Canatar et al., 2021; Loureiro et al., 2021).
Further, for a fixed realization of θ
the average generalization error over datasets D can be computed by differentiation of the source term J
[Equation]
Thus the β → ∞ limit of the above quantity will give the expected generalization error of the risk minimizer.
We see the need to average the quantity ln Z over realizations of datasets D .
For this, we resort to the replica trick ⟨ ln Z ⟩ = lim n → 0 1 n ln ⟨ Z n ⟩ .
We will compute the integer moments ⟨ Z n ⟩ for integer n and then analytically continue the resulting expressions to n → 0 under a symmetry ansatz.
The replicated partition function thus has the form
[Equation]
We now need to perform the necessary average over the random realizations of data points D = { b µ , ϵ µ } .
We note that the scalar quantities h aµ =
w a · ψ µ − w ∗ · ψ M,µ are Gaussian with mean zero and covariance
[Equation]
[Equation]
We further see that the generalization error in replica a is E g ( w a )
=
Q aa .
Performing the Gaussian integral over { h aµ } gives
[Equation]
We introduced the Lagrange multipliers ˆ Q which enforce the definition of order parameters Q .
We now integrate over W =
Vec { w a } na =1 .
We let ˜Σ s =
A ⊤ Σ M A
[Equation]
To take the n → 0 limit
[Equation]
we make the replica symmetry ansatz
[Equation]
which is well motivated since this is a convex optimization problem.
Letting α = P/N , we find that under the RS ansatz the replicated partition function has the form
[Equation]
In a limit where α = P/M is O (1)
[Equation]
then this S is intensive S
= O M (1) .
We can thus appeal to saddle point integration (method of steepest descent) to compute the set of order parameters which have dominant contribution to the free energy.
[Equation]
⇒
[Equation]
The order parameters q ∗ , q ∗ 0 , ˆ q ∗ , ˆ q ∗ 0 are defined via the saddle point equations ∂S∂q
= ∂S∂q
=
∂S∂ ˆ q
=
∂S∂ ˆ q
=
For our purposes, it suffices to analyze two of these equations
[Equation]
We can now take the zero temperature ( β → ∞ ) limit to solve for the generalization error
[Equation]
We see that we need to compute the J derivatives on ˆ q .
We let κ = λ + q and note
[Equation]
We solve the equation for ∂ J κ which gives ∂ J κ = − κ 2 α γ 1 − γ where γ = ακ 2 1 M Tr G 2 (cid:104) ˜Σ
s + Σ ϵ (cid:105) 2 .
With this definition we have ∂ J ˆ q = 1 + γ 1 − γ = 11 − γ .
[Equation]
This reproduces the derived expression from Loureiro et al.
The matching covariance ˜ Σ s = Σ M and zero feature-noise limit Σ
ϵ =
recovers the prior results of Bordelon et al.
Canatar et al.
; Simon et al.
In general, this error will asymptote to the the irreducible error
[Equation]
We see that this recovers the minimal possible error in the P → ∞ limit.
The derived learning curves depend on the instance of random initial condition θ 0 .
To get the average case performance, we take an additional average of this expression over θ
[Equation]
This average is complicated since γ, ˆ q, G all depend on θ 0 .
In the next section we go beyond this analysis to try average case analysis for random Gaussian A .
D. Q UENCHED A VERAGE OVER G AUSSIAN A
In this section we will define a distribution of features which allows an exact asymptotic prediction over random realizations of disorder θ 0 and datasets D .
This is a nontrivial extension of the result of Loureiro et al.
(2021) since the number of necessary saddle point equations to be solved doubles from two to four.
However, this more complicated theory allows us to exactly compute the expectation in equation 55 under an ansatz for the random matrix A .
We construct our features with
[Equation]
We will now perform an approximate average over both datasets D and realizations of A
[Equation]
As before, we first average over b µ , ϵ µ | A and define order parameters Q ab as before.
[Equation]
where we defined the fields g a = 1 √ N Aw a which are mean zero Gaussian with covariance (cid:10)
g a g b ⊤ (cid:11) =
V ab I where V ab =
σ 2 N w a · w b .
Performing the Gaussian integral over G
=
Vec { g a } , we find
[Equation]
[Equation]
Next, we need to integrate over W =
Vec { w a } which gives
[Equation]
Now the replicated partition function has the form
[Equation]
Now we make a replica symmetry ansatz on the order parameters Q , ˆ Q , V , ˆ V
[Equation]
We introduce the shorthand for normalized trace of a matrix G as tr G = 1 M Tr G .
Under the replica symmetry ansatz, we find the following free energy
[Equation]
Letting F = 2 M − 1 ⟨ ln Z ⟩
[Equation]
the saddle point equations read
[Equation]
Now the generalization error can be determined from
[Equation]
We see that it is necessary to compute ∂ J ˆ q and ∂ J v in order to obtain the final result.
For simplicity
[Equation]
we set σ 2 = 1 .
The equations for the source derivatives are
[Equation]
Once the value of the order parameters ( q, ˆ q, v, ˆ v ) have been determined, these source derivatives can be obtained by solving a 4 × 4 linear system.
Examples of these solutions are provided in Figure 16.
D.5. A SYMPTOTICS IN U NDERPARAMETERIZED R EGIME
We can compute the asymptotic ( α → ∞ ) generalization error due to the random projection A in the limit of Σ ϵ = 0 .
First, note that if ˆ v → O α (1) , then the asymptotic error would be zero.
Therefore, we will assume that ˆ v ∼ aα c for some a, c > 0 .
The saddle point equations give the following asymptotic conditions
[Equation]
For 0 < η <
[Equation]
this equation can only be satisfied as α → ∞ if c =
so that ˆ v has the same scaling with α as ˆ q .
If c < 1 then we could get the equation η = 1 .
If c >
[Equation]
then the equation would give η = 0 .
The constant a solves the equation
[Equation]
Using this fact
[Equation]
our order parameters satisfy the following large α scalings
[Equation]
The source derivative equations simplify to ∂ J ˆ q ∼ 1 , ∂ J q ∼ 0 and η∂
[Equation]
[Equation]
We note that ∂ J ˆ v only depends on the product aλ which is an implicit function of η and Σ M .
The generalization error is E g = [Equation] M
[Equation]
We see that in the generic case, the asymptotic error has a nontrivial dependence on the task w ∗ and the correlation structure Σ M .
To gain more intuition, we will now consider the special case of isotropic features Σ M = I .
In this case, we have η = 1 1+ λa
so that λa = 1 − ηη .
This results in the following generalization error
[Equation]
We see that as η = N H M → 1 , the asymptotic error converges to zero since all information in the original features is preserved.
D.5. S IMPLIFIED I SOTROPIC F EATURE N OISE
We can simplify the above expressions somewhat in the case where σ 2 = 1 and Σ ϵ
= σ 2 ϵ I .
In this case, the order parameters become
[Equation]
Letting G =
[(1 + ˆ v + σ 2 ϵ ˆ q ) I + ˆ q Σ M ] − 1 , the source derivatives have the form
[Equation]
This is a 2 × 2 linear system
[Equation]
For each α
[Equation]
we can solve for ∂ J ˆ q and ∂ J ˆ v to get the final generalization error with the formula
E
[Equation]
= [Equation] An example of these solutions can be found in Figure 16, where we show good agreement between theory and experiment.
E R ES N ET ON CIFAR E XPERIMENTS
[Figure]
same trend: richer networks perform better and ensembling lazy networks helps them more. c) Once P is large enough, lazier networks tend to benefit more from ensembling. d) Very lazy networks transition to variance limited behavior earlier.
For ResNets on this task, we see that rich, feature learning networks eventually begin reducing their variance on this task.
Further details of the experiment are given in section A.1.
F A DDITIONAL E XPERIMENTS
3.5 log P 1.
l o g
E g eNTK 0 , L=3, k=2, N= 3.
[Table]
[Table]
[Table] [Table] [Table] log P
[Table]
l o g
E g eNTK [Table] , L= [Table]
[Table]
=
[Table] [Table] [Table] [Table]
[Table]
[Table]
[Table]
[Table]
[Table]
log P [Table] [Table] [Table]
l o g
[Table]
eNTK [Table] [Table] [Table]
[Table]
[Table] [Table]
3.5 log P 1.
l o g
E g NN, L=3, k=2, N= 3.
3.5 log P 1.
l o g
E g NN
[Table]
L=
[Table] k= [Table] N= 3.
3.5 log P 1.
l o g
E g NN, L=3, k=4, N= 2.
(f) E g for NN k =
[Figure]
[Figure] [Figure]
variance taken over 10 initializations and averaged 10 different datasets.
[Figure]
∞ s. As before, ensembled lazy networks approach NTK ∞ and the variance rises with P .
[Figure]
[Figure] [Figure] [Figure]
P =eNTK
eNTK f
P =
P =  
[-P =  
 P =  
-]
P =
P
[Table]
[Table]
[Table]
P
[Table]
[Table]
[Table] [Table]
[Table]
e N T K p
r e d i c t
o r s (a) k = 3 , N = 177 , α = 0 .
[Table]
[Table]
[Table]
[Table]
(b) k
= 3 , N = 177 , α =
[Table]
[Table]
[Figure]
[Table]
[Figure]
[Table]
P
[Figure]
P =  
 {+P =  
 P =  
 P =  
+}
P
[Figure]
P
[Figure]
[Figure]
N T K p r
e d i c t o r
[Figure]
P
[Figure] [Figure]
[Figure]
{+f  
+}
P [Figure] {+P =  
+}
P
[Figure]
P
[Figure]
P
[Figure]
P
[Figure]
P
[Figure]
P
[Figure] [Table]
N
[Table]
i
[Table]
(a) k
=
[Table]
N =
[Table]
α
[Table]
[Table] [Figure] [Table]
[Figure] [Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure]
K
[Figure]
r
[Figure]
d i c t o
[Figure]