Rademacher complexity and spin glasses: A link between the replica and statistical theories of learning
Abstract
Statistical learning theory provides bounds of the generalization gap, using in particular the VapnikChervonenkis dimension and the Rademacher complexity. An alternative approach, mainly studied in the statistical physics literature, is the study of generalization in simple syntheticdata models. Here we discuss the connections between these approaches and focus on the link between the Rademacher complexity in statistical learning and the theories of generalization for typicalcase synthetic models from statistical physics, involving quantities known as Gardner capacity and ground state energy. We show that in these models the Rademacher complexity is closely related to the ground state energy computed by replica theories. Using this connection, one may reinterpret many results of the literature as rigorous Rademacher bounds in a variety of models in the highdimensional statistics limit. Somewhat surprisingly, we also show that statistical learning theory provides predictions for the behavior of the groundstate energies in some full replica symmetry breaking models.
theorems
1 Introduction
Empirical risk minimization is the workhorse of most of modern supervised machine learning successes. Consider for instance a dataset of examples assumed to be drawn from a distribution , with labels used for a binary classification task. We consider an estimator that belongs to a hypothesis class , for instance a neural network or a linear function, with respective weights or parameters w. The latter are typically computed by minimizing the empirical risk
over w, where denotes a loss function, e.g. the meansquaredloss . The main theoretical issue of statistical learning theory concerns the performance of the estimator obtained by such a minimization on yet unseen data, namely the generalization problem. In fact, what we really hope to minimize is the population risk, defined as
Since we are optimizing the empirical risk instead, the difference between the two might be arbitrarily large. Bounding this difference between empirical and population risks is therefore a major problem of statistical learning theories.
In a large part of the literature, statistical learning analysis (see e.g. [bartlett2002rademacher, vapnik2013nature, shalev2014understanding]) relies on the VapnikChervonenkis (VC) analysis and on the socalled Rademacher complexity. The latter is a measure of the complexity of , the hypothesis class spanned by , to bound , the generalization gap. A gem within the literature is the Uniform Convergence result which states the following: if the Rademacher complexity or the VC dimension is finite, then for a large enough number of samples the generalization gap will vanish uniformly over all possible values of parameters w. Informally, uniform convergence tells us that with high probability, for any weights value w, the generalization gap satisfies
(1) 
where denotes the VapnikChervonenkis dimension of the hypothesis class . Tighter bounds can be obtained using the Rademacher complexity. These bounds, although useful, do not seem to fully explain the success of current deeplearning architectures ([zhang2016understanding]).
Over the last four decades, a different vision of generalization — based on the analysis of typical case problems with synthetic data created from simple generative models — was developed to a large extent in the statistical physics literature (see e.g. [Seung1992, Watkin1993, opper1995statistical, engel2001statistical] for a review). The link with the VC dimension was discussed in many of these works, notably via its connection with its twin from statistical physics, the Gardner capacity ([gardner1988optimal]). In particular, one can show that the VC capacity is always larger than half of the Gardner one ([engel2001statistical]). We shall review this discussion later on in this paper. However, to the best of our knowledge the Rademacher complexity was absent from these considerations. This omission is unfortunate: not only does the Rademacher complexity give tighter bounds than the VC dimension, it also intrinsically connects with a quantity that physicists are familiar with and have been computing from the very beginning of their studies, namely the average groundstate energy.
The goal of the present paper is to bridge this gap and unveil the deep link between groundstate energy and Rademacher complexity, and how this connection is valuable to both parties. The paper is organized as follows: After giving proper definitions of common generalization bounds in sec. 2, we detail calculations of Rademacher complexities for simple function classes in sec. 3. These sections serve as an introduction to the readers not familiar with these notions. The subsequent sections 4 and 5 provide the original content of the paper.
Here we summarize the main contributions of this paper:

We point out the onetoone connections between the Rademacher complexity in statistical learning, and the groundstate energies and Gardner capacity from statistical physics.

We show how the heuristic replica method from statistical physics can be used to compute the Rademacher complexity in the highdimensional statistics limit and reinterpret classical results of the statistical physics literature as Rademacher bounds in the case of perceptron and committee machines models with i.i.d data.

We contrast these results with the generalization in the teacherstudent scenario, illustrating the worstcase nature of the Rademacher bound that fails to capture the typicalcase behavior.

We finally show en passant, that learning theory also bears consequences for the spin glass physics and the related replica symmetry breaking scheme by showing it implies strong constraint on the groundstate energy of some spin glass models.
2 A primer on Rademacher complexity
The bound of the generalization gap involving the VC dimension is specific to binary classification, and does not depend on the data distribution. While this is a strong property, the Rademacher approach does depend on data distribution and allows for tighter bounds. Moreover, it generalizes to multiclass classification and regression problems. We recall the definition of the Rademacher complexity:
Definition 2.1.
Let be any function in the hypothesis class , and let be drawn uniformly at random. The empirical Rademacher complexity is defined as
(2) 
and depends on the sample examples . The Rademacher complexity is defined as the population average
(3) 
In this paper, we shall focus on binary classification and consider the corresponding loss function that counts the number of misclassified samples. We will be therefore interested in a hypothesis class . Defining the training and generalization errors for any function by
(4) 
the Rademacher complexity provides a generalization error bound as expressed by the following theorem, and many of its variants (see e.g. [bartlett2002rademacher, vapnik2013nature, shalev2014understanding, Mohri2018]):
Theorem 2.2.
Uniform convergence bound  Binary classification
Fix a distribution and let . Let be drawn i.i.d from . Then
with probability at least (over the draw of ),
(5) 
Thus, the Rademacher complexity is a uniform bound of the generalization gap. In the highdimensional limit when both and goes to infinity that we will consider in the remaining of the paper, we shall see that we can discard the dependent term and that only the first term will remains finite.
Note that this theorem can be used to recover the classical result (1). Indeed it can be shown ([massart2000some, ledoux2013probability, dudley1967sizes]) that the Rademacher complexity can be bounded by the VC dimension so that for some constant value ,
(6) 
We remind the reader that the VC dimension is the size of the set that can be fully shattered by the hypothesis class . Informally, if then for all set of data points, there exists an assignment of labels that cannot be fully fitted by the function class ([vapnik2013nature]).
3 Synthetic models in the highdimensional statistics limit
In this section, we consider data generated by a simple generative model. We suppose that each vector of input data points has been generated i.i.d from a factorized, e.g. Gaussian, distribution, that is . In the following, we will focus on this simple data distribution, but sec. 5.5 presents a generalization to rotationally invariant data matrices with arbitrary spectrum. The main interest of such settings is to use the analysis of typical case problems with synthetic data created from simple generative models as means of getting additional insight on real world applications where data are not worst case ([Seung1992, Watkin1993, opper1995statistical, engel2001statistical, Zdeborova2016]). In particular, we shall be interested in the highdimensional statistics limit when , with . In this paper, the aim is to compute exactly (rather than merely bounding) and asymptotically the Rademacher complexity for such problems.
3.1 Linear model
As the simplest example, we first tackle the computation of the Rademacher complexity for a simple function class containing all linear models with weights ,
(7) 
From eq. (3), computing the empirical Rademacher complexity amounts to finding the vector that maximizes the scalar product between y (that replaces the variable ) and . It is thus sufficient to take and the empirical Rademacher complexity (3) thus reads
(8) 
which has i.i.d entries, we can apply the central limit theorem, which enforces , hence . Assuming that weights are restricted to lie on the sphere of radius , we set and finally obtain
(9) 
where recall . The above result for the simple linear function hypothesis class allows to grasp the meaning of the Rademacher complexity: At fixed input dimension , it decreases with the number of samples as , closing the generalization gap in the infinite limit. Illustrating the biasvariance tradeoff, we also see that increasing the radius of the weights expands the function complexity (and might help for fitting the dataset), but unfortunately leads to a looser generalization bound.
Note also that the fact that the Rademacher complexity is shows that it remains finite in the highdimensional statistics limit. In this case, we see indeed that we can disregard the term that goes to zero as in eq. (5).
3.2 Perceptron model
The scaling of Rademacher complexity inverse as in the highdimensional statistics limit is actually not restricted to the linear model but appears to be a universal property, at least at large enough . To see this we now focus on a different hypothesis class: the perceptron, denoted . This class contains linear classifiers which output binary variables, and will fit much better labels in the binary classification task. The class writes
(10) 
Let us consider a sample i.i.d matrix with .
Theorem 3.1.
For the perceptron model class eq. (10) with random i.i.d. input data in the highdimensional limit, .
The proof is given in Appendix A. In a nutshell, it uses the fact that Rademacher complexity is upperbounded by the VC dimension divided by , and lowerbounded by one particular example of its function class, when the weights are chosen according to Hebb’s rule ([hebb1962organization]), which also gives a behavior scaling as .
Heuristically, this result generalizes as well to a twolayer neural network with hidden neurons. Indeed, the twolayer function class contains, as a particular case, the single layer one, so the lower bounds goes through. The upper bound is however harder to control rigorously. Since neural networks have a finite VC dimension, the Rademacher complexity is again lowerbounded by ; However, we do not know of any theorem that would ensure that the VC dimension is bounded by ([bartlett2003vapnik]). Nevertheless, anticipating on the statistical physics approach, we indeed expect from the concentration (selfaveraging) properties of the groundstate energy ([talagrand2003spin]) in the highdimensional limit that it will yield a Rademacher complexity that is a function of only at fixed . From this argument, we expect that the dependence of the Rademacher complexity to be very generic in the highdimensional limit.
4 The statistical physics approach
4.1 Average case problems: Statistical physics of learning
As anticipated in the previous chapter, the approach inspired by statistical physics to understand neural networks considers a set of data points coming from known distributions. Again, for the purpose of this presentation we focus on a simple example, where with . Sec. 5.5 is devoted to a generalization to random input data corresponding to random matrices with arbitrary singular value density.
Consider a function class, for instance we can again use the perceptron one : ; a typical question in the literature was to compute how many misclassified examples can be obtained for a given rule used to generate the labels ([engel2001statistical]). Given samples , in order to count the number of wrongly classified training samples, we define the Hamiltonian, or ”energy” function [Mezard1986]:
(11) 
A classical problem in statistical physics is to compute the random capacity also called Gardner capacity ([Gardner1989]): given examples and labels randomly chosen between , it consists in finding how many samples can be correctly classified.
It turns out there exists a deep connection between the Gardner capacity and the VC dimension, as their common aim is to measure the maximum number of points such that there exists a function in the hypothesis class being able to fit the data set. In particular, using Sauer’s lemma ([SAUER1972145]) in the large size limit , keeping and , it is possible to show that the Gardner capacity provides a lowerbound of the VC dimension ([engel2001statistical]):
(12) 
To illustrate this inequality, let us consider again the perceptron classifier hypothesis class for which the above inequality is saturated. In fact, the VC dimension is in this case (linear classification with binary outputs) simply . Hence on one hand , on the other hand the Gardner capacity amounts to ([cover1965geometrical, Gardner1989]).
It is fair to say that a large part of the statistical physics literature focused mainly on the Gardner capacity, in particular in a series of works in the 90’s ([Gardner1989, Krauth1989]) that led to more recent rigorous works ([talagrand2003spin, talagrand2006parisi, Sun2018, Aubin2019]).
4.2 The Rademacher complexity and the groundstate energy
As we shall see now, computing the Rademacher complexity for random input data can be directly reduced to a more natural object in the physics literature: the groundstate energy. Defining the Gibbs measure at inverse temperature , that weighs configurations with their respective cost, as
(13) 
we observe that averaging the Hamiltonian in eq. (11) over and the Gibbs measure for any function provides
(14) 
where . Taking the zero temperature limit, i.e. , in the above equation, we finally obtain the groundstate energy , a quantity commonly used in physics. Interestingly, we recognize the definition of the Rademacher complexity
(15) 
where random labels y play the role of the Rademacher variable in (3). The above equation shows a simple correspondence between the groundstate energy on the perceptron model and the Rademacher complexity of the corresponding hypothesis class, and shall bring insights from both the machine learning and statistical physics communities. Consequently, as we shall see, this connection means that the Rademacher complexity can be computed (rather than bounded) for many models using the replica method from statistical physics. As far as we are aware, this basic connection between the ground state energy and Rademacher complexity was not previously stated in literature.
4.3 An intuitive understanding on the Rademacher bounds on generalization
At this point, the Rademacher complexity becomes a more familiar object to the physicsminded reader. However, could we understand more intuitively why the Rademacher complexity, or equivalently the groundstate energy, is involved in the generalization gap bound? Let us present an intuitive handwaving explanation. Consider the fraction of mistakes performed by a classifier on unknown samples, namely the generalization error , and on the training set the training error . The worst case scenario that could occur is trying to fit while there exists no underlying rule, meaning that labels are purely random uncorrelated from input. The estimator will purely overfit and its generalization error will remain constant to in any case. This leads to the following heuristic generalization bound:
(16) 
Note that this heuristic reasoning does not give the exact Rademacher generalization bound. In fact, the actual stronger and uniform (over all possible ) bound does not have a factor , and surely cannot be fully captured by the simple above argument. Nevertheless, this argument reflects the crux of the Rademacher bound: it provides a very pessimistic bound by assuming the worst possible scenario: i.e. fitting data and trying to make predictions while the labels are random. Of course, in real data problems the rule is not random; it is then no surprise that the Rademacher bound is not tight ([zhang2016understanding]). Indeed, real problems labels are not randomly correlated with the inputs.
5 Consequences and bounds for simple models
In this section, we illustrate our previous arguments and the connection between the spin glass approach and the Rademacher complexity still for the case of Gaussian i.i.d input data matrix in the highdimensional limit when .
5.1 Ground state energies of the perceptron
For a number of samples smaller than the Gardner capacity , it is by definition possible to fit all random labels y. Accordingly, the number of misclassified examples is zero and the ground state energy . This means that the Rademacher complexity is asymptotically equal to for . However above the Gardner capacity , the estimator cannot perfectly fit the random labels and will misclassify some of them, equivalently . From the arguments given in sec. 3, we thus expect
(17)  
This relation is already nontrivial, as it yields a link between the Gardner capacity and the Rademacher complexity. Using the replica method from spin glass analysis, and the mapping with ground state energies (15), we shall now see how one can go beyond these simple arguments, and compute the actual precise asymptotic value of the Rademacher complexity.
5.2 Computing the groundstate energy with the replica method
Knowing that statistical physics literature focused mainly on the Gardner capacity, the connection between the groundstate energy and the Rademacher complexity suggests that it would be worth looking at these old results in a new light. In fact, the replica method allows for an exact computation of the Rademacher complexity for random input data in the large size limit. In the following, we handle computations by focusing on a simple generalization of the linear functions hypothesis class. Fix any activation function , we define the following hypothesis class
(18) 
Starting with the posterior distribution
(19) 
we introduced the partition function associated to the Hamiltonian eq. (11) at inverse temperature
(20) 
In the large size limit , the posterior distribution becomes highly peaked in particular regions of parameters. In physics we are interested in these dominant regions and focus on the free energy at inverse temperature defined as
(21) 
However, as we are interested in computing quantities in the typical case, we want to average over all potential training sets and compute instead the averaged free energy
(22) 
Computing directly this average rigorously is difficult, hence we will carry out the computation using the socalled replica method, starting by writing the replica trick
(23) 
which replaces the expectation of by the moments of , which are easier to compute. Taking the limit , and assuming that we can revert it with the limit , we finally obtain
(24) 
We give some details on the replica computation in Appendix B.1, and we also refer the reader to the relevant literature in physics ([Mezard1986, Hertz1993, engel2001statistical, mezard2009information, Zdeborova2016]) and in mathematics ([talagrand2003spin, talagrand2006parisi, bolthausen2007spin, panchenko2004bounds, panchenko2018free]). The computation of the free energy by the replica method is done by deriving a hierarchy of approximate ansatz, named replica symmetric (RS), onestep replicasymmetry breaking (1RSB), twostep replicasymmetry breaking (2RSB)…While in some problems the RSB or the 1RSB ansatz is sufficient, in others only the infinite step solution (fullRSB) gives the exact ansatz ([Mezard1989, talagrand2003spin, talagrand2006parisi]), although the 1RSB approach is usually an accurate approximation.
Computing the ground state energy consists in taking the zero temperature limit above the capacity in the replica free energy ; where denote respectively the energy and entropy contributions. The simplest form of the replica computation is known as Replica Symmetry (RS) and the next simplest is onestep Replica Symmetry Breaking (1RSB) which plugged in eq. (24) leads to expressions [Majer1993a, Erichsen1992, Whyte1996]
(25) 
with auxiliary functions
(26) 
We introduced a temperaturedependant constraint function where the generic cost function reads in our case . Above expressions are valid for any generic weight distribution and nonlinearity . The detailed computation can be found in Appendix B.1, in particular eq. (53) and eq. (65). Then the general method to find the ground state energy it to take the zero temperature limit
(27) 
while handling carefully the scaling of the optimized order parameters in this limit.
Spherical perceptron The most commonly studied model ([gardner1988optimal, Gardner1988a, Gardner1989, gardner1988optimal]) with continuous weights is the spherical model with such that . The spherical constraint allows to have a welldefined model which excludes diverging or vanishing weights. In this case, the Gardner capacity is rigorously known to be equal to ([cover1965geometrical]).
We computed both the RS and 1RSB free energies ([Majer1993a, Erichsen1992, Whyte1996], see also Appendix B.1.4.). Taking the zero temperature limits and in the 1RSB case, while keeping and finite leads to the following expressions of the ground states energies:
(28)  
(29)  
where the cost function . The details of the derivation via the replica methods are given in Appendix B.1.4. The results for Rademacher variable and with are depicted in Fig. 1.
Interestingly, the bounds on the Rademacher complexity also imply consequences for the ground state energy. Indeed the Rademacher complexity scales as for large values of — namely there exists a constant such that — therefore the ground state energy behaves for large as
(30) 
We first notice that the replica symmetric (RS) solution complexity fails to deliver the correct scaling as sketched in Fig. 1, so the scaling in eq. (30) must not be entirely trivial. On the other hand, the 1RSB solution we used (which is expected to be numerically very close to the harder to evaluate fullRSB one), seems to yield the correct scaling (see Fig. 1). It is rather striking that the statistical learning connection allows to predict, through eq. (30), the scaling of the energy in the large regime, that is only satisfied with replica symmetry breaking ansatz. This yields an open question for replica theory: in practice, can one compute exactly the value of the constant ? Given the fullRSB solution is notoriously hard to evaluate, this might be an issue worth investigating in mathematical physics.
Binary perceptron Another common choice for the weights distribution is the binary prior
studied e.g. in [Krauth1989]. In this case, the Gardner capacity is predicted to be , a prediction which, remarkably, is still not entirely rigorously proven, but see [Sun2018, Aubin2019].
To see this, we use eq. (25). In the binary perceptron, the landscape of the model is said to be frozen 1RSB (f1RSB), i.e. clustered in pointlike dominant solutions, and the RS and 1RSB free energies are the same (even though their entropies are different) . In this case computing the ground state can be tackled via finding the effective temperature such that the , that can be plugged back to find the ground state energy . Again, we note that even though the 1RSB ansatz is unstable and should be replaced by a more complex (and ultimately fullRSB) solution, it already gives the good scaling , and satisfies the scaling eq. (30) for large , as in the case of the spherical model, see Fig. 2.
5.3 Teacherstudent scenario versus worst case Rademacher
The Rademacher bounds are really interesting as they depend only on the data distribution, and are valid for any rule used to generate the labels, no matter how complicated. In this sense, it is a worstcase scenario on the rule that prescribes labels to data. A different approach, again pioneered in statistical physics [Gardner1989], is to focus on the behavior for a given rule, called the teacher rule. Given the Rademacher bounds tackle the worst case with respect to that rule, it is interesting to consider the generalization error one actually gets for the best case, i.e. fitting the labels according to the same teacher rule.. This is the socalled teacherstudent approach. In the wake of the need to understand the effectiveness of neural networks, and the limitations of the classical approaches, it is of interest to revisit the results that have emerged thanks to the physics perspective.
We shall thus assume that the actual labels are given by the rule
(31) 
with , the teacher weights that can be taken as Rademacher variables, or Gaussian ones. Now that labels are generated by feeding i.i.d random samples to a neural network architecture (the teacher) and are then presented to another neural network (the student) that is trained using this data, it is interesting to compare the worst case Rademacher bound with the actual generalization error of this student on such synthetic data.
We now consider the error of a typical solution w from the posterior distribution (this is often called the Gibbs rule) for the student. Given the rule is outputting variables, this yields
(32) 
where . Computing can be done within the statistical mechanics approach ([Seung1992, Watkin1993, opper1995statistical, engel2001statistical]) and can be rigourously done as well ([Barbier2017b]). Notice that this error is equal to the Bayes optimal error for the quadratic loss (see as well [Barbier2017b]).
The two optimistic (teacherstudent) and pessimistic (Rademacher) errors can be seen in Fig. 1 for spherical and in Fig. 2 for binary weights. In this case, since a perfect fit is always possible, the training error is zero and the Rademacher complexity is itself the bound on the generalization error. These two figures show how different the worst and teacherstudent case can be in practice, and demonstrate that one should perhaps not be surprised by the fact that the empirical Rademacher complexity does not always give the correct answer [zhang2016understanding], as after all it deals only with worst case scenarios.
5.4 Committee machine with Gaussian weights
Given the large gap between the Rademacher bound and the teacherstudent setting, we can ask wheather we can find a case where the Rademacher bound is void in the sense that the Rademacher complexity is yet generalization is good for the teacherstudent setting? This can be done by moving to twolayer networks. Consider a simple version of this function class, namely the committee machine [engel2001statistical]. It is a twolayer network where the second layer has been fixed, such that only weights of the first layer are learnt. The function class for a committee machine with hidden units is defined by
(33) 
Instead of computing the Rademacher complexity with the replica method, it is sufficient for the purpose of this section to understand its rough behavior. As discussed in sec. 5.1, this requires knowing the Gardner capacity. A generic bound by [Mitchison1989] states that it is upper bounded by . Additionally, the Gardner capacity has been computed by the replica method in [Monasson_1995, urbanczik1997storage, xiong1998storage] who obtained that . We thus expect that
(34) 
To compare with the teacherstudent case, when the labels are produced by a teacher committee machine as
(35) 
the error of the Gibbs algorithm reads
(36) 
where, again , has been computed in a series of papers in statistical physics [Hertz1993, schwarze1993learning], and using the Guerra interpolation method in [Aubin2018]. Interestingly, in this case, one can get an error that decays as as soon as . One thus observes a huge gap between the Rademacher bound that scales as and the actual generalization error for large sample size. This large gap further illustrates the considerable difference in behavior one can get between the worst case and teacherstudent case analysis, see Fig. 3.
5.5 Extension to rotationally invariant matrices
The previous computation for i.i.d data matrix X can be generalized to rotationally invariant (RI) random matrices with rotation matrices , independently sampled from the Haar measure, and a diagonal matrix of singular values. Computation for this kind of matrices can be handled again using the replica method ([Kabashima2008, barbier2018mutual, Gabrie2018]) and leads to RS and 1RSB free energies
(37) 
where each term is properly defined in Appendix B.2. Note that taking a random Gaussian i.i.d matrix, the eigenvalue density follows the MarchenkoPastur distribution and (37) matches free energies eq. (53), (65), and ground states energies eq. (28) in the spherical case. The ground state energy (and therefore the Rademacher complexity) can be again computed as in the i.i.d case, taking the zero temperature limit
(38) 
keeping in particular and finite in the limits .
6 Conclusion
In this paper, we discussed the deep connection between the Rademacher complexity and some of the classical quantities studied in the statistical physics literature on neural networks, namely the Gardner capacity, the groundstate energy of the random perceptron model, and the generalization error in the teacherstudent model. We believe it is rather interesting to draw the link with approaches inspired by statistical physics, and compare its findings with the worstcase results. In the wake of the need to understand the effectiveness of neural networks and also the limitations of the classical approaches, it is of interest to revisit the results that have emerged thanks to the physics perspective. This direction is currently experiencing a strong revival, see e.g. [Chaudhari2016, martin2017rethinking, Advani2017a, BaityJesi2018]. The connection discuss in the paper opens the way to a unified presentation of these often contrasted approaches, and we hope this paper will help bridging the gap between researchers in traditional statistics and in statistical physics. There are many possible followups, the more natural one being the computation of Rademacher complexities from statistical physics methods for more complicated and realistic models of data, starting for instance with correlated matrices discussed in section 5.5.
7 Acknowledgements
This work is supported by the ERC under the European Union’s Horizon 2020 Research and Innovation Program 714608SMiLe, as well as by the French Agence Nationale de la Recherche under grant ANR17CE23002301 PAIL and from the Chaire CFMENS. We thank Henry Pfister for insightful and clarifying discussions that inspired partly this work. We would also like to thank the Kavli Institute for Theoretical Physics (KITP) for welcoming us during part of this research, with the support of the National Science Foundation under Grant No. NSF PHY1748958.
References
Appendix
Appendix A Rademacher scaling of the perceptron
Proof.
Upper bound
For a linear classifier with binary ouputs such as the perceptron, the VC dimension is easy to compute and . Hence we know from Massart theorem’s [massart2000some] that
Lower bound
Let us consider the following estimator (known as the Hebb’s rule [hebb1962organization]): . Hence for a given sample the above estimator outputs
Injecting its expression in the definition the Rademacher complexity eq. (3) one obtains:
As and , . Hence let us define the Gaussian random variable
and compute its two first moments
Hence because of the central limit theorem, in the highdimensional limit . Finally
Noting that
we obtain a lower bound for the Rademacher complexity
∎
Appendix B Replica computation of the perceptron ground state energy
b.1 Gaussian i.i.d matrix
In this section, we present the replica computation of Generalized Linear Models (GLM) corresponding to the hypothesis class in eq. (18). We focus on data drawn from i.i.d distribution , and labels y drawn randomly form . We consider for the moment a generic prior distribution that factorizes, and activation function . Let us define the cost function of a given sample that is 0 if the the estimator classifies the example correctly and 1 otherwise, where . Finally we define the constraint function at inverse temperature , that depends explicitly on the Hamiltonian eq. (11)
(39) 
and note that the constraint function converges at zero temperature to a hard constraint function