Title: GLOBAL OPTIMALITY CONDITIONS FOR DEEP NEURAL NETWORKS

Abstract: We study the error landscape of deep linear and nonlinear neural networks with the squared error loss. Minimizing the loss of a deep linear neural network is a nonconvex problem, and despite recent progress, our understanding of this loss surface is still incomplete. For deep linear networks, we present necessary and sufficient conditions for a critical point of the risk function to be a global minimum. Surprisingly, our conditions provide an efficiently checkable test for global optimality, while such tests are typically intractable in nonconvex optimization. We further extend these results to deep nonlinear neural networks and prove similar sufficient conditions for global optimality, albeit in a more limited function space setting.

1. INTRODUCTION:

Since the advent of AlexNet (Krizhevsky et al., 2012) , deep neural networks have surged in popularity, and have redefined the state-of-the-art across many application areas of machine learning and artificial intelligence, such as computer vision, speech recognition, and natural language processing. However, a concrete theoretical understanding of why deep neural networks work well in practice remains elusive. From the perspective of optimization, a significant barrier is imposed by the nonconvexity of training neural networks. Moreover, it was proved by Blum & Rivest (1988) that training even a 3-node neural network to global optimality is NP-Hard in the worst case, so there is little hope that neural networks have properties that make global optimization tractable.

Despite the difficulties of optimizing weights in neural networks, the empirical successes suggest that the local minima of their loss surfaces could be close to global minima; and several papers have recently appeared in the literature attempting to provide a theoretical justification for the success of these models. For example, by relating neural networks to spherical spin-glass models from statistical physics, Choromanska et al. (2015) provided some empirical evidence that the increase of size of neural networks makes local minima close to global minima.

Another line of results (Yu & Chen, 1995; Soudry & Carmon, 2016; Xie et al., 2016; Nguyen & Hein, 2017) provides conditions under which a critical point of the empirical risk is a global minimum. Such results roughly involve proving that if full rank conditions of certain matrices (as well as some additional technical conditions) are satisfied, derivative of the risk being zero implies loss being zero. However, these results are obtained under restrictive assumptions; for example, Nguyen & Hein (2017) require the width of one of the hidden layers to be as large as the number of training examples. Soudry & Carmon (2016) and Xie et al. (2016) require the product of widths of two adjacent layers to be at least as large as the number of training examples, meaning that the number of parameters in the model must grow rapidly as we have more training data available. Another recent paper (Haeffele & Vidal, 2017) provides a sufficient condition for global optimality when the neural network is composed of subnetworks with identical architectures connected in parallel and a regularizer is designed to control the number of parallel architectures.

Towards obtaining a more precise characterization of the loss-surfaces, a valuable conceptual simplification of deep nonlinear networks is deep linear neural networks, in which all activation functions are linear and the output of the entire network is a chained product of weight matrices with the input vector. Although at first sight a deep linear model may appear overly simplistic, even its opti-mization is nonconvex, and only recently theoretical results on this problem have started emerging. Interestingly, already in 1989, Baldi & Hornik (1989) showed that some shallow linear neural networks have no local minima. More recently, Kawaguchi (2016) extended this result to deep linear networks and proved that any local minimum is also global while any other critical point is a saddle point. Subsequently, Lu & Kawaguchi (2017) provided a simpler proof that any local minimum is also global, with fewer assumptions than (Kawaguchi, 2016) . Motivated by the success of deep residual networks (He et al., 2016a; b) , Hardt & Ma (2017) investigated loss surfaces of deep linear residual networks and showed every critical point is a global minimum in a near-identity region; subsequently, Bartlett et al. (2017) extended this result to a nonlinear function space setting.

1.1. OUR CONTRIBUTIONS:

Inspired by this recent line of work, we study deep linear and nonlinear networks, in settings either similar to or more general than existing work. We summarize our main contributions below.

• We provide both necessary and sufficient conditions for a critical point of the empirical risk to be a global minimum. Specifically, Theorem 2.1 shows that if the hidden layers are wide enough, then a critical point of the risk function is a global minimum if and only if the product of all parameter matrices is full-rank. In Theorem 2.2, we consider the case where some hidden layers have smaller width than both the input and output layers, and again provide necessary and sufficient conditions for global optimality. In comparison, Kawaguchi (2016) only proves that every critical point of the risk is either a global minimum or a saddle; it is an "existence" result without any computational implication. In contrast, we present efficiently checkable conditions for distinguishing the two different types of critical points; we can even use these conditions while running optimization to test whether the critical points we encounter are saddle points or not, if desired. It is also worth noting that such tests are intractable for general nonconvex optimization (Murty & Kabadi, 1987 ). • Under the same assumption as (Hardt & Ma, 2017) on the data distribution, namely, a linear model with Gaussian noise, we can modify Theorem 2.1 to handle the population risk. As a corollary, we not only recover Theorem 2.2 in (Hardt & Ma, 2017) , but also extend it to a strictly larger set, while removing their assumption that the true underlying linear model has a positive determinant. • Motivated by (Bartlett et al., 2017) , we extend our results on deep linear networks to obtain sufficient conditions for global optimality in deep nonlinear networks, although only via a function space view; these are presented in Theorems 4.1 and 4.2.

2. GLOBAL OPTIMALITY CONDITIONS FOR DEEP LINEAR NEURAL NETWORKS:

In this section, we describe the problem formulation and notations for deep linear neural networks, state main results (Theorems 2.1 and 2.2), and explain their implication.

2.1. PROBLEM FORMULATION AND NOTATION:

Suppose we have m input-output pairs, where the inputs are of dimension d x and outputs of dimension d y . Let X ∈ R dx×m be the data matrix and Y ∈ R dy×m be the output matrix. Suppose we have H hidden layers in the network, each having width d 1 , . . . , d H . For notational simplicity we let d 0 = d x and d H+1 = d y . The weights between adjacent layers can be represented as matrices

W k ∈ R d k ×d k-1 , for k = 1, . . . , H + 1

, and the output of the network can be written as the product of weight matrices W H+1 , . . . , W 1 and data matrix X:

W H+1 W H • • • W 1 X.

We consider minimizing the summation of squared error loss over all data points (i.e. empirical risk),

EQUATION

where W is a shorthand notation for the tuple (W 1 , . . . , W H+1 ).

Assumptions. We assume that d x ≤ m and d y ≤ m, and that XX T and Y X T have full ranks. These assumptions are common when we consider supervised learning problems with deep neural networks (e.g. Kawaguchi (2016) ). We also assume that the singular values of Y X T (XX T ) -1 X are all distinct, which is made for notational simplicity and can be relaxed without too much difficulty.

Notation. Given a matrix A, let σ max (A) and σ min (A) denote the largest and smallest singular values of A, respectively. Let row(A), col(A), null(A), rank(A), and A F be respectively the row space, column space, null space, rank, and Frobenius norm of matrix A. Given a subspace V of R n , we denote V ⊥ as its orthogonal complement. Given a set V, let V c denote the complement of V.

Let us denote k := min i∈{0,...,H+1} d i , and define p ∈ argmin i∈{0,...,H+1} d i . That is, p is any layer with the smallest width, and k = d p is the width of that layer. Here, p might not be unique, but our results hold for any layer p with smallest width. Notice also that the product

W H+1 • • • W 1 can have rank at most k. Let Y X T (XX T ) -1 X = U ΣV T be the singular value decomposition of Y X T (XX T ) -1 X ∈ R dy×dx .

Let Û ∈ R dy×k be a matrix consisting of the first k columns of U .

2.2. NECESSARY AND SUFFICIENT CONDITIONS FOR GLOBAL OPTIMALITY:

We now present two main theorems for deep linear neural networks. The theorems describe two sets, one for the case k = min{d x , d y } and the other for k < min{d x , d y }, inside which every critical point of L(W ) is a global minimum. Moreover, the sets have another remarkable property that every critical point outside of these sets is a saddle point. Previous works (Kawaguchi, 2016; Lu & Kawaguchi, 2017) showed that any critical point is either a global minimum or a saddle point, without providing any condition to distinguish between the two; here, we take a step further and partition the domain of L(W ) into two sets clearly delineating one set which only contains global minima and the other set with only saddle points. Theorem 2.1.

If k = min{d x , d y }, define the following set V 1 := {(W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 1 ) = k} . Then, every critical point of L(W ) in V 1 is a global minimum. Moreover, every critical point of L(W ) in V c 1 is a saddle point. Theorem 2.2. If k < min{d x , d y }, define the following set V 2 := (W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 1 ) = k, col(W H+1 • • • W p+1 ) = col( Û ) . Then, every critical point of L(W ) in V 2 is a global minimum. Moreover, every critical point of L(W ) in V c

2 is a saddle point. Theorems 2.1 and 2.2 provide necessary and sufficient conditions for a critical point of L(W ) to be globally optimal. From an algorithmic perspective, they provide easily checkable conditions, which we can use to determine if the critical point the algorithm encountered is a global optimum or not. Given that L(W ) is nonconvex, it is interesting to have such efficient tests for global optimality, which is not possible in general (Murty & Kabadi, 1987) .

In Hardt & Ma (2017) , the authors consider minimizing population risk of linear residual networks:

minimize 1 2 E x,y (I + W H+1 ) • • • (I + W 1 )x -y 2 F , where d x = d 1 = • • • = d H = d y = d.

They assume that x is drawn from a zero-mean distribution with a fixed covariance matrix, and y = Rx + ξ where ξ is iid standard Gaussian noise and R is the true underlying matrix with det(R) > 0. With these assumptions they prove that whenever σ max (W i ) < 1 for all i, any critical point is a global minimum (Hardt & Ma, 2017, Theorem 2.2) .

Under the same assumptions on data distribution, we can slightly modify Theorem 2.1 to derive a population risk counterpart, and in fact notice that the result proved in Hardt & Ma (2017) is a corollary of this modification because having σ max (W i ) < 1 for all i is a sufficient condition for (I + W H+1 ) • • • (I + W 1 ) having full rank. Moreover, notice that we can remove the assumption det(R) > 0 which was required by Hardt & Ma (2017) . We state this special case as a corollary: Corollary 2.3 (Theorem 2.2 of Hardt & Ma (2017) ). Under assumptions on data distribution as described above, any critical point of

1 2 E x,y (I + W H+1 ) • • • (I + W 1 )x -y 2 F is a global min- imum if σ max (W i ) < 1 for all i.

We also note in passing that the classical problem of matrix factorization min U,V U V T -Y 2 F is a special case of deep linear neural networks, so our theorems can also be directly applied.

Remarks. The previous result (Kawaguchi, 2016) assumed d y ≤ d x and showed that: 1) every local minimum is a global minimum, and 2) any other critical point is a saddle point. A subsequent paper by Lu & Kawaguchi (2017) proved 1) without the assumption d y ≤ d x , but as far as we know there is no result showing 2) in the case of d y > d x . We provide the proof for this case in Lemma B.1. In fact, we propose an alternative proof technique for handling degenerate critical points, which is much simpler than the technique presented by Kawaguchi (2016) .

3. ANALYSIS OF DEEP LINEAR NETWORKS:

In this section, we provide proofs for Theorems 2.1 and 2.2.

3.1. SOLUTIONS OF THE RELAXED PROBLEM:

We first analyze the globally optimal solution of a "relaxation" of L(W ), which turns out to be very useful while proving Theorems 2.1 and 2.2. Consider the relaxed risk function

L 0 (R) = 1 2 RX -Y 2 F , where R ∈ R dy×dx and rank(R) ≤ k. For any W , the product W H+1 W H • • • W 1 has rank at most

k and setting R to be this product gives the same loss values:

L 0 (W H+1 W H • • • W 1 ) = L(W ). Therefore, L 0 is a relaxation of L and inf R:rank(R)≤k L 0 (R) ≤ inf W L(W ).

This means that if there exists W such that L(W ) = inf R:rank(R)≤k L 0 (R), then W is a global minimum of the function L. This observation is very important in proofs; we will show that inside certain sets, any critical point

W of L(W ) must satisfy R * = W H+1 • • • W 1 , where R * is a global optimum of L 0 (R). This proves that L(W ) = L 0 (R * ) = inf R:rank(R)≤k L 0 (R), thus showing that W is a global minimum of L.

By restating this observation as an optimization problem, the solution of problem in ( 1) is bounded below by the minimum value of the following:

EQUATION

In case where k = min{d x , d y }, (2) is actually an unconstrained optimization problem. Note that L 0 is a convex function of R, so any critical point is a global minimum. By differentiating and setting the derivative to zero, we can easily get the unique globally optimal solution R * = Y X T (XX T ) -1 .

(3) In case of k < min{d x , d y }, the problem becomes non-convex because of the rank constraint, but its exact solution can still be computed easily. We present the solution of this case as a proposition and defer the proof to Appendix C due to its technicalities. Proposition 3.1. Suppose k < min{d x , d y }. Then the optimal solution to (2) is

EQUATION

which is the orthogonal projection of Y X T (XX T ) -1 onto the column space of Û .

3.2. PARTIAL DERIVATIVES OF L(W ):

By simple matrix calculus, we can calculate the derivatives of L(W ) with respect to W i , for i = 1, . . . , H + 1. We present the result as the following lemma, and defer the details to Appendix C. Lemma 3.2. The partial derivative of L(W ) with respect to W i is given as

EQUATION

for i = 1, . . . , H + 1.

This result will be used throughout the proof of Theorems 2.1 and 2.2. For clarity in notation, note that when

i = 1, W T 1 • • • W T 0 is just an identity matrix in R dx×dx . Similarly, when i = H + 1, W T H+2 • • • W T

H+1 is an identity matrix in R dy×dy . We also state an elementary lemma which proves useful in our proofs, whose proof we defer to Appendix C. Lemma 3.3. 1. For any A ∈ R m×n and B ∈ R n×l where m ≥ n,

AB 2 F ≥ σ 2 min (A) B 2 F . 2. For any A ∈ R m×n and B ∈ R n×l where n ≤ l, AB 2 F ≥ σ 2 min (B) A 2 F .

3.3. PROOF OF THEOREM 2.1:

We prove Theorem 2.1, which addresses the case k = min{d x , d y }. First, recall that the set defined in Theorem 2.1 is

V 1 := {(W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 1 ) = k} . As seen in (3), the unique minimum point of L 0 has rank k. So, no point W ∈ V c

1 can be a global minimum of L. Therefore, by Kawaguchi (2016, Theorem 2.3.(iii) ) and Lemma B.1, any critical point in V c 1 must be a saddle point. For the rest of our proof, we need to consider two cases: d y ≤ d x and d x ≤ d y . If d x = d y , both cases work. The outline of the proof is as follows: we define a new set W , show that any critical point in the set W is a global minimum, and then show that every W ∈ V 1 is also in W for some > 0. This proves that any critical point of L(W ) in V 1 is also a critical point in W for some > 0, hence a global minimum.

The following proposition proves the first step: Proposition 3.4. Assume that k = min{d x , d y }. For any > 0, define the following set:

W := {(W 1 , . . . , W H+1 ) : σ min (W H+1 • • • W 2 ) ≥ } , if d y ≤ d x , {(W 1 , . . . , W H+1 ) : σ min (W H • • • W 1 ) ≥ } , if d x ≤ d y . Then any critical point of L(W ) in W is a global minimum point. Proof. (If d y ≤ d x ) Consider (5) in the case of i = 1. We can observe that W T 2 • • • W T H+1 ∈ R d1×dy and that d 1 ≥ d y . Then by Lemma 3.3.1, ∂L ∂W 1 2 F ≥ σ 2 min (W H+1 • • • W 2 ) (W H+1 W H • • • W 1 X -Y )X T 2 F ≥ 2 (W H+1 W H • • • W 1 X -Y )X T 2 F . By the above inequality, any critical point in W satisfies ∀i, ∂L ∂W i = 0 ⇒ (W H+1 W H • • • W 1 X -Y )X T = 0, which means that W H+1 W H • • • W 1 = Y X T (XX T ) -1 .

The product is the unique globally optimal solution (3) of the relaxed problem in (2), so W is a global minimum point of L.

(If d x ≤ d y ) Consider (5) for i = H + 1. We can observe that W T 1 • • • W T H ∈ R dx×d H and that d x ≤ d H . Then by Lemma 3.3.2, ∂L ∂W H+1 2 F ≥ 2 (W H+1 W H • • • W 1 X -Y )X T 2

F , and the rest of the proof flows in a similar way as the previous case.

The next proposition proves the theorem: Proposition 3.5. For any point W ∈ V 1 , there exists an > 0 such that W ∈ W .

Proof. Define a new set W, a "limit" version (as → 0) of W , as

W := {(W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 2 ) = d y } , if d y ≤ d x , {(W 1 , . . . , W H+1 ) : rank(W H • • • W 1 ) = d x } , if d x ≤ d y . We show that V 1 ⊂ W by showing that W c ⊂ V c 1 . Consider W c = {(W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 2 ) < d y } , if d y ≤ d x , {(W 1 , . . . , W H+1 ) : rank(W H • • • W 1 ) < d x } , if d x ≤ d y . Then any W ∈ W c must have rank(W H+1 • • • W 1 ) < min{d x , d y } = k, so W ∈ V c 1 . Thus, any W ∈ V 1 is also in W, so either rank(W H+1 • • • W 2 ) = d y or rank(W H • • • W 1 ) = d x ,

depending on the cases. Then, we can set

= σ min (W H+1 • • • W 2 ), if d y ≤ d x , σ min (W H • • • W 1 ), if d x ≤ d y .

We always have > 0 because the matrices are full rank, and we can see that W ∈ W .

3.4. PROOF OF THEOREM 2.2:

In this section we prove Theorem 2.2, which tackles the case k < min{d x , d y }. Note that this assumption also implies that 1 ≤ p ≤ H.

As for the proof of Theorem 2.1, define

V 1 := {(W 1 , . . . , W H+1 ) : rank(W H+1 • • • W 1 ) = k} .

The globally optimal point of the relaxed problem (2) has rank k, as seen in ( 4). Thus, any point outside of V 1 cannot be a global minimum. Then, by Kawaguchi (2016, Theorem 2.3.(iii) ) and Lemma B.1, it follows that any critical point in V c

1 must be a saddle point. The remaining proof considers points in V 1 .

For this section, let us introduce some additional notations to ease presentation. Define

E := (W H+1 • • • W 1 X -Y )X T ∈ R dy×dx , A i := W T i+1 • • • W T H+1 ∈ R di×dy , B i := W T 1 • • • W T i-1 ∈ R dx×di-1 , i = 1, . . . , H + 1, so that ∂L ∂Wi = A i EB i . Notice that A H+1 and B 1 are identity matrices. Now consider any tuple W ∈ V 1 . Since the full product W H+1 • • • W 1 has rank k, any partial products A i and B i must have rank(A i ) ≥ k and rank(B i ) ≥ k, for all i. Then, consider A p ∈ R k×dy and B p+1 ∈ R dx×k . Since rank(A p ) ≤ k and rank(B p+1 ) ≤ k, we can see that rank(A p ) = rank(B p+1 ) = k. Also, notice that A i = W i+1 A i+1 and B i+1 = B i W i , so that rank(A 1 ) ≤ rank(A 2 ) ≤ • • • ≤ rank(A p ) and rank(B H+1 ) ≤ rank(B H ) ≤ • • • ≤ rank(B p+1 ).

However, we have k ≤ rank(A 1 ) and k ≤ rank(B H+1 ), so the ranks are all identically k. Also,

row(A 1 ) ⊂ row(A 2 ) ⊂ • • • ⊂ row(A p ) and col(B H+1 ) ⊂ col(B H ) ⊂ • • • ⊂ col(B p+1 ),

but it was just shown that the these spaces have the same dimensions, which equals k, meaning

row(A 1 ) = row(A 2 ) = • • • = row(A p ) and col(B H+1 ) = col(B H ) = • • • = col(B p+1 ).

Using this observation, we can now state a proposition showing necessary and sufficient conditions for a tuple W ∈ V 1 to be a critical point of L(W ). Proposition 3.6. A tuple W ∈ V 1 is a critical point of L if and only if A p E = 0 and EB p+1 = 0.

Proof. (If part):

A p E = 0 implies that col(E) ⊂ row(A p ) ⊥ = • • • = row(A 1 ) ⊥ , so ∂L ∂Wi = A i EB i = 0 • B i = 0, for i = 1, . . . , p. Similarly, EB p+1 = 0 implies row(E) ⊂ col(B p+1 ) ⊥ = • • • = col(B H+1 ) ⊥ , so ∂L ∂Wi = A i EB i = A i • 0 = 0 for i = p + 1, . . . , H + 1. (Only if part) We have ∂L ∂Wi = A i EB i = 0 for all i. This means that col(EB i ) ⊂ row(A i ) ⊥ = row(A p ) ⊥ for i = 1, . . . , p row(A i E) ⊂ col(B i ) ⊥ = col(B p+1 ) ⊥ for i = p + 1, . . . , H + 1.

Now recall that B 1 and A H+1 are identity matrices, so col(E) ⊂ row(A p ) ⊥ and row(E) ⊂ col(B p+1 ) ⊥ , which proves A p E = 0 and EB p+1 = 0.

Now we present a proposition that specifies the necessary and sufficient condition in which a critical point of L(W ) in V 1 is a global minimum. Recall that when we take the SVD Y X T (XX T ) -1 X = U ΣV T , Û ∈ R dy×k is defined to be a matrix consisting of the first k columns of U . Proposition 3.7.

A critical point W ∈ V 1 of L(W ) is a global minimum point if and only if col(W H+1 • • • W p+1 ) = row(A p ) = col( Û ).

Proof. Since W is a critical point, by Proposition 3.6 we have A p E = 0. Also note from the definitions of A i 's and

B i 's that W H+1 • • • W 1 = A T p B T p+1 , so A p E = A p (A T p B T p+1 X -Y )X T = A p A T p B T p+1 XX T -A p Y X T = 0.

Because rank(A p ) = k, and A p A T p ∈ R k×k is invertible, so B p+1 is determined uniquely as

B T p+1 = (A p A T p ) -1 A p Y X T (XX T ) -1 , thus W H+1 • • • W 1 = A T p B T p+1 = A T p (A p A T p ) -1 A p Y X T (XX T ) -1 . Comparing this with (4), W is a global minimum solution if and only if Û Û T Y X T (XX T ) -1 = W H+1 • • • W 1 = A T p (A p A T p ) -1 A p Y X T (XX T ) -1 .

This equation holds if and only if A T p (A p A T p ) -1 A p = Û Û T , meaning that they are projecting Y X T (XX T ) -1 onto the same subspace. The projection matrix A T p (A p A T p ) -1 A p is onto row(A p ), while Û Û T is onto col( Û ). From this, we conclude that W is a global minimum point if and only if row(A p ) = col( Û ).

From Proposition 3.7, we can define the set V 2 that appeared in Theorem 2.2, and conclude that every critical point of L(W ) in V 2 is a global minimum, and any other critical points are saddle points.

4. EXTENSION TO DEEP NONLINEAR NEURAL NETWORKS:

In this section, we present some sufficient conditions for global optimality for deep nonlinear neural networks via a function space view. Given a smooth nonlinear function h * that maps input to output, Bartlett et al. (2017) described a method to decompose it into a number of smooth nonlinear functions h * = h H+1 • • • • • h 1 where h i 's are close to identity. Using Fréchet derivatives of the population risk with respect to each function h i , they showed that when all h i 's are close to identity, any critical point of the population risk is a global minimum. One can see that these results are direct generalization of Theorems 2.1 and 2.2 of Hardt & Ma (2017) to nonlinear networks and utilize the classical "small gain" arguments often used in nonlinear analysis and control (Khalil, 1996; Zames, 1966) . Motivated by this result, we extended Theorem 2.1 to deep nonlinear neural networks and obtained sufficient conditions for global optimality in function space.

Suppose the data X ∈ R dx and its corresponding label Y ∈ R dy are drawn from some distribution. Notice that in this section, X and Y are random vectors instead of matrices. We want to predict Y given X with a deep nonlinear neural network that has H hidden layers. We express each layer of the network as functions h i : R di-1 → R di , so the entire network can be expressed as a composition of functions:

h H+1 • h H • • • • • h 1 .

Our goal is to obtain functions h 1 , . . . , h H+1 that minimize the population risk functional:

L(h) = L(h 1 , . . . , h H+1 ) := 1 2 E h H+1 • • • • • h 1 (X) -Y 2 2 ,

where h is a shorthand notation for (h 1 , . . . , h H+1 ). It is well-known that the minimizer of squared error risk is the conditional expectation of Y given X, which we will denote h

* (x) = E[Y | X = x].

With this, we can separate the risk functional into two terms

L(h) = 1 2 E h H+1 • • • • • h 1 (X) -h * (X) 2 2 + C,

where the constant C denotes the variance that is independent of h 1 , . . . , h H+1 . Note that if

h H+1 • • • • • h 1 = h * almost

surely, the first term in L(h) vanishes and the optimal value L * of L(h) is C.

Assumptions. Define the function spaces as the following:

F := h : R dx → R dy | h is differentiable, h(0) = 0, and sup x h(x) 2 x 2 < ∞ , F i := h : R di-1 → R di | h is differentiable, h(0) = 0, and sup x h(x) 2 x 2 < ∞ ,

where F i are defined for all i = 1, . . . , H + 1. Assume that h * ∈ F, and that we are optimizing L(h) with h 1 ∈ F 1 , . . . , h H+1 ∈ F H+1 . In other words, the functions in F, F 1 , . . . , F H+1 are differentiable and show sublinear growth starting from 0. Notice that h H+1 • • • • • h 1 ∈ F, because a composition of differentiable functions is also differentiable, and a composition of sublinear functions is also sublinear. We also assume that d i ≥ min{d x , d y } for all i = 1, . . . , H + 1, which is identical to the assumption k = min{d x , d y } in Theorem 2.1.

Notation. To simplify multiple composition of functions, we denote

h i:j = h i • h i-1 • • • • • h j+1 • h j .

As in the matrix case, h 0:1 and h H+1:H+2 mean identity maps in R dx and R dy , respectively. Given a function f , let J[f ](x) be the Jacobian matrix of function f evaluated at x. Let D hi [L(h)] be the Fréchet derivative of L(h) with respect to h i evaluated at h. The Fréchet derivative D hi [L(h)] is a linear functional that maps a function (direction) η ∈ F i to a real number (directional derivative).

4.2. SUFFICIENT CONDITIONS FOR GLOBAL OPTIMALITY:

Here, we present two theorems which give sufficient conditions for a critical point (D hi [L(h)] = 0 for all i) in the function space to be a global optimum. The proofs are deferred to Appendix A. Theorem 4.1. Consider the case d x ≥ d y . If there exists > 0 such that

1. J[h H+1:2 ](z) ∈ R dy×d1 has σ min (J[h H+1:2 ](z)) ≥ for all z ∈ R d1 , 2. h H+1:2 (z) is twice-differentiable, then any critical point of L(h), in terms of D h1 [L(h)], . . . , D h H+1 [L(h)], is a global minimum. Theorem 4.2. Consider the case d x ≤ d y .

Assume that there exists some j ∈ {1, . . . , H + 1} such that

d x = d j-1 and d y ≤ d j . If there exist 1 , 2 > 0 such that 1. h j-1:1 : R dx → R dj-1 = R dx is invertible, 2. h j-1:1 satisfies h j-1:1 (u) 2 ≥ 1 u 2 for all u ∈ R dx , 3. J[h H+1:j+1 ](z) ∈ R dy×dj has σ min (J[h H+1:j+1 ](z)) ≥ 2 for all z ∈ R dj , 4. h H+1:j+1 (z) is twice-differentiable, then any critical point of L(h), in terms of D h1 [L(h)], . . . , D h H+1 [L(h)], is a global minimum.

Note that these theorems give sufficient conditions, whereas Theorems 2.1 and 2.2 provide necessary and sufficient conditions. So, if the sets we are describing in Theorems 4.1 and 4.2 do not contain any critical point, the claims would be vacuous. We ensure that there are critical points in the sets, by presenting the following proposition, whose proof is also deferred to Appendix A. Proposition 4.3. For each of Theorems 4.1 and 4.2, there exists at least one global minimum solution of L(h) satisfying the conditions of the theorem.

Discussion and Future work. Theorems 4.1 and 4.2 state that in certain sets of (h 1 , . . . , h H+1 ), any critical point in function space a global minimum. However, this does not imply that any critical point for a fixed sigmoid or arctan network is a global minimum. As noted in (Bartlett et al., 2017) , there is a downhill direction in function space at any suboptimal point, but this direction might be orthogonal to the function space represented by a fixed network, and may hence result in local minima in the parameter space of the fixed architecture.

Understanding the connection between the function space and parameter space of commonly used architectures is an open direction for future research, and we believe that these results can be good initial steps from the theoretical point of view. For example, we can see that one of the sufficient conditions for global optimality is the Jacobian matrix being full rank. Given that a nonlinear function can locally be linearly approximated using Jacobians, this connection is already interesting. An extension of the function space viewpoint to cover different architectures or design new architectures (that have "better" properties when viewed via the function space view) should also be possible and worth studying.

A ANALYSIS OF DEEP NONLINEAR NETWORKS:

A.1 NOTATION

In this section, we introduce additional notation that is used in the proofs. To emphasize that the Fréchet derivative D hi [L(h)] is a linear functional that outputs a real number, we will write

D hi [L(h)](η) in an inner-product form D hi [L(h)],

η . This notation also helps avoiding confusion coming from multiple parentheses and square brackets.

There are many different kinds of norms that appear in the proofs. Given a finite-dimensional real vector v, v 2 denotes its 2 norm. For a matrix A, its operator norm is defined as

A op = sup x Ax 2 x 2

. Let h ∈ F. Then define a "generalized" induced norm for nonlinear functions with sublinear growth:

h nl = sup x h(x) 2 x 2

, where the subscript nl is used to emphasize that this norm is for nonlinear functions. The norm • nl is defined in the same way for F i 's. Now, given a linear functional G that maps a function f ∈ F i to a real number G, f , define the operator norm

G op = sup f ∈Fi G,f f nl . A.2 FR ÉCHET DERIVATIVES

By definition of Fréchet derivatives, we have

D hi [L(h)], η = lim →0 L(h 1 , . . . , h i + η, . . . , h H+1 ) -L(h) ,

where η ∈ F i is the direction of perturbation and D hi [L(h)], η is the directional derivative along that direction η. From the definition of L(h),

EQUATION

This equation ( 6) will be used in the proof of Theorems 4.1 and 4.2.

A.3 PROOF OF THEOREM 4.1

From (6), consider D h1 [L(h)]. For any η ∈ F 1 , D h1 [L(h)], η = E (h H+1:1 (X) -h * (X)) T J[h H+1:2 ](h 1 (X))η(X) . Let A(X) = J[h H+1:2 ](h 1 (X)).

Since A(X) has full row rank by assumption, A(X)A(X) T is invertible. Then define a particular direction

η(X) = A(X) T (A(X)A(X) T ) -1 (h H+1:1 (X) -h * (X)), so that D h1 [L(h)], η = E h H+1:1 (X) -h * (X) 2 2 . It remains to check if η ∈ F 1 . It is easily checked that η(0) = 0 because h H+1:1 (0) -h * (0) = 0.

Since J[h H+1:2 ] is differentiable by assumption and h 1 ∈ F 1 , A(X) is differentiable and A(X) T , (A(X)A(X) T ) -1 are differentiable functions. Also, h H+1:1 -h * ∈ F, so we can conclude that η is differentiable.

Moreover, if we decompose A(X) with SVD, A(X) = U ΣV T , Σ is of the form Σ = [Σ 1 0] and

A(X) T (A(X)A(X) T ) -1 = V Σ T U T (U ΣV T V Σ T U T ) -1 = V Σ T U T (U Σ 2 1 U T ) -1 = V Σ T U T U Σ -2 1 U T = V Σ -1 1 0 U T ,

from which we can see that A(X) T (A(X)A(X) T ) -1 op = σ max (A(X) T (A(X)A(X) T ) -1 ) ≤ 1/ , by our assumption. Note that, for any

X ∈ R dx , η(X) 2 = A(X) T (A(X)A(X) T ) -1 (h H+1:1 (X) -h * (X)) 2 ≤ A(X) T (A(X)A(X) T ) -1 op h H+1:1 (X) -h * (X) 2 ≤ A(X) T (A(X)A(X) T ) -1 op h H+1:1 -h * nl X 2 .

Since this holds for any X, we have

η nl ≤ A(X) T (A(X)A(X) T ) -1 op h H+1:1 -h * nl ≤ h H+1:1 -h * nl ,

which ensures that η ∈ F 1 . Finally,

D h1 [L(h)] op ≥ D h1 [L(h)], η η nl ≥ E h H+1:1 (X) -h * (X) 2 2 h H+1:1 -h * nl = (L(h) -L * ) h H+1:1 -h * nl , which yields D h1 [L(h)] op h H+1:1 -h * nl ≥ (L(h) -L *

). From this we can see that if we have a critical point of L(h), then D h1 [L(h)] op = 0 implies L(h) = L * , which means that the critical point is a global minimum of L(h).

A.4 PROOF OF THEOREM 4.2:

Recall that by assumption we have j ∈ {1, . . . , H + 1} such that d x = d j-1 and d y ≤ d j . Consider D hj [L(h)], then for any η ∈ F j ,

D hj [L(h)], η = E (h H+1:1 (X) -h * (X)) T J[h H+1:j+1 ](h j:1 (X))η(h j-1:1 (X)) .

As done in the previous theorem, for any w ∈ R dj-1 , let A(w) = J[h H+1:j+1 ](h j (w)). Since A(w) has full row rank by assumption, A(w)A(w) T is invertible. Then define

η(w) = A(w) T (A(w)A(w) T ) -1 (h H+1:1 -h * ) • h -1 j-1:1 (w), so that D hj [L(h)], η = E h H+1:1 (X) -h * (X) 2 2 .

We need to check if η ∈ F j . It is easily checked that η(0) = 0. Since J[h H+1:j+1 ] is differentiable by assumption and h j ∈ F j , A(w) is differentiable, and so are A(w) T and (A(w)A(w) T ) -1 . The inverse function of a differentiable and invertible function is also differentiable, so (h H+1:1 -h * ) • h -1 j-1:1 is differentiable. Hence, we can conclude that η is differentiable. As seen in the previous section,

A(w) T (A(w)A(w) T ) -1 op = σ max (A(w) T (A(w)A(w) T ) -1 ) ≤ 1/ 2 .

By the assumption that h j-1:1 is invertible and h j-1:

1 (u) 2 ≥ 1 u 2 , v 2 ≥ 1 h -1 j-1:1 (v) 2 ,

for all v ∈ R dj-1 . From this, we can see that h -1 j-1:1 nl ≤ 1/ 1 . For any w ∈ R dj-1 ,

η(w) 2 = A(w) T (A(w)A(w) T ) -1 (h H+1:1 -h * ) • h -1 j-1:1 (w) 2 ≤ A(w) T (A(w)A(w) T ) -1 op (h H+1:1 -h * ) • h -1 j-1:1 (w) 2 ≤ A(w) T (A(w)A(w) T ) -1 op h H+1:1 -h * nl h -1 j-1:1 (w) 2 ≤ A(w) T (A(w)A(w) T ) -1 op h H+1:1 -h * nl h -1 j-1:1 nl w 2 .

From this, we have

η nl ≤ A(w) T (A(w)A(w) T ) -1 op h H+1:1 -h * nl h -1 j-1:1 nl ≤ h H+1:1 -h * nl 1 2

.

Finally,

D hj [L(h)] op ≥ D hj [L(h)], η η nl ≥ 1 2 E h H+1:1 (X) -h * (X) 2 2 h H+1:1 -h * nl = 1 2 (L(h) -L * ) h H+1:1 -h * nl , which yields D hj [L(h)] op h H+1:1 -h * nl ≥ 1 2 (L(h) -L * ).

A.5 PROOF OF PROPOSITION 4.3 (Theorem 4.1) By assumption, we have d 1 ≥ d y . Set h 1 (x) = (h * (x), 0, . . . , 0) where for every x ∈ R dx , the first d y components of h 1 (x) are identical to h * (x), and all other components are zero. For the rest of h i 's, define h i : R di-1 → R di to be

EQUATION

for all w ∈ R di-1 . Since d i ≥ d y for all i, we can check that h H+1 • • • • • h 1 = h * , and h i ∈ F i for all i. Moreover, for all z ∈ R d1 , J[h H+1:2 ](z) is all 0 except 1's in diagonal entries, so σ min (J[h H+1:2 ](z)) ≥ 1 and h H+1:2 (z) is twice-differentiable.

(Theorem 4.2) It is given that we have j ∈ {1, . . . , H + 1} such that d x = d j-1 and d y ≤ d j . Set h j (x) = (h * (x), 0, . . . , 0), where the first d y components are h * (x) and the rest are zero. All the rest of h i are set as in ( 7). Then, it can be easily checked that h i ∈ F i for all i and all the conditions of the theorem are satisfied.

B DEFERRED LEMMA:

Lemma B.1. Suppose we are given a data matrix X ∈ R dx×m and an output matrix Y ∈ R dy×m , where d x < d y . Assume XX T and Y X T have full ranks. Consider minimizing the empirical squared error risk: Then, any critical point of L(W ) that is not a local minimum is a saddle point.

L(W 1 , . . . , W H+1 ) := 1 2 W H+1 W H • • • W 1 X -Y 2 F , where W k ∈ R d k ×d k-1 , k = 1, . . . ,

Proof. For this lemma, we separate the proof into two cases:

W H • • • W 1 = 0 and W H • • • W 1 = 0.

The crux of the proof is to show that any critical point cannot be a local maximum. Then, any critical point is either a local minimum or a saddle point, so the conclusion of this lemma follows.

In case of W H • • • W 1 = 0, we use some of the results in Kawaguchi (2016) and examine the Hessian of L(W ) with respect to vec(W T H+1 ), where vec(A) denotes vectorization of matrix A.

Let D vec(W T H+1 ) L(W ) be the partial derivative of L(W ) with respect to vec(W T H+1 ) in numerator layout. It was shown by Kawaguchi (2016, Lemma 4. 3) that the Hessian matrix

H(W ) = D vec(W T H+1 ) D vec(W T H+1 ) L(W ) T = I ⊗ (W H • • • W 1 X)(W H • • • W 1 X) T = I ⊗ W H • • • W 1 XX T W T 1 • • • W T H ,

where ⊗ denotes the Kronecker product of two matrices. Notice that H(W ) is positive semidefinite. Since XX T is full rank, whenever W H • • • W 1 = 0 there exists a strictly positive eigenvalue in H(W ), which means that there exists an increasing direction. So W cannot be a local maximum.

The case where W H • • • W 1 = 0 requires a bit more careful treatment. Note that this case corresponds to where we have degenerate critical points, which are in many cases much harder to handle.

For any arbitrary > 0, we describe a procedure that perturbs the matrices W 1 , . . . , W H+1 by perturbations sampled from Frobenius norm balls of radius centered at 0, which we will denote as B i ( ), i = 1, . . . , H +1. Let U(B i ( )) be the uniform distribution over the ball B i ( ). The algorithm goes as the following:

1. For i ∈ {1, . . . , H + 1}

1.1. Sample ∆ i ∼ U(B i ( )), and define

V i = W i + ∆ i . 1.2. If W H+1 • • • W i+1 V i • • • V 1 = 0, stop and return i * = i.

First, recall that the set of rank-deficient matrices have Lebesgue measure zero, so for any sample ∆ i ∼ U(B i ( )), V i = W i + ∆ i has full rank with probability 1. If we proceed the for loop until i = H + 1, we have a full-rank V H+1 • • • V 1 with probability 1, which means that the algorithm must return i * ∈ {1, . . . , H + 1} with probability 1. Notice that before and after the i * -th iteration, we have

W H+1 • • • W i * V i * -1 • • • V 1 = 0, W H+1 • • • W i * +1 V i * • • • V 1 = W H+1 • • • W i * +1 (W i * + ∆ i * )V i * -1 • • • V 1 = 0.

This means that if we define

∆ = W H+1 • • • W i * +1 ∆ i * V i * -1 • • • V 1 , then ∆ = 0. Also, notice that W H+1 • • • W i * +1 (W i * -∆ i * )V i * -1 • • • V 1 = -∆.

Now, define two points

U (1) = (V 1 , . . . , V i * -1 , W i * + ∆ i * , W i * +1 , . . . , W H+1 ), U (2) = (V 1 , . . . , V i * -1 , W i * -∆ i * , W i * +1 , . . . , W H+1 ),

and notice that they are all in the neighborhood of W , that is, the Cartesian product of -radius balls centered at W 1 , . . . , W H+1 . Moreover, we have

L(W ) = 1 2 0 • X -Y 2 F = 1 2 Y 2 F , L(U (1) ) = 1 2 ∆X -Y 2 F = 1 2 Y 2 F + 1 2 ∆X 2 F -∆X, Y , L(U (2) ) = 1 2 -∆X -Y 2 F = 1 2 Y 2 F + 1 2 ∆X 2 F + ∆X, Y ,

from which we can see that at least one of L(W ) < L(U (1) ) or L(W ) < L(U (2) ) must hold. This shows that for any > 0, there is a point U in -neighborhood of W with a strictly greater function value L(U ). This proves that W cannot be a local maximum. In case of k < min{d x , d y }, we can decompose the loss function in the following way:

RX -Y 2 F = RX -Y X T (XX T ) -1 X + Y X T (XX T ) -1 X -Y 2 F = RX -Y X T (XX T ) -1 X 2 F + Y X T (XX T ) -1 X -Y 2 F

+ 2 tr((Y X T (XX T ) -1 X -Y )(RX -Y X T (XX T ) -1 X) T ).

Let us take a close look into the last term in the RHS. Note that Y X T (XX T ) -1 X is the orthogonal projection of Y onto row(X), so each row of Y X T (XX T ) -1 X -Y must be in null(X). Also,

(RX -Y X T (XX T ) -1 X) T = X T (R T -(XX T ) -1 XY T ).

It is X T right-multiplied with some matrix, so its columns must lie in col(X T ) = row(X). By the fact that null(X) ⊥ = row(X), (Y X T (XX T ) -1 X -Y )(RX -Y X T (XX T ) -1 X) T = 0,

thus L 0 (R) = 1 2 RX -Y X T (XX T ) -1 X 2 F + 1 2 Y X T (XX T ) -1 X -Y 2 F

holds.

Now, (2) becomes a problem of minimizing RX -Y X T (XX T ) -1 X 2 F subject to the rank constraint rank(R) ≤ k. The optimal solution for this is obtained when RX is the k-rank approximation of Y X T (XX T ) -1 X. Then, k-rank approximation of Y X T (XX T ) -1 X can be expressed as Û Û T Y X T (XX T ) -1 X, where Û is unique due to our assumption that all singular values are distinct. Therefore, R * = Û Û T Y X T (XX T ) -1

is the unique global minimum solution of (2) when k < min{d x , d y }.

C.2 PROOF OF LEMMA 3.2

L(W 1 , . . . , W i-1 , W i + ∆ i , W i+1 , . . . , W H+1 ) = 1 2 W H+1 • • • W i+1 (W i + ∆ i )W i-1 • • • W 1 X -Y 2 F = 1 2 W H+1 • • • W 1 X -Y + W H+1 • • • W i+1 ∆ i W i-1 • • • W 1 X 2 F =L(W ) + tr((W H+1 • • • W i+1 ∆ i W i-1 • • • W 1 X) T (W H+1 • • • W 1 X -Y )) + O( ∆ i 2 F ) =L(W ) + tr(W T i+1 • • • W T H+1 (W H+1 • • • W 1 X -Y )X T W T 1 • • • W T i-1 ∆ T i ) + O( ∆ i 2 F

). From this, we can conclude that 

∂L ∂W i = W T i+1 • • • W T H+1 (W H+1 • • • W 1 X -Y )X T W T 1 • • • W T i-1 .

:



Figures and Tables:

H + 1 are weight matrices of the linear neural network, and d 0 = d x and d H+1 = d y for simplicity in notation. Also let W denote the tuple (W 1 , . . . , W H+1 ).

A T A σ 2 min (A)I, B T A T AB σ 2 min (A)B T B. Then AB 2 = tr(B T A T AB) ≥ σ 2 min (A) tr(B T B) = σ 2 min (A) B 2 F . 2. Since BB T σ 2 min (B)I, ABB T A T σ 2 min (B)AA T . Then AB 2 = tr(B T A T AB) = tr(ABB T A T ) ≥ σ 2 min (B) tr(AA T ) = σ 2 min (B) A 2 F .

Peer review (iclr2018):
 -I think title is misleading, as the more concise results in this paper is about linear networks I recommend adding linear in the title i.e. changing the title to … deep LINEAR networks - Theorems 2.1, 2.2 and the observation (2) are nice! - Theorem 2.2 there is no discussion about the nature of the saddle point is it strict? Does this theorem imply that the global optima can be reached from a random initialization? Regardless of if this theorem can deal with these issues, a discussion of the computational implications of this theorem is necessary. - I’m a bit puzzled by Theorems 4.1 and 4.2 and why they are useful. Since these results do not seem to have any computational implications about training the neural nets what insights do we gain about the problem by knowing this result? Further discussion would be helpful.