G RADIENT
D ESCENT
CAN
L EARN
L ESS
O VERPARAMETERIZED
T WO - LAYER
N EURAL
N ETWORKS
ON C LASSIFICATION P ROBLEMS
Anonymous authors
Paper under double-blind review
A BSTRACT
Recently, several studies have proven the global convergence and generalization abilities of the gradient descent method for two-layer ReLU networks.
Most studies especially focused on the regression problems with the squared loss function, except for a few, and the importance of the positivity of the neural tangent kernel has been pointed out.
However, the performance of gradient descent on classiﬁcation problems using the logistic loss function has not been well studied, and further investigation of this problem structure is possible.
In this work, we demonstrate that the separability assumption using a neural tangent model is more reasonable than the positivity condition of the neural tangent kernel and provide a reﬁned convergence analysis of the gradient descent for two-layer networks with smooth activations.
A remarkable point of our result is that our convergence and generalization bounds have much better dependence on the network width in comparison to related studies.
Consequently, our theory provides a generalization guarantee for less over-parameterized two-layer networks, while most studies require much higher over-parameterization.
I NTRODUCTION
In recent years, many studies have been devoted to explaining the great success of over-parameterized neural networks, where the number of parameters is much larger than that needed to ﬁt a given training dataset.
This study also treats over-parameterized two-layer neural networks using smooth activation functions and analyzes the convergence and generalization abilities of the gradient descent method for optimizing this type of network.
For over-parameterized two-layer neural networks, Du et al.
Arora et al.
; Chizat &
Bach (2018a); Mei et al.
(2018) showed the global convergence of the gradient descent.
These studies are mainly divided into two groups depending on the scaling factor of the output of the networks to which the global convergence property has been demonstrated using different types of proofs.
For the scaling factor 1 /m , ( m : the number of hidden units), Chizat & Bach (2018a); Mei et al.
(2018) showed the convergence to the global minimum over probability measures when m → ∞ by utilizing the Wasserstein gradient ﬂow perspective (Nitanda & Suzuki, 2017) on the gradient descent.
For the scaling factor 1 /m β ( β < 1 ), Du et al.
(2019) essentially demonstrated that the kernel smoothing of functional gradients by the neural tangent kernel (Jacot et al., 2018; Chizat & Bach, 2018b) has comparable performance with the functional gradient as m → ∞ by making a positivity assumption on the Gram-matrix of this kernel, resulting in the global convergence property.
In addition, Arora et al.
(2019) provided a generalization bound via a ﬁne-grained analysis of the gradient descent.
These studies provide the ﬁrst steps to understand the role of over-parameterization of neural networks and the gradient descent on regression problems using the squared loss function.
For the classiﬁcation problems with logistic loss, a few studies (Allen-Zhu et al., 2018a; Cao & Gu, 2019a;b) investigated the convergence and generalization abilities of gradient descent under a separability assumption with a suitable model instead of the positivity of the neural tangent kernel.
In this study, we further develop this line of research on binary classiﬁcation problems.
Our contributions.
We provide ﬁne-grained global convergence and generalization analyses of the gradient descent for two-layer neural networks with smooth activations under a separability
[Table]
assumption with a sufﬁcient margin using a neural tangent model
[Table]
which is a non-linear model with feature extraction through a neural tangent.
We demonstrate that a separability assumption is more suitable than the positivity condition of the neural tangent kernel because (i) the positive neural tangent kernel leads to weak separability and conversely, (ii) separability leads to the positivity of the neural tangent kernel only on a cone spanned by labels, which is very restrictive compared to the whole space.
Therefore, the separability condition is rather weak in this sense but it is enough to ensure global convergence for the classiﬁcation problems.
Thus, a signiﬁcantly better convergence and generalization analyses with respect to network width can be obtained because the positivity of the neural tangent kernel is not required.
Consequently, our theory provides a generalization guarantee for less over-parameterized two-layer networks trained by gradient descent, while most existing results relying on the positive neural tangent kernel essentially require quite high overparameterization.
To the best of our knowledge, there are no successful studies for our problem setting (i.e., less over-parameterized two-layer neural networks with smooth activation functions for the classiﬁcation problems with logistic loss) in the literature.
Most studies have focused on highly over-parameterized neural networks with ReLU activation, and less over-parameterized settings have been considered difﬁcult for showing the global convergence property of gradient descent even in the few studies using a separability condition (Allen-Zhu et al., 2018a; Cao & Gu, 2019a;b).
However, we note that these studies provided global convergence and generalization analyses of the (stochastic) gradient descent for challenging settings (i.e., deep ReLU networks) by making a similar but different assumption than ours.
Thus, our and these studies do not include each other because of the difference of the network structure (i.e., network depth and activation type) and assumptions.
We here describe the main result informally.
A neural tangent model is an inﬁnite-dimensional non-linear model using transformed features ( ∂ θ σ ( θ (0) (cid:62) x ))
θ (0) ∼ µ 0 , where σ is a smooth activation and µ 0 is a distribution used to initialize the parameters of the input layer in two-layer neural networks.
Theorem 1 states that gradient descent can ﬁnd an (cid:15) -accurate solution in terms of the expected classiﬁcation error for a wide class of over-parameterized two-layer neural networks under a separability assumption using a neural tangent model.
Theorem 1 (Informal) .
Suppose that a given data distribution is separable by a neural tangent model with a sufﬁcient margin under L ∞ -constraint.
If for any (cid:15) > 0 , the hyperparameters satisfy one of the following (i
[Equation]
then with high probability over the random initialization and choice of samples of size n , the gradient descent with a learning rate η achieves an expected (cid:15) -classiﬁcation error within T -iterations.
Related work.
A few recent studies (Allen-Zhu et al., 2018a; Cao & Gu, 2019a;b) are closely related to our work because they also treated the logistic loss function.
As stated above, problem settings in our and these studies are somewhat different, but we compare our result with those specialized to two-layer network to show a better property of our problem setting and analyses.
Separability assumptions were made on an inﬁnite-width two-layer ReLU network in Cao & Gu (2019a;b) and on a smooth target function in Allen-Zhu et al.
(2018a).
For generalization analyses, our result exhibits much better dependency on the network width owing to a better problem setting with a ﬁne-grained analysis.
Table 1 provides a comparison of the hyperparameter settings of networks and gradient descent in related studies to achieve an expected (cid:15) -classiﬁcation error.
As evident in Table 1, for more comprehensive sizes of two-layer networks with respect to the network width, our theory ensures the same generalization ability as those of Allen-Zhu et al.
(2018a)
; Cao & Gu (2019a;b). In fact, the network width Ω( (cid:15) − 1 ) and Ω( (cid:15) − 3 / 2 ) are sufﬁcient in our setting.
For the stochastic gradient descent for two-layer networks, Brutzkus et al.
(2018); Li & Liang (2018) provided generalization analyses.
Brutzkus et al.
(2018) assumed that datasets are linear separable and this restrictive assumption was relaxed to mixtures of well separated data distributions in Li & Liang (2018).
However, the analysis in Li & Liang (2018) is also tailored to only highly overparameterized settings.
Concretely, a very large width m = ˜Ω( (cid:15) − 24 ) and the number of samples (iterations) n =
Θ( T ) =
˜ O ( (cid:15) − 12 ) are required to achieve an expected (cid:15) -classiﬁcation error in Li & Liang (2018).
In addition, it should be noted that global convergence analyses (Allen-Zhu et al., 2018b; Zou et al., 2018) in terms of optimization without the speciﬁcation of network size will yield loose generalization bounds because the complexities of neural networks cannot be speciﬁed.
Apart from the abovementioned studies, there are many other studies (Brutzkus & Globerson, 2017;
Zhong et al., 2017; Tian, 2017; Soltanolkotabi, 2017; Du et al., 2019; Zhang et al., 2018; Arora et al., 2019; Oymak & Soltanolkotabi, 2019; Zhang et al., 2019; Wu et al., 2019) that focus on regression problems but our study focuses on classiﬁcation problems and demonstrates a better property of gradient descent for over-parameterized networks by utilizing the problem structure of a binary classiﬁcation.
Especially, we show that a separability assumption is more preferable than the positivity condition of the neural tangent kernel (Du et al., 2019; Arora et al., 2019; Zhang et al., 2019;
Wu et al., 2019) and show that the required network width can be signiﬁcantly reduced.
Concretely, the required network widths are at least Ω( n 6 ) (Du et al., 2019; Wu et al., 2019), Ω( n 7 (cid:15) − 2 ) (Arora et al., 2019), and Ω( n 4 ) (Zhang et al., 2019).
Thus, these widths are very large, as compared to our results because sample complexities are generally slower than or equal to n = Ω( (cid:15) − 2 ) .
P RELIMINARY
Here, we describe the problem setting for the binary logistic regression and discuss the functional gradients to provide a clear theoretical view of the gradient methods for two-layer neural networks.
2. P ROBLEM S ETTING
Let X = R d
and Y be a feature space and the set of binary labels {− 1 , 1 } , respectively.
We denote by ν a true probability measure on X × Y and by ν n an empirical probability measure, deduced from observations ( x i , y i ) n i =1 independently drawn from ν , i.e., dν n ( X, Y ) =
(cid:80) n i =1 δ ( x i ,y i )
( X, Y ) dXdY/n , where δ is the Dirac delta function.
The marginal distributions of ν and ν n on X are denoted by ν X and ν Xn , respectively.
For ζ ∈ R and y ∈ Y , let l ( ζ, y ) be the logistic loss: log(1 + exp( − yζ )) .
Then, the objective function to be minimized is formalized as follows:
[Equation]
where f Θ : X → R is a two-layer neural network equipped with parameters Θ = ( θ r ) mr =1 .
When we consider a function f Θ as a variable of the objective function, we denote L ( f Θ ) def =
L (Θ) .
The two-layer neural network treated in this study is formalized as follows.
For parameters Θ = ( θ r ) m r =1 ( θ r ∈ R d ) and ﬁxed constants ( a r ) m r =1 ∈ {− 1 , [Equation] m :
[Equation]
where m is the number of hidden units, β is an order of the scaling factor, and σ : R → R is a smooth activation function such as sigmoid, tanh, swish (Ramachandran et al.)), and other smooth approximations of ReLU.
In the training procedure, the parameters Θ =
( θ r ) mr =1 of the input layer are optimized.
This setting is the same as those in Du et al.
Arora et al.
; Zhang et al.
; Wu et al.
(2019), except for the types of activation functions, scaling factor, and loss function.
2. F UNCTIONAL G RADIENT
We denote by L 2 ( ν Xn )
the function space from X to R , equipped with the inner product (cid:104)· , [-·(cid:
-]·(cid:105)
L 2 ( ν
[Equation] [Equation]
Following the tradition in the literature of boosting and kernel methods, we call L 2 ( ν Xn ) the function space, although this space is actually an n -dimensional space because the cardinality of the support of ν
Xn is n .
The key notion to explain the behavior of the gradient descent is the functional gradient in this function space L 2 ( ν Xn ) .
We deﬁne the functional gradient at a predictor f : X → R as,
[Equation]
This is simply a Fréchet differential (functional gradient) in L 2 ( ν Xn ) .
That is, it follows that
[Equation]
Therefore, the functional gradient descent using ∇ f L ( f ) directly optimizes L in a function space
L 2 ( ν Xn ) and converges to a global minimum because the objective function L is convex with respect to a function f .
However, because ∇ f L ( f ) contains no information regarding the unseen data, this method is meaningless in terms of generalization.
Thus, some smoothing techniques are required to guarantee the generalization.
The gradient descent method for two-layer neural networks can be recognized as a type of kernel-smoothed functional gradient using the neural tangent kernel (Jacot et al., 2018), and this perspective is signiﬁcantly useful in showing the global convergence because it characterizes the behavior of the vanilla gradient descent in a function space.
B RIEF R EVIEW OF F UNCTIONAL G RADIENT M ETHODS
Functional gradient methods have been mainly studied for gradient boosting (Mason et al., 1999;
Friedman, 2001) and kernel methods (Kivinen et al., 2004; Smale & Yao, 2006; Ying & Zhou, 2006;
Raskutti et al., 2014; Wei et al., 2017) in the machine learning community, but more recently, it has been found to be useful in explaining the behavior of gradient descent for neural networks (Jacot et al., 2018; Chizat & Bach, 2018b; Du et al., 2019; Allen-Zhu et al., 2018b; Arora et al., 2019).
Our analysis is also heavily based on the functional gradient perspective of gradient descent.
Thus, we brieﬂy review the functional gradient methods.
In gradient boosting, ∇ f L ( f ) is approximated by ﬁnding a similar function in weak learners G :
[Equation]
and the gradient method in a function space is performed using a descent direction − φ f .
This approximation is a type of smoothing of functional gradients.
In kernel methods, this smoothing procedure is realized by using the kernel smoothing technique:
[Equation]
where k is a kernel function.
It should be noted that this kernel smoothing (3) is a special case of gradient boosting (2) because of the following equation:
[Equation]
where ( H k , (cid:104) , (cid:105) H k ) is the reproducing kernel Hilbert space associated with a kernel k .
When this kernel smoothing well approximates a functional gradient ∇ f L ( f ) and satisﬁes
[Equation]
the kernel-smoothed functional gradient descent f + ← f − ηT k ∇ f L ( f ) performs like the pure functional gradient descent, leading to the global convergence property because it tends to a stationary point in a function space, which is simply a global minimum.
Recently, several studies (Jacot et al., 2018; Chizat & Bach, 2018b; Du et al., 2019; Allen-Zhu et al., 2018b; Arora et al., 2019) implicitly or explicitly pointed out that the gradient descent for neural networks is essentially recognized as an approximation to the kernel-smoothed functional gradient method using a neural tangent kernel (NTK)
(Jacot et al., 2018):
[Equation]
where µ 0 is a distribution to initialize the parameters of the input layer in this setting.
In most proofs using NTK, the global convergence property has been demonstrated by showing the condition (4) from the positivity of the Gram-matrix H ∞ def = ( k NTK ( x i , x j ))
ni,j =1 and the similarity between the gradient descent and the kernel-smoothed functional gradient with NTK when m → ∞ .
This is a reason why very high over-parameterization is generally required in related studies.
In this study, we found that the positivity of the Gram-matrix of NTK is not required on binary classiﬁcation problems and a separability assumption, which is a weaker condition than the positivity, is enough for global convergence.
Consequently, we can give global convergence and generalization guarantees to a gradient method for less over-parameterized two-layer neural networks.
G LOBAL C ONVERGENCE A NALYSIS OF THE G RADIENT M ETHOD
The following is an update rule of gradient descent with respect to the input parameters
Θ =
( θ r ) mr =1 :
[Equation]
(6) where ∇ Θ L (Θ ( t ) )
= ( ∂ θ r L (Θ ( t ) ))
mr =1 and η > 0 is a learning rate.
We here make the assumption:
Assumption 1.
(A1) Assume that supp( ν X ) ⊂ { x ∈ X | (cid:107) x (cid:107) 2 ≤ 1 } .
Let σ be a C 2 -class function and there exist K 1 , K 2 > 0 s.t.
(cid:107) σ (cid:48)
(cid:107) ∞
≤ K 1 and (cid:107) σ (cid:48)(cid:48) (cid:107) ∞ ≤ K 2 .
(A2) A distribution µ 0 on R d used for the initialization of θ r has a sub-Gaussian tail bound: ∃ A, ∃ b > 0 such that P θ (0) ∼ µ
[ (cid:107) θ (0) (cid:107) 2 ≥ t ] ≤ A exp( − bt 2 ) .
(A3) Assume that the number of hidden units m ∈ Z + is an even number.
Constant parameters ( a r ) mr =1 and parameters Θ (0) =
( θ (0) r )
mr =1 are initialized symmetrically: a r = 1 for r ∈ { 1 , . . .
, m 2 } , a r = − 1 for r ∈ { m 2 + 1 , . . .
, m } , and θ (0)
r = θ (0) r + m 2 for r ∈ { 1 , . . .
, m 2 } , where the initial parameters ( θ (0) r ) m 2 r =1 are independently drawn from a distribution µ 0 .
(A4) Assume that there exist ρ > 0 and a measurable function v : R d → { w ∈ R d | (cid:107) w (cid:107) 2 ≤ 1 } such that the following inequality holds: for ∀ ( x
, y ) ∈ supp( ν ) ⊂
X × Y ,
[Equation]
Remark.
Clearly, many activation functions (sigmoid, tanh, and smooth approximations of ReLU such as swish) satisfy the assumption (A1) .
Typical distributions, including the Gaussian distribution, satisfy (A2) .
The purpose of the symmetrized initialization (A3) is to bound the initial value of the loss function L (Θ (0) ) uniformly over the number of hidden units m .
This initialization leads to f Θ (0) ( x ) = 0 , resulting in L (Θ (0) )
= log(2) .
Assumption (A4) implies the separability of a dataset using the neural tangent model.
We next discuss the validity of this assumption.
4. S EPARABILITY A SSUMPTION (A4) BY THE N EURAL T ANGENT
The explicit feature representation: x → ∂ θ σ ( θ (0) (cid:62) x ) , of NTK (5) is called the neural tangent , which is a non-linear feature extraction from X to an inﬁnite-dimensional space.
That is, assumption (A4) ensures the separability of the transformed data ( ∂ θ σ ( θ (0) (cid:62) r x ) , y ) through the neural tangent for ( x, y ) ∈ supp( ν ) with a margin ρ in an inﬁnite-dimensional space by the weight: v ( θ (0) )
dµ 0 .
We remark that this assumption is somewhat weaker than the positivity assumption on the Gram-matrix of NTK and is satisﬁed in many cases by the universal approximation ability of the neural tangent models.
In addition, we remark that the separability of the training dataset instead of supp( ν ) is enough to guarantee global convergence only for empirical risk minimization.
Theoretical comparison of kernel assumptions.
In previous studies (Du et al., 2019; Arora et al., 2019; Zhang et al., 2019; Wu et al., 2019) the positivity of the Gram-matrix H ∞ =
( k NTK ( x i , x j )) ni,j =1 was required to ensure the condition (4).
Here, we remark that the assumption (A4) is weaker than this positivity condition in the following sense.
Proposition 1.
(i) Assume H ∞ (cid:23) λ 0 I n and (cid:107) σ (cid:48) (cid:107) ∞
≤ K 1 , then there exists a measurable map v : R d → { w ∈ R d | (cid:107) w (cid:107) 2 ≤ 1 } such that ∀ i ∈ { 1 , . .
. , n } ,
[Equation]
(ii) Suppose assumption (A ) holds, then
(cid:80) ni,j =1 ξ i H ∞
ξ j ≥ ρ 2 (cid:107) ξ (cid:107) 22 , ( ∀ ξ ∈ { ( α i y i ) ni
=1 | α i ≥ 0 } )
As seen in Proposition 1-(i), the positivity H ∞ (cid:23) λ
I n leads to weak separability with a margin of
O ( λ 0 /n ) on the training dataset.
Conversely, from Proposition 1-(ii), the separability with a margin of ρ leads to the positivity ρ 2 of H ∞ only on a cone spanned by the labels: { ( α i y i )
ni
=1 | α i ≥ 0 } .
Because this cone is very restrictive, this limited positivity is much weaker than the positivity on the whole space.
However, we found that this limited positivity is sufﬁcient to ensure the global convergence of the gradient descent for binary classiﬁcation problems with logistic loss.
Indeed, from Proposition 3, the positivity of H ∞ is required only along the functional gradients: ∇ f L ( f Θ )( x i ) =
∂ ζ l ( f Θ ( x i ) , y i ) , and these functional gradients are always contained in this limited space, unlike the squared loss function.
This is a reason why the positivity of NTK is not required for the binary classiﬁcation problem with logistic loss.
Thus, a much better convergence and generalization ability can be shown for logistic loss than the previous results that relied on the positivity of H ∞ because the positivity of NTK on the whole space is redundant and a separability condition provides a better positivity only on a required small space.
Concretely, from Proposition 1-(i), we can immediately check a deteriorated convergence result depending on the positivity of H ∞ by replacing ρ in Theorem 2 with O ( λ 0 /n ) , producing m =
O ( nλ − 1 0 (cid:15) − 1 ) when β = 0 .
Universal approximation property of neural tangent models.
We consider the case where all feature vectors have a common bias term: x = ( x 0 , . . .
, x d − 1 , s ) ∈ X ( s > 0 is a sufﬁciently small constant for a bias term).
In this case, we can easily conﬁrm that neural tangent models include typical two-layer inﬁnite-width neural networks with activation σ (cid:48) :
E [ w ( θ (0) ) σ (cid:48)
( θ (0) (cid:62) x )] by setting v ( θ (0) )
= (0 , . .
. , 0 , w ( θ (0) ))
, where w is a real-valued function.
Thus, Assumption (A.4) with a certainly positive constant ρ is satisﬁed as long as a data distribution is separable by an inﬁnite-width two-layer network with mild weights w ( θ ) . Moreover, we note that these networks have the universal approximation property (Hornik, 1991; Sonoda & Murata, 2017), so that there are a lot of examples such that the assumption (A4) is satisﬁed.
4. M AIN R ESULTS
We here deﬁne the L 1 -norm of the functional gradient, which measures the convergence.
[Equation]
Here, ζ is the ﬁrst variable of l and p Θ ( Y = 1 | x ) = [Equation] + [Equation]
[Equation]
f [Equation] ( x )) is a conditional probability on Y = 1 , deﬁned by f Θ .
Because (cid:107)∇ f L ( f Θ ) (cid:107) L 1 ( ν Xn ) is simply a gap between the labels and conditional label probabilities of the model, this norm is a reasonable measure for the binary classiﬁcation problems.
The following is the ﬁrst main result to ensure global convergence.
Theorem 2 (Global Convergence) .
Suppose Assumption 1 holds.
Set K
= K
+ 2 K 21 K 2 + K 41 K 22 .
For ∀ β ∈ [0 , 1) , ∀ δ ∈ (0 , 1) and ∀ m ∈ Z + such that m ≥ 16 K 21 ρ 2 log 2 n δ , consider gradient descent (6) with a learning rate of 0 < η ≤ min (cid:110) m β , 4 m 2 β − 1 K 21 + K 2 (cid:111) and the number of iterations
T ≤ (cid:106)[-mρ 
-]
[Equation]
Then, it follows that with probability at least 1 − δ over the random initialization,
[Equation]
We here derive a corollary, which states that an arbitrary small empirical classiﬁcation error can be achievable by appropriately setting η, m, and T as follows.
From Markov’s inequality,
[Equation]
where we used the following relationship:
[Equation]
Thus, a convergence rate of (cid:107)∇ f L [-( f Θ ( t ) ) (cid:107) 
-][Equation] [Equation]
[Equation] Xn ) leads to a rate of empirical classiﬁcation error.
Corollary 1.
Suppose the same assumptions as in Theorem 2 hold.
If for ∀ (cid:15), δ > 0 , the hyperparameters satisfy
[Equation]
then with probability at least 1 − δ , gradient descent (6) with a learning rate of η ﬁnds a parameter Θ ( t ) satisfying P ( X,Y ) ∼ ν n [ Y f Θ ( t ) ( X ) ≤ 0] ≤ (cid:15) within T -iterations. Utilizing this theorem, we can show the convergence of the loss function which leads to a better result at the price of slight increase of the network width. Theorem 3. Suppose the same assumptions in Theorem 2 hold.
Then there exists a uniform constant
C > 0 such that for 0 < ∀ α ≤ ρ 4 K 2 , with probability at least 1 − δ ,
[Equation]
Corollary 2.
Suppose the same assumptions as in Theorem 3 hold and ρ > 1 for simplicity.
Then there exists a uniform constant C > 0 and the following statement holds.
If for any (cid:15) > 0 , the hyperparameters satisfy
[Equation]
then with probability [Equation] [Equation] for 0 < ∀ T ≤ T ∗
[Equation]
This corollary is obtained immediately from Theorem 3 by setting α = Θ( (cid:15) 3 / 2 ) .
The convergence of classiﬁcation error also derived from the corollary because L ( f θ ) ≥ (cid:107)∇ f L ( f Θ ( t ) )
(cid:107) L 1 ( ν Xn )
and it also derives a sharper bound on the distance (cid:107) Θ ( T ) − Θ (
[Equation]
Proposition 2.
Suppose the same assumption and consider the same hyperparameter setting as in
Corollary 2. Then, there exists a uniform constant C such that with probability 1 − δ , [Equation] Moreover, by combining Theorem 2 and Corollary 2 with the well-known margin bound (Koltchinskii & Panchenko, 2002; Mohri et al., 2012; Shalev-Shwartz & Ben-David, 2014) on the expected classiﬁcation error and by specifying the Rademacher complexity of the function class attained by gradient descent, we can obtain the second main result for the generalization ability of gradient descent.
Theorem 4 (Generalization Bound) .
Suppose Assumption 1 holds.
Set K
= K
+ 2 K 21 K 2 + K 41 K 22 .
Fix ∀ γ > 0 .
Consider the gradient descent (6) with a general hyperparameter setting in Theoremor a speciﬁc setting in Corollary 2, with δ ∈ (0 , 1) .
For these cases, we set parameters C [-> 
-]η,m,T and
D η,m,T as follows:
[Equation]
case [Equation] For the latter case, we assume ρ ≥ 1 . {+Then, there exists a uniform constant C > 
+}
and it follows that with probability at least 1 − 3 δ over a random initialization and random choice of dataset S ,
[Equation]
Moreover, when σ is convex and σ (0) =
[Equation]
we can avoid the dependence with respect to the dimension d . With probability at least 1 − 3 δ over a random initialization and random choice of dataset S
[Equation]
This theorem provides an upper-bound on an expected classiﬁcation error with high probability for a network obtained by gradient descent within T -iterations.
There is a trade-off between the optimization and complexity terms in (9), (10) with respect to η, m, and T .
However, there are several choices of these hyperparameters to achieve a desired precision (cid:15) of the expected classiﬁcation error.
Corollary 3.
Suppose the same assumptions as in Theorem 4 hold.
If for any (cid:15) > 0 , the hyperparameters satisfy one of the following (i) β ∈ [0 , 1) , m = Ω( ρ − 2 1 − β (cid:15) − 1 1 − β ) , T =
[Equation]
( ρ − 2 (cid:15) − 2 ) , η = Θ( ρ − 2 (cid:15) − 2 T − 1 m 2 β − 1 ) , n = ˜Ω( ρ − 2 (cid:15) − 4 ) , (ii) β
= 0 , m = Θ( (cid:15) − 3 / 2 log(1 /(cid:15) ))
, T = Θ( (cid:15) − 1 log 2 (1 /(cid:15) )) , η = Θ( m − 1 ) , n = ˜Ω( (cid:15) − 2 ) , then with probability at least 1 − δ , the gradient descent (6) with a learning rate of η ﬁnds a parameter Θ ( t ) satisfying P ( X,Y ) ∼ ν
[ Y f Θ ( t ) ( X ) ≤ 0] ≤ (cid:15) within T -iterations.
This corollary can be immediately proven by substituting the concrete values of β, m, T, η, and n into the right hand side of inequalities (9), (10) and by checking that this hyperparameter setting satisﬁes the conditions required in Theorem 4.
The Landau notations are applied with respect to (cid:15), ρ → 0 .
From Corollary 3, for an arbitrary small (cid:15) > 0 , an expected (cid:15) -classiﬁcation error is achieved by the gradient descent within O (1 /(cid:15) 2 ) -or O (1 /(cid:15) )
-iterations when the transformed data distribution by the neural tangent: ( ∂ θ ( θ (0) (cid:62) r · ))
θ ∼ µ 0 is separable in the inﬁnite-dimensional space L 2 ( µ 0 ) under the L ∞ -constraint with a sufﬁcient margin ρ .
In comparison to the result in Allen-Zhu et al. (2018a);
Cao & Gu (2019a;b), which also derived a generalization bound by making a similar separability assumption using a ReLU network or a smooth target function instead of the tangent model, our result has much better dependency on the network width and can explain the generalization ability for a less over-parameterized two-layer network, as summarized in Table 1.
However, we note that their theories cover deeper networks and are not included in our theory because of the difference of the problem settings (e.g., network depth and the type of activation functions).
To reduce the network width, the best choice of β ∈ [0 , 1) is β = 0 for the ﬁrst setting, leading to a small network width m = Ω( (cid:15) − 1 ) .
We note that an arbitrary large width is also covered by this result.
4. P ROOF I DEA
In this section, we provide a proof idea for Theorems 2, 3, and 4.
We introduce two important propositions that connect the gradient descent with the functional gradient descent to justify an intuitive explanation in Section 3.
Proposition 3-(i) states that the gradient descent method is certainly similar to the kernel smoothed gradient methods by the neural tangent kernel when a parameter Θ is sufﬁciently close to a stationary point and the learning rate η is sufﬁciently small, and Proposition 3-(ii) states that the loss landscape is almost convex with respect to the parameter when f Θ is sufﬁciently close to a stationary point in the function space.
Here, We deﬁne an approximated neural tangent kernel: k Θ depending on the parameters Θ as follows:
[Equation]
This kernel is actually an approximation to the vanilla NTK as follows:
[Equation]
Proposition 3.
Suppose assumption (A1) holds and β ∈ [0 , 1) . (i)
We set Θ + = Θ − η ∇ Θ L (Θ) and K = K 21 + 2 K 2 + K 21 K 22 .
If η ≤ m β , then
[Equation]
(ii) It follows that for Θ =
( θ r ) mr =1 and Θ ∗ =
( θ ∗ r ) mr =1 , (
[Equation] R d ) [Equation] The next proposition states that the kernel smoothed gradients have comparable optimization ability to pure functional gradients in terms of minimizing the L 1 -norm around an initial parameter Θ (0) .
We deﬁne the (cid:107) · (cid:107) 2 , 1 -norm in the parameter space Θ =
( θ r )
mr =1 as (cid:107) Θ (cid:107) 2 , 1 def = (cid:80) mr =1 (cid:107) θ r (cid:107) 2 .
Proposition 4.
Suppose Assumption 1 holds.
For ∀ δ ∈ (0 , 1) and ∀ m ∈ Z + , such that [Equation] ρ 2 log 2 nδ , the following statement holds with probability at least 1 − δ over the random initialization of Θ (0) =
( θ (0) r )
mr =1 .
If (cid:107) Θ − Θ (0) (cid:107) 2 , 1 ≤ mρ 4 K 2 , then
[Equation]
This proposition is specialized to binary classiﬁcation problems because the positivity of the Grammatrix is required for regression problems to make a similar statement as discussed earlier.
Combining these two propositions, we can connect the gradient descent with the functional gradient descent and show the global convergence (Theorem 2) which with the almost convexity (Proposition 3-(ii)) is also used to derive the convergence rate for the loss function (Theorem 3).
In addition, applying a well-known result (Koltchinskii & Panchenko, 2002), we can derive a skeleton of a generalization bound (Theorem 4) composed of the margin distribution and Rademacher complexity.
As for the margin distribution, the upper bound is obtained by Theorem 2 and 3.
As for ways to bound Rademacher complexity, please see the Appendix.
C ONCLUSION
In this paper, we have provided reﬁned global convergence and generalization analyses of the gradient descent for two-layer neural networks with smooth activations on binary classiﬁcation problems.
The key in our analysis is the separability assumption by a neural tangent model and we have explained the reasonability of this assumption in comparison to the positivity of NTK.
Consequently, theoretical justiﬁcation has been provided for less over-parameterized neural networks.
However, our theory is restricted to the deterministic gradient descent and two-layer networks; hence, its possible extensions to stochastic gradient descent and deep neural networks are also interesting.
Another possible future study is to relax the positivity assumption on the Gram-matrix for regression problems by utilizing our theory and conducting further investigations of the trajectory of gradient descent, such as the shortest pass analysis (Oymak & Soltanolkotabi, 2018)
A PPENDIX A R ELATIONSHIP BETWEEN K ERNEL A SSUMPTIONS
Proof of Proposition 1.
We here prove the statement (i).
Since H ∞ is invertible we set w =
( H ∞ ) − 1 ( y 1 , · · · , y n ) (cid:62) and set v ( θ (0) )
= n (cid:88)
j = ∂ θ σ ( θ (0) (cid:62) x j ) w j .
Then, we get
[Equation]
We can bound the norm of (cid:107) v ( θ (0) )
(cid:107) 2 as follows:
[Equation]
Thus, by resetting v ( θ (0) ) ← λ 0 v ( θ (0) ) nK, we conclude the statement (i).
We next prove the statement (ii).
For ξ =
( α i y i ) ni
=
( α i > 0 ), n (cid:88) i,j =
[Equation]
=
[Equation]

 [Equation] [Equation]
µ 
[Equation]
n
[Equation]
[Equation] i
[Equation] [Equation]

[Equation] [Equation]
[Equation] [Equation] where we used (cid:107) v ( θ (0) )
(cid:107) 2 ≤ 1 for the ﬁrst inequality, the convexity of (cid:107) · (cid:107)
and Jensen’s
inequality for the second inequality, Assumption (A4) for the third inequality, and (cid:107) · (cid:107) 2 ≤ (cid:107) · (cid:107) 1 for the last inequality. Thus, we ﬁnish the proof of the statement (ii).
B A UXILIARY R ESULTS
In this section, we introduce several existing results for proving our statements.
We ﬁrst describe the
Hoeffding’s inequality.
Lemma 1 (Hoeffding’s inequality) .
Let Z, Z 1 , . . .
, Z m be i.i.d.
random variables taking values in [ − a, a ] for a > 0 .
Then, for any (cid:15) > 0 , we get
[Equation]
We here deﬁne the covering number as follows.
Deﬁnition 1 (Covering Number) .
Let ( V, (cid:107) · (cid:107) ) a metric space.
A subset ˆ U ⊂ V is called an (cid:15) -(proper) cover of V if for ∀ v ∈ V , there exists v (cid:48)
∈
ˆ U such that (cid:107) v − v (cid:48) (cid:107) < (cid:15) .
Then, (cid:15) -covering number N ( V, (cid:15), (cid:107) · (cid:107) ) of V is deﬁned as the cardinally of the smallest (cid:15) -cover of V , that is,
N ( V, (cid:15), (cid:107) · (cid:107) ) def =
min {| ˆ U | |
ˆ U is an (cid:15) -cover of V } .
The following lemma provide a bound on the Rademacher complexity by Dudley’s integral.
For a real-valued function class F over X and a subset X = ( x i ) ni =1 , F| X is deﬁned as { ( h ( x i ))
ni =1 ∈ R n | h ∈ F} ⊂ R n , and F|
X can be equipped with (cid:107) · (cid:107) ∞ -norm over X .
Lemma 2 (Bartlett et al.
Let F be a class of real-valued functions taking values in [0 , 1] from X and assume 0 ∈ F .
For examples ∀ X
= ( x i ) ni
=1 of size n , we get (cid:60) [Equation] ≤ inf [Equation]
(cid:18)
[Equation]
(cid:112) [Equation] [Equation] Note that we reformulate the statement in Lemma 2 from (cid:107) · (cid:107) 2 -covering to (cid:107) · (cid:107) ∞ -covering.
C P ROOFS OF M AIN R ESULTS
In this section, we give an outline of proofs of Theorem 2 and 4.
Global convergence.
We ﬁrst introduce two important propositions which connects gradient methods with functional gradient methods.
The following proposition states that gradient descent methods become similar to kernel smoothed gradient methods by the neural tangent kernel when a parameter Θ is sufﬁciently close to a stationary point and a learning rate η is sufﬁciently small.
Proposition 5 (Restatement of Proposition 3) .
Suppose assumption (A1) holds and β ∈ [0 , 1) . (i)
We set Θ + = Θ − η ∇ Θ L (Θ) and K = K 21 + 2 K 2 + K 21 K 22 .
If η ≤ m β , then
[Equation]
(ii) It follows that for Θ =
( θ r ) mr =1 and Θ ∗ =
( θ ∗ r ) mr =1 , (
[Equation]
r
[Equation] ∗ r ∈ R d ) , [Equation] The next proposition states that kernel smoothed gradients have comparable optimization ability to pure functional gradients in terms of the L 1 -norm around an initial parameter Θ (0) .
We introduce the (cid:107) · (cid:107) 2 , 1 -norm in the parameter space Θ =
( θ r )
mr =1 as (cid:107) Θ (cid:107) 2 , 1 def = (cid:80) mr =1 (cid:107) θ r (cid:107) 2 .
Proposition 6 (Restatement of Proposition 4) .
Suppose Assumption 1 holds.
For ∀ δ ∈ (0 , 1) and ∀ m ∈ Z + , such that m ≥ 16 K 21 ρ 2 log 2 nδ , the following statement holds with probability at least 1 − δ over the random initialization of Θ (0) =
( θ (0) r )
mr =1 .
If (cid:107) Θ − Θ (0) (cid:107) 2 , 1 ≤ mρ 4 K 2 , then (cid:104)∇
[Equation]
This proposition is specialized to binary classiﬁcation problems because the positivity of the Grammatrix is needed for regression problems in order to make a similar statement as discussed earlier.
We specify the possible number of iterations of gradient descent (6) such that Θ ( t ) can remain in the neighborhood: { Θ | [Equation]
Proposition 7.
Suppose Assumption (A1) and (A3) hold.
Consider gradient descent (6) with learning rate 0 < η < 4 m 2 β − 1 K 21 + K 2 and the number of iterations T ∈
Z + .
Then,
[Equation]
Especially, we get (cid:107) Θ ( T ) − Θ (0) (cid:107) 2 ≤ (cid:112) 2 ηT log(2) .
As a result, gradient descent can be performed for (cid:106)
[Equation]
-iterations within { Θ | (cid:107)
[Equation]
This proposition provides a bound on the distance (cid:107) Θ ( T ) − Θ (0) (cid:107) 2 , but we note that this bound will be further sharpened after showing the convergence of the loss function (see Proposition 2).
From Proposition 5, 6, and 7, we notice that the gradient descent for L (Θ) performs like a pure functional gradient descent up to O (cid:16) mρ 2 η (cid:17) -iterations, resulting in signiﬁcant decrease of loss functions.
We next provide the proof of Theorem 2 based on this idea.
Proof of Theorem 2.
From Proposition 7, the assumption in Proposition 6 regarding Θ is satisﬁed.
Thus, Proposition 5 and 6 state that for t ∈ { 0 , . .
, T − 1 } ,
[Equation]
Summing this inequality over t ∈ { 0 , . .
, T − 1 } and multiplying by 4 m 2 β − 1 ηρ 2 T , we have
[Equation]
Applying L (Θ (0) ) =
log(2) and inequality (12)
, we complete the proof.
Proof of Theorem 3.
We set τ ∗ = (cid:16) αa r v ( θ (0) r ) (cid:17) m r =1 and Θ ∗ =
Θ (0) + τ ∗ .
Clearly, we have [Equation] As shown in Proposition [Equation]
we get
[Equation]
In addition
[Equation]
as shown in Proposition
[Equation]
since m ≥ 16 K 21 ρ 2 log 2 nδ , the inequality (21) holds with probability at least 1 − δ .
Hence
[Equation]
we have for ∀ i ∈ { 1 , . . . , n } ,
[Equation]
Thus
[Equation]
the loss at a reference point Θ ∗ can be bounded as follows:
[Equation]
[Equation]
From Theorem 2, Proposition 5-(ii), Proposition 7 and inequalities (13), (14), it follows that ∃ C 1 , ∃ C 2 > 0 , ∀ T ≤ T ,
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
[Table]
[Equation]
Finally, we bound the average of ∇ Θ L (Θ ( t ) )
(cid:62) (Θ ( t ) − Θ ∗ ) .
Because − 2 a (cid:62) b = (cid:107) a (cid:107) 22 + (cid:107) b (cid:107) 22 −(cid:107) a + b (cid:107)for real vectors a, b , we get by setting a = − η ∇ Θ L (Θ ( t ) ) and b = Θ ( t ) − Θ ∗ ,
T
T −
[Equation]
Thus, we get that ∃ C > 0 ,
T
T − 1 (cid:88)
[Equation]
We next prove Proposition 2 that gives a sharper bound on (cid:107) Θ ( T ) − Θ (0) (cid:107) .
Proof of Proposition 2.
Let L ∈ Z
+ be a positive integer such that for T
= O ( (cid:15) − 1 log 2 (1 /(cid:15) )) , 2 L ≤ T < 2 L +1 .
Clearly, L ≤ log 2 T .
From Corollary 2, we get for l ∈ { 1 , . . .
, L }
[Equation]
Therefore, there exist 2 l − 1 ≤ ∃ s l < 2 l for l ∈ { 1 , . . .
, L } such that
[Equation]
From the similar argument to the proof of Proposition 7, we get for a < b ∈ Z + ,
[Equation]
Thus, it follows that since s 1 = 1 , (cid:107)∇ Θ L (Θ (0) ) (cid:107) 2 ≤ √ mK 1 by (19), and 2 l +1 − 2 l − 1 + 1 ≤ 2 l +1 ,
[Equation]
[Equation]
t =
[Equation]
Hence, by setting speciﬁc values of η, T, and m in Corollary 2, we get that ∃ C (cid:48) > 0 ,
[Equation] Generalization bound. A generalization bound can be derived by utilizing the standard analysis of the Rademacher complexity (Koltchinskii & Panchenko, 2002).
We here introduce a function class to be measured by the Rademacher complexity.
Let l γ ( v ) ( γ > 0 ) be the ramp loss:
[Equation]
v ) def = (cid:40)( v < 0) , 1 − v/γ (0 ≤ v ≤ γ ) , ( v > γ ) .
Then, a class of all possible ramp losses over X × Y attained by the gradient descent (6) up to
T -iterations is deﬁned as follows:
Ω η,m,T def = (cid:8) Θ | (cid:107) Θ − Θ (0) (cid:107) 2 ≤ D η,T,m (cid:9) ,
[Equation]
,m,
[Equation]
Here, D η,T,m is set to be (cid:112) 2 ηT log(2) when considering a general hyperparameter setting in
Theorem 2 and is set to be a sharper bound in Proposition 2: Ω( (cid:15) 3 / 4 log 2 (1 /(cid:15) ))
when considering a speciﬁc hyperparameter setting in that proposition.
For a given dataset S = ( x i , y i ) ni
=1 , the Rademacher complexity is deﬁned by (cid:60) ( F γη,m,T | S )
def = n − 1 E [sup h ∈F γη,m,T (cid:80) ni
=1 (cid:15)
i h
( x i , y i )] , where the expectation is taken over the Rademacher random variables ( (cid:15) i ) ni
=1 which are i.i.d.
with probabilities P [ (cid:15) i = 1] = P [ (cid:15) i = − 1] = 0 .
The following well-known result (Koltchinskii & Panchenko, 2002; Mohri et al., 2012; Shalev-Shwartz & BenDavid, 2014) provides a bound on the expected classiﬁcation error based on the empirical margin distribution and the Rademacher complexity.
The empirical margin distribution for S is deﬁned as the ratio of examples satisfying y i f Θ ( x i ) ≤ γ in S .
Lemma 3 (Koltchinskii & Panchenko (2002); Mohri et al.
(2012); Shalev-Shwartz & Ben-David (2014)) .
Let ∀ n ∈ Z + , ∀ γ > 0 , ∀ η > 0 , ∀ m ∈
Z + , ∀ T ∈
Z + , and ∀ δ ∈ (0 , 1) .
Then, with probability at least 1 − δ over the random choice of S of size n , every Θ ∈ Ω η,m,T satisﬁes P
[Equation]
To instantiate this bound, we have to provide upper bounds on the empirical margin distribution and the Rademacher complexity.
We ﬁrst give a bound on the Rademacher complexity.
Proposition 8.
Suppose Assumption (A1) and (A2) hold.
Let ∀ γ > 0 , ∀ η > 0 , ∀ m ∈
Z + , ∀ T ∈
Z + , ∀ δ ∈ (0 , 1) , and ∀ S be examples of size n .
Then, there exists a uniform constant C > 0 such that with probability at least 1 − δ with respect to the initialization of Θ (0) ,
[Equation]
Moreover, when σ is convex and σ (0) = 0 , we can avoid the dependence with respect to the dimension d .
With probability at least 1 − δ over a random initialization of Θ (0) ,
[Equation]
b (cid:19) .
Proof of Theorem 4.
We prove this theorem by instantiating inequality (16).
Let (Θ ( t ) )
T − 1 t =0 be a sequence obtained by the gradient descent (6).
Because (Θ ( t ) )
T − 1 t =0 is contained in Ω η,m,T , as indicated in Proposition 7, inequality (16) holds for this sequence.
As for the Rademacher complexity in (16), we can utilize Proposition 8.
Thus, the resulting problem is to prove the convergence of the empirical margin distribution: P ( X,Y ) ∼ ν n [ Y f Θ ( t ) ( X ) ≤ γ ] .
We here give its upper-bound below.
[Equation]
Therefore, from Markov’s inequality,
[Equation]
Combining this inequality with Lemma 3, then for ∀ t ∈ { 0 , . .
, T − 1 } ,
P [Equation] X,Y )
[Equation]
Noting that η, m, and T satisfy the conditions in Theorem 2, we can complete the proof by taking the average over t ∈ { 0 , . .
, T − 1 } and applying Proposition 8 and Theorem 2.
D P ROOFS FOR G LOBAL C ONVERGENCE D. P ROOF OF P ROPOSITION
Proof of Proposition 5.
We ﬁrst show the smoothness of f Θ ( x ) with respect to Θ for ∀ x ∈ X , ( (cid:107) x (cid:107) 2 ≤ 1) .
Noting that ∇ 2Θ f Θ ( x ) =
diag (cid:0) 1 m β a r σ (cid:48)(cid:48)
( θ (cid:62) r x ) xx (cid:62) (cid:1) m r =1 , we get for τ = ( τ r ) mr =1 such that
(cid:80)
[Equation]
This means that for τ = ( τ r ) mr =1 , ( τ r ∈ R d ) ,
[Equation]
Let us deﬁne g x ( τ ) as the second-order term of Taylor’s expansion of f Θ ( x ) with respect to Θ :
[Equation]
From the inequality (17), we have | g x ( τ ) | ≤ K 2 (cid:107) τ (cid:107) 22 m β .
Then, by the smoothness of l ( ζ, y ) with respect to ζ and | ∂ 2 ζ l ( ζ, y ) | ≤ 1 / 4 , we get
[Equation]
By the triangle inequality, we get
[Equation]
where for the second inequality, we used | ∂ ζ l ( ζ, y ) | ≤ 1 and for the last inequality, we used (cid:107)∇ Θ f Θ
[Equation]
x )
[Equation]
We here set τ = − η ∇ Θ L (Θ) .
The right hand side of (18) is upper bounded by
[Equation]
Therefore, we get
[Equation]
where we used β ∈ [0 , 1) and η ≤ m β for the last inequality.
[-= (cid:32)n n (cid:88) i = | ∂ ζ l ( f Θ ( x i ) , y i ) |(cid:107) ∂ θ r f Θ ( x i ) (cid:107)(cid:33)≤ (cid:32)n n (cid:88) i = | ∂ ζ l ( f Θ ( x i ) , y i ) | (cid:33) 2 m (cid:88) r = (cid:18) max j ∈{ 1 ,...,n } (cid:107) ∂ θ r f Θ ( x j ) (cid:107)(cid:19)= (cid:107)∇ f L ( f Θ ) (cid:107) 
 L 1 ( ν Xn ) m (cid:88) r-]Noting that from the deﬁnition of kernel smoothing of functional gradients (3), we see
[Equation]
Therefore, by taking the expectation of (20) according to the empirical distribution ν n , we get
[Equation]
This completes the proof of the statement (i). From the convexity of l ( ζ
[Equation]
y ) with respect to ζ
[Equation]
we have
[Equation]
where we used | g X (Θ ∗ − Θ) | ≤ K
[Equation]
22 m β .
Thus
[Equation]
by taking the expectation with respect to ( X, Y ) ∼ ν n
[Equation]
we get
[Equation]
) (cid:107) Θ ∗ − Θ (cid:107)
[Equation]
This ﬁnishes the proof of the statement (ii).
D. P ROOF OF P ROPOSITION
Proof of Proposition 6.
Set Z r,i def =
y i ∂ θ σ ( θ (0) r x i ) (cid:62) v ( θ (0) r ) .
We ﬁnd clearly | Z r,i | ≤ K 1 from
Assumption 1.
By applying Hoeffding’s inequality to Z r,i for each i ∈ { 1 , . . . , n } and taking an union bound, we have
[Equation]
In other words, since m ≥ 16 K 21 ρ 2 log 2 nδ , we have with probability 1 − δ ,
[Equation]
Therefore, using Assumption 1 (A4) and noting Θ (0) =
( θ r ) mr =1 is symmetrically initialized, we get with probability 1 − δ for ∀ i ∈ { 1 , . . . , n } , [Equation]
[Equation]
In the following proof, we assume Θ (0) =
( θ (0) r ) mr =1 satisﬁes this inequality.
We get from the
K 2 -Lipschitz continuity of σ (cid:48) that for Θ =
( θ r ) mr =1 satisfying (cid:107) Θ − Θ (0) (cid:107) 2 , 1 ≤ mρ 4 K 2 ,
[Equation]
This means that there exists ( v r ) mr =1 such that (cid:107) v r (cid:107) 2 ≤ 1 ( ∀ r ∈ { 1 , . . .
, m } ) and for ∀ Θ
= ( θ r ) mr = satisfying (cid:107) Θ − Θ (0) (cid:107) 2 , 1 ≤ mρ
[Equation]
[Equation]
Then, we get the following bound: for ∀ ( α i ) ni
=
( α i ∈ (0 , 1)) ,
[Equation]
[Equation]
Noting that ∇ f L ( f Θ )( x i ) =
− y i 1+exp( y i f
Θ
( x i )) , we get
[Equation]
where we used (cid:107) v r (cid:107) 2 ≤ 1 for the ﬁrst inequality, the convexity of (cid:107) · (cid:107) 22 for the second inequality, and (22) for the last inequality.
We can ﬁnd that this inequality ﬁnishes the proof because
[Equation]
D. P ROOF OF P ROPOSITION
The proof of Proposition 7 is based on the traditional convergence analysis of gradient descent for smooth objective functions in ﬁnite-dimensional space.
Proof of Proposition 7.
We ﬁrst specify the smoothness of the logistic loss function.
We set φ ( v ) =
log(1 + exp( − v )) and l ( y, f Θ ( x ))
=
φ ( yf Θ ( x )) .
By the simple calculation [Equation] we get that for r, s ∈ { 1 , . . .
, m } ,
[Equation]
Noting that (cid:107) φ (cid:48) (cid:107) ∞
≤
and (cid:107) φ (cid:48)(cid:48) (cid:107) ∞ ≤ 14 , we can see that the maximum eigen-value of ( ∂ 2 l ( y, f Θ ( x )) /∂θ
r ∂θ s ) mr,s =1 is upper bounded by
[Equation]
Indeed, for v = ( v r ) mr =1 such that
(cid:80) mr =1 (cid:107) v r (cid:107) 22 ≤ 1 , ( v r ∈ R d ), we have m (cid:88) r,s =
[Equation]
Therefore, the loss function L (Θ) is M -Lipschitz smooth with respect to Θ , that is, for
[Equation]
Plugging Θ = Θ ( t ) and Θ (cid:48)
=
Θ ( t +1) =
Θ − η ∇ Θ L (Θ ( t ) ) into this inequality, we get
[Equation]
where we used η ≤ 1 /M for the last inequality.
By summing this inequality over t ∈ { 0 , . . .
, T − 1 } and multiplying by 2 ηT , we get
[Equation]
where we used L (Θ (0) )
= log(2) .
Therefore, we have that from equation (23),
[Equation]
The last statement of Proposition 7 immediately follows from this and the following inequality.
[Equation]
E P ROOFS FOR G ENERALIZATION B OUNDS
Proof of Proposition 8.
In this proof, we denote F = F γη,m,T and Ω = Ω η,m,T for simplicity.
We deﬁne F y def
= { h ( · , y ) :
X → [0 , 1] | h ∈ F} .
Then, for a given dataset S =
( x i , y i ) ni
=1 , we notice that (cid:60) ( F| S ) ≤ (cid:60) ( F 1 | X ) + (cid:60) ( F − 1 | X ) , where X
=
( x i ) ni =1 .
Thus, it is enough to provide an upper bound on (cid:60) ( F 1 | X ) because a bound on the other complexity can be also derived in the same way.
We ﬁrst give a uniform high probability bound on the initialization (cid:107) θ (0) r (cid:107) 2 for ∀ r ∈ { 1 , . . .
, m } .
We get from (A2) , for t > 0 ,
[Equation]
Thus, by choosing t so that δ = mA exp( − bt 2 ) , we conﬁrm that with probability at least 1 − δ ,
[Equation]
We introduce several notations.
Fix R 0 > 0 .
We denote θ =
( θ, θ (cid:48) )
∈ R 2 d , ( θ, θ (cid:48) ∈ R d ) and, deﬁne for θ ,
[Equation]
When θ = θ (cid:48) , we deﬁne g θ ( x ) = 0 .
From the Lipschitz continuity of σ , the range of g θ is [ − K 1 , K 1 ] .
Moreover, we deﬁne
[Equation]
Clearly, we see Ω = Ω −
[Equation]
Ω + and (cid:8) g θ | θ ∈ Ω (cid:9) =
G − ∪ G +
[Equation] From the Lipschitz continuity of l γ , we ﬁnd (cid:60) ( F 1 | X ) ≤ γ − 1 (cid:60) ( H| X ) .
We now derive an upper bound on the Rademacher complexity.
Set C M def = m 12 − β D η,m,T .
[Equation]
where we used the fact that f Θ (0) ( x i ) is a constant in the expectation for the second equality.
Since, for Θ ∈ Ω , m
[Equation]
equation (24) can be upper-bounded by the Rademacher complexity of the convex hull.
Hence,
[Equation]
We used that for Θ ∈ Ω , ( θ r , θ (0) r ) ∈ Ω ( ∀ r ∈ { 1 , . . .
, m } )
because (cid:107) Θ − Θ (0) (cid:107) 2 ≤ D η,m,T .
Moreover, the term a r disappeared by the symmetry.
We used the fact that the convex hull of a hypothesis class does not increase the Rademacher complexity for the ﬁrst equality.
We next derive an upper bound on the Rademacher complexity (cid:60) ( G + | X ) through the covering number
N ( G + | X , (cid:15), (cid:107) · (cid:107) ∞ ) and Lemma 2.
To this end, we investigate the sensitivity of (cid:107) g θ (cid:107) ∞ with respect to θ as follows.
Let θ 1 = ( θ 1 , θ (cid:48)
) ∈ Ω
+ and θ 2 = ( θ 2 , θ (cid:48)
) ∈ Ω
+ be parameters such that
[Equation]
This leads to
[Equation]
and | [Equation] (cid:48) 1 (cid:107) 2 − [Equation]
[Equation]
θ (cid:48) 2 (cid:107) 2 | ≤ 2 (cid:15). We get from these inequalities that for (cid:107) x (cid:107) 2 ≤ 1 , | [Equation] θ
[Equation] | = [Equation] )) (cid:12)(cid:12)(cid:12) (cid:107) θ 1 − θ (cid:48) 1 (cid:107) 2 (cid:107) θ 2 − θ (cid:48) 2 (cid:107)≤ 4 D η,m,T (cid:15)K
R.
Thus, if (cid:107) θ 1 − θ 2 (cid:107) 2 ≤ (cid:15) for θ 1 , θ 2 ∈ Ω + , then (cid:107) g θ 1 − g θ 2 (cid:107) ∞
≤ 4 D η,m,T (cid:15)K 1 /R 20 .
Since,
G + ⊂ { g θ | (cid:107) θ (cid:107) 2 ≤ 2 R + 2 D η,m,T , θ ∈ R 2 d } , we get for the unit-ball B 1 ⊂ R 2 d with respect to (cid:107) · (cid:107) 2 ,
N ( G + | X , (cid:15), (cid:107) · (cid:107) ∞ ) ≤ C d 1 N (cid:32)
B 1 ,
R 20 (cid:15)
K 1 ( RD η,m,T + D 2 η,m,T ) , (cid:107) · (cid:107)(cid:33) , where C 1 > 0 is a uniform constant.
Hence,
[Equation]
Applying Lemma 2 with α = K 1 / √ n
[Equation]
we obtain
[Equation]
We next evaluate (cid:60) ( G − | X ) by using a linear approximation.
Since | σ (cid:48)(cid:48) ( · ) | ≤ K 2 , we get | σ
[Equation]
Therefore
[Equation]
we get for θ =
( θ, θ (cid:48) )
∈
Ω −
[Equation]
From this approximation
[Equation]
the Rademacher complexity can be bounded as follows.
[Equation]

 .
When (cid:112) (cid:107) θ 1 − θ 2 (cid:107)
+ (cid:107) w 1 − w 2 (cid:107) 22 ≤ (cid:15) for (cid:107) θ i (cid:107) 2 ≤ R + D η,m,T and (cid:107) w i (cid:107) 2 ≤ 1 , we get for (cid:107) x (cid:107) 2 ≤ 1 , | σ (cid:48) ( θ (cid:62) 1 x ) w (cid:62) 1 x − σ (cid:48) ( θ (cid:62) 2 x ) w [Equation]
≤
[Equation]
σ
[Equation]
θ
[Equation]
x ) − σ (cid:48)
( θ (cid:62) 2 x ))
w (cid:62) 1 x | + | σ (cid:48)
( θ (cid:62) 2 x )( w 1 − w 2 ) (cid:62) x | ≤ ( K 1 + K 2 ) (cid:15).
We set
[Equation]
Therefore, by the same argument as the case of G + , the following bound holds.
[Equation]
where C 2 > 0 is a uniform constant.
Hence,
[Equation]
By Lemma 2 with α = 1 / √ n , we get
[Equation]
Combining (25), (26), (27) with R 0 = (cid:112) d/n , and Lipschiz continuity of l γ , we obtain (cid:60) ( F 1 | X ) ≤ O (cid:32) m 12 − β D η
[Equation]
m,T γ
[Equation]
(cid:114)
[Equation]
D
[Equation]
Now, let us turn to the second part of Proposition 8.
Let us assume that the function σ is convex and satisﬁes σ (0)
= 0 .
The main argument uses the convexity of activation function in the same spirit as (Chinot et al., 2019).
As for the ﬁrst part, with probability larger than 1 − δ over the initialization
[Equation]
We only focus on the control of (cid:60) ( H| X ) .
[Equation]
where A = { ( i, r ) ∈ { 1 , · · · , n } × { 1 , · · · , m } : σ ( θ Tr x i ) − σ ( θ (0)
T r x i ) ≥ 0 } .
Let us control the ﬁrst term (i.e for ( i, r ) ∈ A ).
For any i, r in A let ψ i,r : R (cid:55)→ R deﬁned for all u ∈ R as:
[Equation]
The functions ψ i,r are such that ψ i,r (0) = 0 .
There are convex because σ is.
In particular for any α ≥ 1 and u ∈ R , ψ i,r ( αu ) ≥ αψ i,r ( u ) .
We also have ψ i,r (cid:0) ( θ r − θ (0) r ) T x i (cid:1)
=
σ ( θ Tr x i ) − σ ( θ (0) T r x i ) .
Since Θ ∈ Ω we have (cid:107) Θ − Θ (0) (cid:107) 2 ≤ D η,m,T and for any r ∈ { 1 , · · · , m } , (cid:107) θ r − θ (0) r (cid:107) 2 ≤ D η,m,T .
As a consequence, for any ( i, r ) ∈ A , there exists β i,r ∈ [0 , 1] such that
[Equation]
m [Equation] Since for any i ∈ { 1 , · · · , n } , (cid:80) m r =1 (cid:107)
[Table] [Table]
r (cid:107)
[Table]
C M m
[Table]
β i,r ≤ 1 , we get
[Equation]
E  
[Equation]

[Equation]
n
C
[Equation]
E  
[Equation]
Therefore, with probability larger than 1 − δ ,
[Table]
[Equation]
Let us turn to the second term.
For any ( i, r ) in A c let ˜ ψ i,r : R (cid:55)→ R deﬁned for all u ∈ R as:
[Equation]
i
[Equation]
We have ˜ ψ i,r (cid:0) ( θ (0) r − θ r ) T x i (cid:1)
=
σ ( θ (0) T r x i ) − σ ( θ Tr x i ) .
Using the same path as for ( i, j ) ∈ A , with probability larger than 1 − δ , we obtain,
[Equation]