D EEP LEARNING GENERALIZES BECAUSE THE PARAMETER - FUNCTION MAP IS BIASED TOWARDS SIMPLE FUNCTIONS
Anonymous authors
A BSTRACT
Deep neural networks (DNNs) generalize remarkably well without explicit regularization even in the strongly over-parametrized regime where classical learning theory would instead predict that they would severely overﬁt.
While many proposals for some kind of implicit regularization have been made to rationalise this success, there is no consensus for the fundamental reason why DNNs do not strongly overﬁt.
In this paper, we provide new arguments, motivated by concepts from algorithmic information theory (AIT), to argue that the parameter-function map of DNNs should be exponentially biased towards simple functions. As the target functions in many real problems are expected to be highly structured, this intrinsic simplicity bias helps explain why deep networks generalize well on real world problems, but badly on randomized data.
This picture also facilitates a novel
PAC-Bayes approach where the prior is taken over the DNN input-output function space, rather than the more conventional prior over parameter space. If we assume that the training algorithm samples parameters close to uniformly within the zeroerror region then the PAC-Bayes theorem can be used to guarantee good expected generalization for target functions producing high-likelihood training sets.
By exploiting recently discovered connections between DNNs and Gaussian processes to estimate the marginal likelihood, we produce non-vacuous (< 1) generalization PAC-Bayes error bounds which correlate well with the true error on realistic datasets such as MNIST and CIFAR and for architectures including convolutional and fully connected networks.
I NTRODUCTION
Deep learning is a machine learning paradigm based on very large, expressive and composable models, which most often require similarly large data sets to train.
The name comes from the main component in the models: deep neural networks (DNNs) with many layers of representation.
These models have been remarkably successful in domains ranging from image recognition and synthesis, to natural language processing, and reinforcement learning (Mnih et al.
; LeCun et al.
Radford et al.
(2016); Schmidhuber (2015)).
There has been work on understanding the expressive power of certain classes of deep networks (Poggio et al.
(2017)), their learning dynamics (Advani & Saxe (2017); Liao & Poggio (2017)), and generalization properties (Kawaguchi et al.
; Poggio et al.
However, a full theoretical understanding of many of these properties is still lacking.
DNNs are typically overparametrized, with many more parameters than training examples.
Classical learning theory suggests that overparamterized models lead to overﬁtting, and so poorer generalization performance. By contrast, for deep learning there is good evidence that increasing the number of parameters leads to improved generalization (see e.g. Neyshabur et al. For a typical supervised learning scenario, classical learning theory provides bounds on the generalization error (cid:15) ( f ) for target function f that typically scale as:
[Equation]
where (cid:15) T ( f ) is the training error, m is the number of i.d.d.
samples in the training set, α is typically between 12 and 1 , and C ( H ) is a measure of the complexity of the hypothesis class H .
Complexity measures include simply the number of functions in H , the VC dimension, and the Rademacher complexity (Shalev-Shwartz & Ben-David (2014)). Since neural networks are highly expressive, typical measures of C ( H ) will be extremely large, leading to trivial results when applied to bounds of the form of eq. 1. Many empirical schemes such as dropout (Srivastava et al.
, weight decay [cite] early stopping (Morgan & Bourlard (1990)), have been proposed as sources of regularization that effectively lower C ( H ) .
However, in an important recent paper (Zhang et al. (2017a)), it was explicitly demonstrated that these regularization methods are not necessary to obtain good generalization.
Moreover, by randomly labelling images in the well known CIFAR10 data set (Krizhevsky & Hinton (2009)), these authors showed that DNNs are sufﬁciently expressive to memorize a data set in not much more time than it takes to train on uncorrupted CIFAR10 data. By showing that it is relatively easy to train DNNs to ﬁnd functions f that do not generalize at all, this work sharpened the question as to why DNNs generalize so well when presented with uncorrupted training data.
This study stimulated much recent work, see e.g. (Kawaguchi et al.
; Arora et al.
; Morcos et al.
Neyshabur et al.
(2017b)
; Dziugaite & Roy (2017; 2018); Neyshabur et al. (2017a; 2018)), but there is no consensus as to why DNNs generalize so well.
Because DNNs have so many parameters, minimizing the loss function L to ﬁnd a minimal training set error is a challenging numerical problem. The most popular methods for performing such optimization rely on some version of stochastic gradient descent (SGD). In addition, many authors have also argued that SGD may exploit certain features of the loss-function to ﬁnd solutions that generalize particularly well (Soudry et al. ; Zhang et al.
(2017b; 2018))
However, while SGD is typically superior to other standard minimization methods in terms of optimization performance, there is no consensus in the ﬁeld on how much of the remarkable generalization performance of DNNs is linked to SGD (Krueger et al. In fact DNNs generalize well when other optimization methods are used (from variants of SGD, like Adam (Kingma & Ba (2014)), to gradient-free methods (Such et al. For example, in recent papers (Wu et al.
; Zhang et al.
Keskar et al.
(2016) simple gradient descent (GD) was shown to lead to differences in generalization with SGD of at most a few percent.
Of course in practical applications such small improvements in generalization performance can be important. However, the question we want to address in this paper is the broader one of Why do DNNs generalize at all, given that they are so highly expressive and overparameterized? . While SGD is important for optimization, and may aid generalization, it does not appear to be the fundamental source of generalization in DNNs. Another longstanding family of arguments has focused on the local curvature of a stationary point of the loss function, typically quantiﬁed in terms of products of eigenvalues of the local Hessian matrix.
Flatter stationary points (often simply called minima) are associated with better generalization performance(Hochreiter & Schmidhuber (1997); Hinton & van Camp (1993)).
Part of the intuition is that ﬂatter minima are associated with simpler functions (Hochreiter & Schmidhuber (1997); Wu et al.
(2017)), which should generalize better.
Recent work (Dinh et al.
(2017)) has pointed out that ﬂat minima can be transformed to sharp minima under suitable re-scaling of parameters, so care must be taken in how ﬂatness is deﬁned.
In an important recent paper (Wu et al.
the authors used an attack data set to vary the generalization performance of a standard DNN from a few percent error to nearly 100% error, and demonstrated that this performance correlates closely with a robust measure of the ﬂatness of the minima (see also Zhang et al.
(2018) for a similar correlation over a much smaller range, but with evidence that SGD leads to slightly ﬂatter minima than simple GD does).
The authors also conjectured that this large difference in local ﬂatness would be reﬂected in large differences between the volume V good of the basin of attraction for solutions that generalize well and V bad for solutions that generalize badly.
If these volumes differ sufﬁciently, then this may explain why SGD and other methods such as GD converge to good solutions; these are simply much easier to ﬁnd than bad ones.
Although this line of argument provides a tantalizing suggestion for why DNNs generalize well in spite of being heavily overparameterized, it still begs the fundamental question of Why do solutions vary so much in ﬂatness or associated properties such as basin volume?
In this paper we build on recent applications of algorithmic information theory (AIT)(Dingle et al.
to suggest that the large observed differences in ﬂatness observed by (Wu et al.
(2017)) can be correlated with measures of descriptional complexity.
We then apply a connection between Gaussian processes and DNNS to empirically demonstrate for several different standard architectures that the probability of obtaining a function f in DNNs upon a random choice of parameters varies over many orders of magnitude.
This bias allows us to apply a classical result from PAC-Bayes theory to help explain why DNNs generalize so well.
1. M AIN CONTRIBUTIONS
Our main contributions are:
• We argue that the parameter-function map provides a fruitful lens through which to analyze the generalization performance of DNNs. • We apply recent arguments from AIT to show that, if the parameter-function map is highly biased, then high probability functions will have low descriptional complexity. • We show empirically that the parameter-funtion map of DNNs is extremely biased towards simple functions, and therefore the prior over functions is expected to be extremely biased too.
We claim that this intrinsic bias towards simpler functions is the fundamental source of regularization that allows DNNs to generalize.
• We approximate the prior over functions using Gaussian processes, and present evidence that Gaussian processes reproduce DNN marginal likelihoods remarkably well even for ﬁnite width networks.
• Using the Gaussian process approximation of the prior over functions, we compute PACBayes expected generalization error bounds for a variety of common DNN architectures and datasets.
We show that this shift from the more commonly used priors over parameters to one over functions allows us to obtain nonvacuous (less than 1) bounds, which follow the behaviour of the real generalization error.
T HE PARAMETER - FUNCTION MAP
The parameter-function map refers to the map from parameters to input-output functions, for a parametrized supervised learning model. Let the input space be X and the output space be Y . The space of functions that our model can express is then F ⊆ Y |X| . We consider models with p real valued parameters, taking values within a set Θ ⊆ R p .
The parameter-function map , M , is then
M : Θ → F θ (cid:55)→ f θ where f θ is the function implemented by the model with choice of parameter vector θ . This map is of interest when using an algorithm that searches in parameter space, such as stochastic gradient descent, as it determines how the behaviour of the algorithm in parameter space maps to its behavior in function space. The latter is what determines properties of interest like generalization.  A LGORITHMIC INFORMATION THEORY AND SIMPLICTY - BIAS IN THE PARAMETER - FUNCTION MAP
One of the main sources of inspiration for our current work comes from a recent paper (Dingle et al.
(2018)) which derives an upper bound for the probability P ( x ) that an output x ∈ O of an input-output map g : I → O obtains upon random sampling of inputs
I
[Equation]
where ˜ K is an approximation to the (uncomputable) Kolmogorov complexity of x , and a and b are scalar parameters which depend on the map g
but not on x .
This bound can be derived for maps g that satisfy a simplicity criterion K ( g )
+ K ( n ) (cid:28) K ( x ) + O (1) , where n is a measure of the size of the inputs space (e.g. if | I | = 2 n ).
A few other conditions also need to be fulﬁlled in order for equation (2) to hold, including that there is redundancy in the map, e.g. that multiple inputs map to the same output x so that P ( x ) can vary (for more details see Appendix E)). Statistical lower bounds can also be derived for P ( x ) which show that, if there is bias, then most x found will typically be close to the upper bound (on a log scale). If there is a signiﬁcant linear variation in K ( x ) , then the bound (2) will vary over many orders of magnintude. While the arguments in (Dingle et al.
(2018)) do not prove when maps will show bias, it was demonstrated that the bound of (2) worked remarkably well for maps ranging from the RNA sequence to secondary structure map a map for option pricing in ﬁnancial mathematics.
The fact that such a wide range of maps all showed the same features, suggests that many other physical maps may exhibit this phenomenon of simplicity bias.
It is not hard to see that the parameter-function map M is is simple in the sense that for described above, and also fulﬁlls the other necessary conditions for simplicity bias (Appendix E).
We therefore proceed to explicitly test a model DNN to see if it indeed exhibits the expected simplicity bias phenomena of (Dingle et al.
In order to explore the properties of the parameter-function map, we consider random neural networks .
We put a probability distribution over the space of parameters Θ , and are interested in the distribution over functions induced by this distribution via the parameter-function map of a given neural network.
To estimate the probability of different functions, we take a large sample of parameters and simply count the number of samples producing individual functions ( empirical frequency ).
This procedure is easiest for a discrete space of functions, and a small enough function space so that the probabilities of obtaining functions more than once is not negligible.
We achieve this by using a neural network with 7 Boolean inputs, two hidden layers of 40 ReLU neurons each, and a single Boolean output. This means that the input space is X = { 0 , 1 } 7 and the space of functions is F ⊆ { 0 , 1 } 2 7 (we checked that this neural network can in fact express almost all functions in { 0 , 1 } 2 7 ).
For the distributions on parameter space we used Gaussian distributions or uniform within a hypercube, with several variances
The resulting probabilities P ( f ) can be seen in Figure 1a, where we plot the (normalized) empirical frequencies versus the rank, which exhibits a range of probabilities spanning as many orders of magnitude as the ﬁnite sample size allows. Note that although this DNN is simple compared to typical DNNs used in practical applications, it still potentially can produce 2 128 different functions, which is a very large number. Thus many functions must have a probability less than the average probability of 2 − 128 ≈ 3 × 10 − 39 , so that the true full range of P ( f ) is at least 39 orders of magnitude) Using different distributions over parameters has a very small effect on the overall curve.
The bound of equation (2) predicts that high probability functions should be of low descriptional complexity. In Figure 11, we show that we indeed ﬁnd this simplicity-bias phenomenon, with all high-probability functions having low Lempel-Ziv (LZ) complexity. The literature on complexity measures is vast. Here we simply note that there is nothing fundamental about LZ.
Other approximate complexity measures that capture essential aspects of Kolmogorov complexity also show similar correlations. In Appendix F.4, we demonstrate that probability also correlates with the size of the smallest Boolean expression expressing that function, as well as with two measures of the sensitivity of the output to changes in the input. In Figure 10, we also compare the different measures. We can see that they all correlate, but also show differences in their ability to recognize regularity.
It is still an open question, which are the complexity functions which better capture real-world regularity. There are many reasons to believe that real-world functions are simple or have some structure (Lin et al. (2017); Schmidhuber (1997)) and will therefore have low descriptional complexity.
Putting this together with the above results means we expect a DNN that exhibits simplicity bias to generalize well for real-world datasets and functions. On the other hand, as can also be seen in Figure 1d, our network does not generalize well for complex (random) functions. By simple counting arguments, the number of high complexity functions is exponentially larger than the number of low complexity functions. Nevertheless, such functions may be less common in real-world applications.
Although here we have only shown that high-probability functions have low complexity for a relatively small DNN, the generality of the AIT arguments from Dingle et al. (2018) suggests that an exponential probability-complexity bias may hold for larger neural networks as well. If so, this phenomenon provides an explanation for why highly overparameterized DNNs generalize so well. [Figure]
PAC-B AYES GENERALIZATION ERROR BOUNDS
Following the failure of worst-case generalization bounds for deep learning, algorithm and datadependent bounds have been recently investigated. The main three approaches have been based on algorithmic stability (Hardt et al. margin theory (Neyshabur et al. ; Keskar et al.
; Neyshabur et al.
(2017b;a); Bartlett et al.
(2017); Golowich et al.
Arora et al.
Neyshabur et al.
(2018)), and PAC-Bayes theory (Dziugaite & Roy (2017; 2018)
; Neyshabur et al.
(2017a;b)).
Our approach to understand generalization is based on PAC-Bayes theory.
We begin by considering a given training set U (generated from some unknown target function), and a given stochastic learning algorithm, which in our experiments will be stochastic gradient descent (SGD).
For simplicity of analysis, we consider binary classiﬁcation.
In this set up, assuming realizability, one can ask about the probability of ﬁnding different functions (also called concepts, in binary classiﬁcation) that ﬁt the training data perfectly (empirical risk minimization).
Of more interest, one can ask about the probability of different generalization errors, or the expected generalization error.
If the probability of ﬁnding a particular concept c , given a training set U , is
[Equation]
, where c ∈ U means all concepts consistent with the training set 2 , then Theorem 1 from the classic work by McAllester (1998) gives a bound on the expected generalization error:
Theorem 1.
(PAC-Bayes theorem (McAllester (1998)))
For any measure P on any concept space and any measure on a space of instances we have, for 0 < δ ≤ 1 , that with probability at least 1 − δ over the choice of sample of m instances all measurable subsets U of the concepts such that every element of U is consistent with the sample and with P ( U ) > 0 satisﬁes the following:
[Equation]
where P ( U ) =
(cid:80) c
∈ U P ( c ) , and where (cid:15) ( U ) :
=
E c ∈ U (cid:15) ( c ) , i.e. the expected value of the generalization errors over concepts c in U with probability given by the posterior P ( c ) P ( U ) .
Here, (cid:15) ( c ) is the generalization error (probability of the concept c disagreeing with the target concept, when sampling inputs).
In order to apply the PAC-Bayes theorem, P ( c ) must be independent of the training set U .
Typically a neural network is trained by a stochastic algorithm such as SGD, which samples parameters.
In order to apply the PAC-Bayes formalism, we thus make the following (informal) assumption:
Stochastic gradient descent samples the zero-error region close to uniformly.
Given some distribution over parameters Q ( θ ) , the distribution over functions P ( c ) is then determined by the parameter-function map as P ( c ) =
Q ( M − 1 ( c )) .
If the parameter distribution is not too far from uniform, then P ( c ) should be heavily biased as in Figure 1a.
In Section 6, we will discuss and show further evidence for the validity of this assumption on the training algorithm.
One way to understand the bias observed in Fig 1a is that the regions of parameter space producing some functions are exponentially larger than those producing other functions.
This is a huge effect which is likely to have a very signiﬁcant effect on which functions SGD ﬁnds.
Thus, even if the parameter distributions used here do not capture the exact behavior of SGD, the bias will probably still play a big role.
Our measured large variation in P ( f ) should correlate with a large variation in the basin volume V that Wu et al.
(2017) used to explain why they obtained similar results using GD and SGD for their
DNNs trained on CIFAR10.
Note also that the region of parameter space with zero-error may be unbounded, so that a uniform distribution is not well deﬁned. We will instead use, unless stated otherwise, a Gaussian distribution with a sufﬁciently large variance 3 .
We discuss further the effect of the choice of variance in
Appendix C.
In order to use the PAC-Bayes approach, we need a method to calculate P ( U ) for large systems, a problem we now turn to.
4. G AUSSIAN PROCESS APPROXIMATION TO THE PRIOR OVER FUNCTIONS
In recent work (Lee et al.
; Matthews et al.
(2018); Garriga-Alonso et al.
; Novak et al. (2018)), it was shown that inﬁnitely-wide neural networks (including convolutional and residual networks) are equivalent to Gaussian processes.
This means that if the parameters are distributed i.i.d.
(for instance with a Gaussian with diagonal covariance), then the (real-valued) outputs of the neural network, corresponding to any ﬁnite set of inputs, are jointly distributed with a Gaussian distribution. More precisely, assume the i.i.d. distribution over parameters is Q with zero mean, then for a set of n inputs ( x 1 , ..., x n ) ,
[Equation] where ˜y = (˜ y 1 , ..., ˜ y n ) .
The entries of the covariance matrix K are given by the kernel function k as K ij = k ( x i , x j ) . The kernel function depends on the choice of architecture, and properties of Q , in particular the weight variance σ 2 w /n (where n is the size of the input to the layer) and the bias variance σ 2 b .
The kernel for fully connected ReLU networks has a well known analytical form known as the arccosine kernel (Cho & Saul (2009)), while for convolutional and residual networks it can be efﬁciently computed 4 .
The main quantity in the PAC-Bayes theorem, P ( U ) , is precisely the probability of a given set of output labels for the set of instances in the training set, also known as marginal likelihood , a connection explored in recent work (Smith & Le (2017);
Germain et al.
For binary classiﬁcation, these labels are binary, and are related to the real-valued outputs of the network via a nonlinear function like a step function 5 , which we denote σ . Then, for a training set U = { ( x 1 , y 1 ) , ..., ( x m , y m ) } , P ( U ) =
P θ ∼ Q ( σ ( f θ ( x 1 ))
=
y 1 , ..., σ ( f θ ( x m )) = y m ) . This distribution no longer has a Gaussian form because of the output nonlinearity σ .
We will discuss how to circumvent this. But ﬁrst, we explore the more fundamental issue of neural networks not being inﬁnitely-wide in practice 6 . To test whether the equation above provides a good approximation for P ( U ) for common neural network architectures, we sampled y (labellings for a particular set of inputs) from a fully connected neural network, and the corresponding Gaussian process, and compared the empirical frequencies of each function.
We can obtain good estimates of P ( U ) in this direct way, for very small sets of inputs (here we use m = 10 random MNIST images).
The results are plotted in Figure ?? , showing that the agreement between the neural network probabilities and the Gaussian probabilities is extremely good, even this far from the inﬁnite width limit (and for input sets of this size).
As we mentioned, for the case of classiﬁcation, there is no analytic formula for P ( U ) and as sampling becomes intractable for larger input set sizes, we need to use other approximations.
In this paper we use the expectation-propagation (EP) approximation, implemented in GPy (since 2012), which is more accurate than the Laplacian approximation (see Rasmussen (2004) for a description and comparison of the algorithms).
To see how good these approximations are, we compared them with the empirical frequencies obtained by directly sampling the neural network.
The results are in
Figure 6 in the Appendix B. We ﬁnd that the both the EP and Laplacian approximations correlate with the the empirical neural network likelihoods.
In larger sets of inputs ( 1000 ), we also found that the relative difference between the log-likelihoods given by the two approximations was less than about 10% . [Figure]
E XPERIMENTAL RESULTS
We tested the expected generalization error bounds described in the previous section in a variety of networks trained on binarized 7 versions of MNIST (LeCun et al.
, fashion-MNIST (Xiao et al.
and CIFAR10 (Krizhevsky & Hinton (2009)).
In particular, we will show we can obtain nonvacuous bounds 8 which are also better than random guessing, and that our bounds predict some of the behaviour of the generalization error as we change the learning task (for instance, by corrupting the data), and as we vary the architecture type.
Zhang et al. (2017a) found that the generalization error increased continuously as the labels in CIFAR10 where randomized with an increasing probability.
In Figure 3, we replicate these results for three datasets, and show that our bounds correctly predict the increase in generalization error.
Furthermore, the bounds show that, for low corruption, MNIST and fashion-MNIST are similarly hard (although fashion-MIST is slightly harder), and CIFAR10 is considerably harder.
This mirrors what is obtained from the true generalization errors.
Also note that the bounds for MNIST and fashion-MNIST with little corruption are signiﬁcantly below 0 .
5 (random guessing).
For experimental details see Appendix A.
In Table 1, we list the mean generalisation error and the bounds for the three datasets (at 0 label corruption), demonstrating that the PAC-Bayes bound closely follows the same trends. MNIST
[Table]
In Figure 4 we show the generalization errors and PAC-Bayes bounds as we vary the size of the training set.
We observe that the bounds show the same relative ordering as the true errors, with
MNIST being lower than fashion-MNIST, which in turn is lower than CIFAR10, in terms of gen- eralization error.
Furthermore, both the real errors and the bounds decrease with training set size.
Note that if P ( U ) did not change, then the error would drop with 1 /m
It drops more slowly because increasing m also decreases P ( U ) because fewer functions are compatible with a larger training set.
SGD VERSUS B AYESIAN SAMPLING
In this section we show results of experiments designed to test the assumption that SGD samples parameters close to uniformly within the zero-error region.
In the literature, Bayesian sampling of the parameters of a neural network has been argued to produce generalization performance similar to the same network trained with SGD.
The evidence is based on comparing SGD-trained network with a Gaussian process approximation (Lee et al.
(2017)), as well as showing that this approximation is similar to Bayesian sampling via MCMC methods (Matthews et al.
We performed experiments showing direct evidence that the probability with which two variants of
SGD ﬁnd functions is close to the probability of obtaining the function by uniform sampling of parameters in the zero-error region.
Due to computational limitations, we consider the neural network from Section 2. We are interested in the probability of ﬁnding individual functions consistent with the training set, by two methods: • Training the neural network with variants of SGD 9 ; in particular, advSGD and Adam (described in Appendix A).
• Bayesian inference using the Gaussian process corresponding to the neural network architecture.
This approximates the behavior of sampling parameters close to uniformly in the zero-error region (i.i.d.
Gaussian prior to be precise).
We estimated the probability of ﬁnding individual functions, averaged over training sets, for these two methods (see Appendix D for the details), when learning a target Boolean function of LempelZiv complexity 10 84 . 0 .
In Figures 5 and 9, we plot this average probability, for an SGD-like algorithm, and for the approximate Bayesian inference.
We ﬁnd that there is close agreement (specially taking into account that the EP approximation we use appears to overestimate probabilities, see Appendix B), although with some scatter (the source of which is hard to discern, given that the SGD probabilities have sampling error).
These results are promising evidence that SGD may behave similarly to uniform sampling of parameters (within zero-error region).
However, this is still a question that needs much further work.
[Figure]
We discuss in Appendix C some potential evidence for SGD sometimes diverging from Bayesian parameter sampling.
There we also show that a larger value for the variances of the Gaussian process gives better results, an effect which still needs an explanation.
C ONCLUSION AND FUTURE WORK
In this paper, we demonstrate that the parameter-function map of DNNs is heavily biased, using both direct sampling for a small network and an equivalence with Gaussian processes for larger networks.
We then use PAC-Bayes to give quantitative generalization error bounds for common architectures and datasets.
As far as we know, this is the ﬁrst approach to offer nonvacuous (less than 1 ) generalization errors for realistic neural networks.
We note that large P ( f ) should correspond to ﬂatter minima, so that our arguments explain the observations in the introduction that ﬂatter minima generalize better.
We also use arguments from AIT to show that functions f that obtain with higher P ( f ) are likely to be simple. Since real-world problems tend to be far from random, using these same measures, this argument offers new insight into the fundamental reason why neural networks generalize for real-world datasets and problems.
There are several possible sources of error for our bounds including: The probability that the training algorithm (like SGD) ﬁnds a particular function in the zero-error region can be approximated by the probability that the function obtains upon i.i.d.
sampling of parameters.
Gaussian processes model neural networks with i.i.d.-sampled parameters well even for ﬁnite widths.
Expectation-propagation gives a good approximation of the Gaussian process marginal likelihood.
PAC-Bayes offers tight bounds given the correct marginal likelihood P ( U ) .
We have shown evidence that number 2 is a very good approximation, and that numbers 1 and 3 are reasonably good.
In addition, the fact that our bounds are able to correctly predict the behavior of the true error, offers evidence for the set of approximations as a whole, although further work in testing their validity is needed, specially that of number 1.
Nevertheless, we think that the good agreement of our bounds constitutes good evidence for the approach we describe in the paper as well as for the claim that bias in the parameter-function map is the main reason for generalization.
We think that further work in understanding these assumptions can sharpen the results obtained here signiﬁcantly.
A B ASIC E XPERIMENTAL DETAILS
In the main experiments of the paper we used two classes of architectures.
Here we describe them in more detail.
• Fully connected networks (FCs), with varying number of layers.
The size of the hidden layers was the same as the input dimension, and the nonlinearity was ReLU.
The last layer was a single Softmax neuron.
We used default Keras settings for initialization (Glorot uniform).
• Convolutional neural networks (CNNs), with varying number of layers.
The number of ﬁlters was 200 , and the nonlinearity was ReLU.
The last layer was a fully connected single Softmax neuron.
The ﬁlter sizes alternated between (2 , 2) and (5 , 5) , and the padding between SAME and VALID, the strides were 1 (same default settings as in the code for Garriga-Alonso et al.
We used default Keras settings for initialization (Glorot uniform).
In all experiments in Section 5 we trained with SGD with a learning rate of 0 . 01 , and early stopping when the accuracy on the whole training set reaches 100% .
In the experiments where we learn Boolean functions with the smaller neural network with
Boolean inputs and one Boolean output (results in Figure 1d), we use a variation of SGD similar to the method of adversarial training proposed by Ian Goodfellow Goodfellow et al.
We chose this second method because SGD often did not ﬁnd a solution with 0 training error for all the Boolean functions, even with many thousand iterations.
By contrast, the adversarial method succeeded in almost all cases, at least for the relatively small neural networks which we focus on here. We call this method adversarial SGD , or advSGD , for short. In SGD, the network is trained using the average loss of a random sample of the training set, called a mini-batch . In advSGD, after every training step, the classiﬁcation error for each of the training examples in the mini-batch is computed, and a moving average of each of these classiﬁcation errors is updated.
This moving average gives a score for each training example, measuring how “bad” the network has recently been at predicting this example.
Before getting the next mini-batch, the scores of all the examples are passed through a softmax to determine the probability that each example is put in the mini-batch.
This way, we force the network to focus on the examples it does worst on.
For advSGD, we also used a batch size of 10 .
In all experiments we used binary cross entropy as the loss function.
We found that Adam could learn Boolean functions with the smaller neural network as well, but only when choosing the meansquared error loss function.
B T ESTING THE APPROXIMATIONS TO THE G AUSSIAN PROCESS MARGINAL LIKELIHOOD
In Figure 6, we show results comparing the empirical frequency of labellings for a sample ofrandom MNIST images, when these frequencies are obtained by sampling parameters of a neural network (with a Gaussian distribution with parameters σ w = σ b = 1 . 0 ), versus that calculated using two methods to approximate the marginal likelihood of the Gaussian process corresponding to the neural network architecture we use.
We compare the Laplacian and expectation-propagation approximations.(see
Rasmussen (2004) for a description of the algorithms)
The network has 2 fully connected hidden layers of 784 ReLU neurons each. C T HE CHOICE OF VARIANCE HYPERPARAMETERS One limitation of our approach is that it depends on the choice of the variances of the weights and biases used to deﬁne the equivalent Gaussian process. Most of the trends shown in the previous section were robust to this choice, but not all.
For instance, the bound for MNIST was higher than that for fashion-MNIST for the fully connected network, if the variance was chosen to be 1 . 0 . In Figures 8 and 7, we show the effect of the variance hyperparameters on the bound. Note that for the fully connected network, the variance of the weights σ w seems to have a much bigger role. This is consistent with what is found in Lee et al.
Furthermore, in Lee et al.
(2017) they ﬁnd, for smaller depths, that the neural network Gaussian process behaves best above σ w ≈ 1 . 0 , which marks the transition between two phases characterized by the asymptotic behavior of the correlation of activations with depth.
This also agrees with the behaviour of the PAC-Bayes bound.
For CIFAR10, we ﬁnd that the bound is best near the phase transition, which is also compatible with results in Lee et al.
For convolutional networks, we found sharper transitions with weight variance, and an larger dependence on bias variance (see Fig.
For our experiments, we chose variances values above the phase transition, and which were ﬁxed for each architecture.
The best choice of variance would correspond to the Gaussian distribution best approximates the behaviour of SGD.
We measured the variance of the weights after training with SGD and early stopping (stop when 100% accuracy is reached) from a set of initializations, and obtained values an order of magnitude smaller than those used in the experiments above.
Using these variances gave signiﬁcantly worse bounds, above 50% for all levels of corruption.
This measured variance does not necessarily measure the variance of the Gaussian prior that best models SGD, as it also depends on the shape of the zero-error surface (the likelihood function on parameter space).
However, it might suggest that SGD is biased towards better solutions in paramater space, giving a stronger/better bias than that predicted only by the parameter-function map with Gaussian sampling of parameters.
One way this could happen is if SGD is more likely to ﬁnd ﬂat (global) “minima” 11 than what is expected from near-uniform sampling of the region of zero-error (probability proportional to volume of minimum).
This may be one of the main sources of error in our approach.
A better understanding of the relation between SGD and Bayesian parameter sampling is needed to progress on this front (Lee et al.
; Matthews et al.
[Figure]
[Figure]
D D ETAILS ON THE EXPERIMENTS COMPARING THE PROBABILITY OF FINDING A FUNCTION BY SGD AND NEURAL NETWORK G AUSSIAN PROCESSES
Here we describe in more detail the experiments carried out in Section 6 in the main text.
We aim to compare the probability P ( f | S ) of ﬁnding a particular function f when training with SGD, and when training with approximate Bayesian inference (ABI), given a training set S .
We consider this probability, averaged over of training sets, to look at the properties of the algorithm rather than some particular training set.
In particular, consider a sample of N training sets { S 1 , ..., S N } of size 118 .
Then we are interested in the quantity (which we refer to as average probability of ﬁnding function f ):
[Equation]
For the SGD-like algorithms, we approximate P ( f | S i ) by the fraction of times we obtain f from a set of M random runs of the algorithm (with random initializations too).
For ABI, we calculate it as:
[Equation]
consistent with
[Equation]
otherwise
[Equation]
where P ( f ) is the prior probability of f computed using the EP approximation of the Gaussian process corresponding to the architecture we use, and P ( S i ) is the marginal likelihood of S i under this prior probability.
In Fig.
9, we show results for the same experiment as in Figure 5 in main text, but with lower variance hyperparameters for the Gaussian process, which results in signiﬁcantly worse correlation.
[Figure]
-error region).
The Gaussian process parameters (see Section 4.1 in main text) are σ w = 1 . 0 , and σ b = 1 . 0 .
For advSGD, we have removed functions which only appared once in the whole sample, to avoid ﬁnite-size effects.
In the captions ρ refers to the 2-tailed Pearson correlation coefﬁcient, and p to its corresponding p value.
E S IMPLICITY BIAS AND THE PARAMETER - FUNCTION MAP
An important argument in Section 3 in the main text is that the parameter-function map of neural networks should exhibit the basic simplicity bias phenomenolgy recently described in Dingle et al.
in Dingle et al.
In this section we briely describe some key results of reference Dingle et al.
(2018) relevant to this argument.
A computable 12 input-output map f : I → O , mapping N I inputs from the set I to N O outputs x from the set
O 13 may exhibit simplicity bias if the following restrictions are satisﬁed (Dingle et al.
1) Map simplicity The map should have limited complexity, that is its Kolmogorov complexity K
( f ) should asymptotically satisfy K ( f )
+ K ( n ) (cid:28) K ( x )+ O (1) , for typical x ∈ O where n is a measure of the size of the input set (e g. for binary input sequences, N I = 2 n .).
2) Redundancy :
There should be many more inputs than outputs ( N I (cid:29) N O ) so that the probability P ( x ) that the map generates output x upon random selection of inputs ∈ I can in principle vary signiﬁcantly.
Finite size N O (cid:29) 1 to avoid potential ﬁnite size effects.
4) Nonlinearity : The map f must be a nonlinear function since linear functions do not exhibit bias.
Well behaved :
The map should not primarily produce pseudorandom outputs (such as the digits of π ), because complexity approximators needed for practical applications will mistakenly label these as highly complex.
For the deep learning learning systems studied in this paper, the inputs of the map f are the parameters that ﬁx the weights for the particular neural network architecture chosen, and the outputs are the functions that the system produces.
Consider, for example, the conﬁguration for Boolean functions studied in the main text.
While the output functions rapidly grow in complexity with increasing size of the input layer, the map itself can be described with a low-complexity procedure, since it consists of reading the list of parameters, populating a given neural network architecture and evaluating it for all inputs.
For reasonable architectures, the information needed to describe the map grows logarithmically with the input dimension n , so for large enough n , the amount of information required to describe the map will be much less than the information needed to describe a typical function, which requires 2 2 n bits.
Thus the Kolmogorov complexity K ( f ) of this map is asymptotically smaller than the the typical complexity of the output, as required by the map simplicity condition 1) above.
The redundancy condition 2) depends on the network architecture and discretization.
For overparameterised networks, this condition is typically satisﬁed.
In our speciﬁc case, where we use ﬂoating point numbers for the parameters (input set I ), and Boolean functions (output set O ), this condition is clearly satisﬁed.
Neural nets can represent very large numbers of potential functions (see for example estimates of VC dimension Harvey et al.
(2017); Baum & Haussler (1989)), so that condition 3) is also generally satisﬁed.
Neural network parameter-function maps are evidently non-linear, satisfying condition 4).
Condition 5) is perhaps the least understood condition within simplicity bias.
However, the lack of any function with high probability and high complexity (at least when using LZ complexity) , provides some empirical validation.
This condition also agrees with the expectation that neural networks will not predict the outputs of a good pseudorandom number generator.
One of the implicit assumptions in the simplicity bias framework is that, although true Kolmogorov complexity is always uncomputable, approximations based on well chosen complexity measures perform well for most relevant outputs x .
Nevertheless, where and when this assumptions holds is a deep problem for which further research is needed.
F O THER COMPLEXITY MEASURES
One of the key steps to practical application of the simplicity bias framework of Dingle et al.
in Dingle et al.
(2018) is the identiﬁcation of a suitable complexity measure ˜ K ( x ) which mimics aspects of the (uncomputable) Kolmogorov complexity K
( x ) for the problem being studied.
It was shown for the maps in Dingle et al.
(2018) that several different complexity measures all generated the same qualitative simplicity bias behaviour:
[Equation]
but with different values of a and b depending on the complexity measure and of course depending on the map, but independent of output x .
Showing that the same qualitative results obtain for different complexity measures is sign of robustness for simplicity bias.
Below we list a number of different descriptional complexity measures which we used, to extend the experiments in Section 3 in the main text.
F. C OMPLEXTY MEASURES
Lempel-Ziv complexity ( LZ complexity for short).
The Boolean functions studied in the main text can be written as binary strings, which makes it possible to use measures of complexity based on ﬁnding regularities in binary strings.
One of the best is Lempel-Ziv complexity, based on the Lempel-Ziv compression algorithm.
It has many nice properties, like asymptotic optimality, and being asymptotically equal to the Kolmogorov complexity for an ergodic source.
We use the variation of Lempel-Ziv complexity from Dingle et al.
(2018) which is based on the 1976 Lempel Ziv algorithm (Lempel & Ziv (1976)):
[Equation]
where n is the length of the binary string, and N w ( x 1 ...x n ) is the number of words in the LempelZiv "dictionary" when it compresses output x .
The symmetrization makes the measure more ﬁnegrained, and the log 2 ( n ) factor as well as the value for the simplest strings ensures that they scale as expected for Kolmogorov complexity.
This complexity measure is the primary one used in the main text.
We note that the binary string representation depends on the order in which inputs are listed to construct it, which is not a feature of the function itself.
This may affect the LZ complexity, although for low-complexity input orderings (we use numerical ordering of the binary inputs), it has a negligible effect, so that K ( x ) will be very close to the Kolmogorov complexity of the function.
Entropy .
A fundamental, though weak, measure of complexity is the entropy.
For a given binary string this is deﬁned as S = − n 0 N log 2 n 0 N − n 1 N log 2 n 1 N , where n 0 is the number of zeros in the string, and n 1 is the number of ones, and N = n 0 + n 1 .
This measure is close to 1 when the number of ones and zeros is similar, and is close to 0 when the string is mostly ones, or mostly zeros.
Entropy and K LZ ( x ) are compared in Fig. 10, and in more detail in supplementary note 7 (and supplementary information ﬁgure 1) of reference Dingle et al.
They correlate, in the sense that low entropy
S ( x ) means low K LZ ( x ) , but it is also possible to have Large entropy but low K LZ ( x ) , for example for a string such as 10101010 ... .
Boolean expression complexity .
Boolean functions can be compressed by ﬁnding simpler ways to represent them.
We used the standard SciPy implementation of the Quine-McCluskey algorithm to minimize the Boolean function into a small sum of products form, and then deﬁned the number of operations in the resulting Boolean expression as a Boolean complexity measure.
Generalization complexity .
L. Franco et al.
have introduced a complexity measure for Boolean functions, designed to capture how difﬁcult the function is to learn and generalize (Franco & Anthony (2004)), which was used to empirically ﬁnd that simple functions generalize better in a neural network (Franco (2006)).
The measure consists of a sum of terms, each measuring the average over all inputs fraction of neighbours which change the output.
The ﬁrst term considers neighbours at Hamming distance of 1 , the second at Hamming distance of 2 and so on.
The ﬁrst term is also known (up to a normalization constant) as average sensitivity (Friedgut (1998)).
The terms in the series have also been called “generalized robustness” in the evolutionary theory literature (Greenbury et al.
Here we use the ﬁrst two terms, so the measure is: C ( f ) = C 1 ( f ) + C 2 ( f ) ,
C 1 ( f ) = 1 2 n n (cid:88) x ∈ X (cid:88) y ∈ Nei 1 ( x ) | f ( x ) − f ( y ) | , C 1 ( f ) = 2 n n ( n − 1) (cid:88) x ∈ X (cid:88) y ∈
Nei 2 ( x ) | f ( x ) − f ( y ) | , where Nei i ( x ) is all neighbours of x at Hamming distance i .
Critical sample ratio .
A measure of the complexity of a function was introduced in Krueger et al.
(2017) to explore the dependence of generalization with complexity.
In general, it is deﬁned with respect to a sample of inputs as the fraction of those samples which are critical samples , deﬁned to be an input such that there is another input within a ball of radius r , producing a different output (for discrete outputs).
Here, we deﬁne it as the fraction of all inputs, that have another input at Hamming distance 1 , producing a different output.
F. C ORRELATION BETWEEN COMPLEXITIES
In Fig.
10, we compare the different complexity measures against one another.
We also plot the frequency of each complexity; generally more functions are found with higher complexity.
F. P ROBABILITY - COMPLEXITY PLOTS
In Fig.
11 we show how the probability versus complexity plots look for other complexity measures.
The behaviour is similar to that seen for the LZ complexity measure in Fig 1(b) of the main text.
In
Fig.
12 we show probability versus LZ complexity plots for other choices of parameter distributions.
[Figure]
The measures of complexity are described in SI
[Figure]
F. E FFECTS OF TARGET FUNCTION COMPLEXITY ON LEARNING FOR DIFFERENT COMPLEXITY MEASURES
Here we show the effect of the complexity of the target function on learning, as well as other complementary results.
Here we compare neural network learning to random guessing, which we call “unbiased learner”.
Note that both probably have the same hypothesis class as we tested that the neural network used here can ﬁt random functions.
The functions in these experiments were chosen by randomly sampling parameters of the neural network used, and so even the highest complexity ones are probably not fully random 14 .
In fact, when training the network on truly random functions, we obtain generalization errors equal or above those of the unbiased learner.
This is expected from the No Free Lunch theorem, which says that no algorithm can generalize better (for off-training error) uniformly over all functions than any other algorithm (Wolpert & Waters (1994)).
[Figure]
F. L EMPEL -Z IV VERSUS E NTROPY
To check that the correlation between LZ complexity and generalization is not only because of a correlation with function entropy (which is just a measure of the fraction of inputs mapping to
[Figure] [Figure]
[Figure]
1 or 0 , see Section F), we observed that for some target functions with maximum entropy (but which are simple when measured using LZ complexity), the network still generalizes better than the unbiased learner, showing that the bias towards simpler functions is better captured by more powerful complexity measures than entropy 15 .
This is conﬁrmed by the results in Fig.
17 where we ﬁx the target function entropy to 1 . 0 , and observe that the generalization error still exhibits considerable variation, as well as a positive correlation with complexity
[Figure]
G F INITE - SIZE EFFECTS FOR SAMPLING PROBABILITY
Since for a sample of size N the minimum estimated probability is 1 /N , many of the low-probability samples that arise just once may in fact have a much lower probability than suggested.
See Figure 18), for an illustration of how this ﬁnite-size sampling effect manifests with changing sample size N .
For this reason, these points are typically removed from plots.
H E FFECT OF NUMBER OF LAYERS ON SIMPLICITY BIAS
In Figure 19 we show the effect of the number of layers on the bias (for feedforward neural networks with 40 neurons per layer). The left ﬁgures show the probability of individual functions versus the complexity.
The right ﬁgure shows the histogram of complexities, weighted by the probability by which the function appeared in the sample of parameters.
The histograms therefore show the distribution over complexities when randomly sampling parameters 16 We can see that between the 0 layer perceptron and the 2 layer network there is an increased number of higher complexity functions.
This is most likely because of the increasing expressivity of the network.
For 2 layers and above, the expressivity does not signiﬁcantly change, and instead, we observe a shift of the distribution towards lower complexity. I B IAS AND THE CURSE OF DIMENSIONALITY
We have argued that the main reason deep neural networks are able to generalize is because their implicit prior over functions is heavily biased.
We base this claim on PAC-Bayes theory, which tells us that enough bias implies generalization. The contrapositive of this claim is that bad generalization implies small bias. In other words, models which perform poorly on certain tasks relative to deep learning, should show little bias. Here we describe some examples of this, connecting them to the curse of dimensionality.
In future work, we plan to explore the converse statement, that small bias implies bad generalization — one way of approaching this would be via lower bounds matching the
PAC-Bayes upper bound.
Complex machine learning tasks require models which are expressive enough to be able to learn the target function.
For this reason, before deep learning, the main approach to complex tasks was to use non-parametric models which are inﬁnitely expressible.
These include Gaussian processes and other kernel methods.
However, unlike deep learning, these models were not successful when applied to tasks where the dimensionality of the input space was very large.
We therefore expect that these models show little bias, as they generalize poorly.
Many of these models use kernels which encode some notion of local continuity.
For example, the
Gaussian kernel ensures that points within a ball of radius λ are highly correlated.
On the other hand, points separated by a distance greater than λ can be very different.
Intuitively, we can divide the space into regions of length scale λ .
If the input domain we re considering has O (1) volume, and has dimensionality d (is a subset of R d ), then the volume of each of these regions is of order λ d , and the number of these regions is of order 1 /λ d .
In the case of binary classiﬁcation, we can estimate the effective number of functions which the kernel “prefers” by constraining the function to take label 0 or 1 within each region, but with no further constraint.
The number of such functions is 2 a d , where we let a := 1 /λ .
Each of these functions is equally likely, and together they take the bulk of the total probability, so that they have probability close to 2 − a d , which decreases very quickly with dimension.
Kernels like the Gaussian kernel are biased towards functions which are locally continuous.
However, for high dimension d , they are not biased enough .
In particular, as the the probability of the most likely functions grows doubly exponentially with d , we expect PAC-Bayes-like bounds to grow exponentially with d , quickly becoming vacuous.
This argument is essentially a way of understanding the curse of dimensionality from the persective of priors over functions.
[Figure]
J O THER RELATED WORK
The topic of generalization in neural networks has been extensively studied both in theory and experiment, and the literature is vast.
Theoretical approaches to generalization include classical notions like VC dimension Baum & Haussler (1989); Harvey et al.
(2017) and Rademacher complexity Sun et al.
(2016), but also more modern concepts such as stability Hardt et al. (2016), robustness Xu & Mannor (2012), compression Arora et al.
(2018) as well as studies on the relation between generalization and properties of stochastic gradient descent (SGD) algorithms Zhang et al.
(2017b) ; Soudry et al.
(2017); Advani & Saxe (2017).
Empirical studies have also pushed the boundaries proposed by theory, In particular, in recent work by Zhang et al.
Zhang et al.
(2017a), it is shown that while deep neural networks are expressive enough to ﬁt randomly labeled data, they can still generalize for data with structure.
The generalization error correlates with the amount of randomization in the labels.
A similar result was found much earlier in experiments with smaller neural networks Franco (2006), where the authors deﬁned a complexity measure for Boolean functions, called generalization complexity (see SI F), which appears to correlate well with the generalization error.
Inspired by the results of Zhang et al.
Zhang et al.
(2017a), Arpit et al.
Krueger et al.
(2017) propose that the data dependence of generalization for neural networks can be explained because they tend to prioritize learning simple patterns ﬁrst.
The authors show some experimental evidence supporting this hypothesis, and suggest that SGD might be the origin of this implicit regularization.
This argument is inspired by the fact that SGD converges to minimum norm solutions for linear models Yao et al.
(2007), but only suggestive empirical results are available for the case of nonlinear models, so that the question remains open Soudry et al.
Wu et al. Wu et al.
(2017) argue that fullbatch gradient descent also generalizes well, suggesting that SGD is not the main cause behind generalization.
It may be that SGD provides some form of implicit regularisation, but here we argue that the exponential bias towards simplicity is so strong that it is likely the main origin of the implicit regularization in the parameter-function map.
The idea of having a bias towards simple patterns has a long history, going back to the philosophical principle of Occam’s razor, but having been formalized much more recently in several ways in learning theory.
For instance, the concepts of minimum description length (MDL) Rissanen (1978),
Blumer algorithms Blumer et al.
; Wolpert & Waters (1994), and universal induction Ming & Vitányi (2014) all rely on a bias towards simple hypotheses.
Interestingly, these approaches go hand in hand with non-uniform learnability, which is an area of learning theory which tries to predict data-dependent generalization.
For example, MDL tends to be analyzed using structural risk minimization or the related PAC-Bayes approach Vapnik (2013); Shalev-Shwartz & Ben-David (2014).
Hutter et al.
Lattimore & Hutter (2013) have shown that the generalization error grows with the target function complexity for a perfect Occam algorithm 17 which uses Kolmogorov complexity to choose between hypotheses.
Schmidhuber applied variants of universal induction to learn neural networks Schmidhuber (1997).
The simplicity bias from Dingle et al.
Dingle et al.
(2018) arises from a simpler version of the coding theorem of Solomonoff and Levin Ming & Vitányi (2014).
More theoretical work is needed to make these connections rigorous, but it may be that neural networks intrinsically approximate universal induction because the parameter-function map results in a prior which approximates the universal distribution.
Other approaches that have been explored for neural networks try to bound generalization by bounding capacity measures like different types of norms of the weights (Neyshabur et al.
; Keskar et al. (2016); Neyshabur et al.
(2017b;a); Bartlett et al. (2017); Golowich et al.
Arora et al.
(2018)), or unit capacity Neyshabur et al.
These capture the behaviour of the real test error (like its improvement with overparametrization (Neyshabur et al.
(2018)), or with training epoch (Arora et al.
However, these approaches have not been able to obtain nonvacuous bounds yet.
Another popular approach to explaining generalisation is based around the idea of ﬂat minima Keskar et al.
; Wu et al.
In Hochreiter & Schmidhuber (1997), Hochreiter and Schmidhuber argue that ﬂatness could be linked to generalization via the MDL principle.
Several experiments also suggest that ﬂatness correlates with generalization.
However, it has also been pointed out that ﬂatness is not enough to understand generalization, as sharp minima can also generalize Dinh et al.
We show in Section 2 in the main text that simple functions have much larger regions of parameter space producing them, so that they likely give rise to ﬂat minima, even though the same function might also be produced by other sharp regions of parameter space.
Other papers discussing properties of the parameter-function map in neural networks include Montufar et al.
Montufar et al.
(2014), who suggested that looking at the size of parameter space producing functions of certain complexity (measured by the number of linear regions) would be interesting, but left it for future work.
In Poole et al.
Poole et al.
brieﬂy look at the sensitivity to small perturbations of the parameter-function map.
In spite of these previous works, there is clearly still much scope to study the properties of the parameter-function map for neural networks. Other work applying PAC-Bayes theory to deep neural networks include (Dziugaite & Roy (2017; 2018); Neyshabur et al. (2017a;b)). The work of Dziugaite and Roy is noteworthy in that it also computes non-vacuous bounds.
However, their networks differ from the ones used in practice in that they are either stochastic (Dziugaite & Roy (2017)) or trained using a non-standard variant of
SGD (Dziugaite & Roy (2018)).
Admittedly, they only do this because current analysis cannot be rigorously extended to SGD, and further work on that end could make their bounds applicable to realistic networks. One crucial difference with previous PAC-Bayes work is that we consider the prior over functions , rather than the prior over parameters. We think this is one reason why our bounds are tighter than other PAC-Bayes bounds. The many-to-one nature of the parameter-function map in models with redundancy means that: low KL divergence between prior and posterior in parameter space implies low KL divergence between corresponding prior and posterior in function space; conversely, one can have low KL divergence in function space with a large KL divergence in parameter space.
Using the
PAC-Bayes bound from McAllester (1999), this implies that bounds using distributions in function space can be tighter.
As we explain in Section 4, we actually use the less-commonly used bound from McAllester (1998), which assumes the posterior is the Bayesian posterior, which we argue is a reasonable approximation.
This posterior is known to give the tightest PAC-Bayes bounds for a particular prior (McAllester (1999)).
Finally, our work follows the growing line of work exploring random neural networks Schoenholz et al.
(2017a); Giryes et al.
; Poole et al.
; Schoenholz et al.
(2017b), as a way to understand fundamental properties of neural networks, robust to other choices like initialization, objective function, and training algorithm.