Title: LEARNING ONE-HIDDEN-LAYER NEURAL NETWORKS WITH LANDSCAPE DESIGN

Abstract: We consider the problem of learning a one-hidden-layer neural network: we assume the input x ∈ R d is from Gaussian distribution and the label y = a σ(Bx) + ξ, where a is a nonnegative vector in R m with m ≤ d, B ∈ R m×d is a full-rank weight matrix, and ξ is a noise vector. We first give an analytic formula for the population risk of the standard squared loss and demonstrate that it implicitly attempts to decompose a sequence of low-rank tensors simultaneously. Inspired by the formula, we design a non-convex objective function G(•) whose landscape is guaranteed to have the following properties:
1. All local minima of G are also global minima.

1. INTRODUCTION:

Scalable optimization has played an important role in the success of deep learning, which has immense applications in artificial intelligence. Remarkably, optimization issues are often addressed through designing new models that make the resulting training objective functions easier to be optimized. For example, over-parameterization (Livni et al., 2014) , batch-normalization (Ioffe & Szegedy, 2015) , and residual networks (He et al., 2016a; b) are often considered as ways to improve the optimization landscape of the resulting objective functions.

How do we design models and objective functions that allow efficient optimization with guarantees? Towards understanding this question in a principled way, this paper studies learning neural networks with one hidden layer. Roughly speaking, we will show that when the input is from Gaussian distribution and under certain simplifying assumptions on the weights, we can design an objective function G(•), such that

[a] all local minima of G(•) are global minima [b] all the global minima are the desired solutions, namely, the ground-truth parameters (up to permutation and some fixed transformation).

We note that designing such objective functions is challenging because 1) the natural 2 loss objective does have bad local minimum, and 2) due to the permutation invariance1 , the objective function inherently has to contain an exponential number of isolated local minima.

1.1. SETUP AND KNOWN ISSUES WITH PROPER LEARNING:

We aim to learn a neural network with a one-hidden-layer using a non-convex objective function. We assume input x comes from Gaussian distribution and the label y comes from the model

y = a σ(B x) + ξ (1.1)

where a ∈ R m , B ∼ R m×d are the ground-truth parameters, σ(•) is a element-wise non-linear function, and ξ is a noise vector with zero mean. Here we can without loss of generality assume x comes from spherical Gaussian distribution N (0, Id d×d ).2 

For technical reasons, we will further assume m ≤ d and that a has non-negative entries.

The most natural learning objective is perhaps the 2 loss function, given the additive noise. Concretely, we can parameterize with training parameters a ∈ R m , B ∼ R m×d of the same dimension as a and B correspondingly,

EQUATION

and then use stochastic gradient descent to optimize the 2 loss function. In many parts of our paper, we consider σ to be the ReLU function σ(x) = max{x, 0}. In such settings we assume rows of B have norm 1 because a and rows of B can be scaled simultaneously without changing the model or the objective.

When we have enough training examples, we are effectively minimizing the following population risk with stochastic updates,

f (a, B) = E ŷ -y 2 .

(1.3) However, empirically stochastic gradient descent cannot converge to the ground-truth parameters in the synthetic setting above when σ(x) = ReLU(x) = max{x, 0}, even if we have access to an infinite number of samples, and B is a orthogonal matrix. We also show this phenomena generalizes to the case when σ(x) is the sigmoid function and the learned network also have the same architecture. Such empirical results have been reported in Livni et al. (2014) previously, and we also provide our version in Figure 1 and Figure 2 of Section 4. This is consistent with observations and theory that over-parameterization is important for training neural networks successfully (Livni et al., 2014; Hardt et al., 2016; Soudry & Carmon, 2016) .

These empirical findings suggest that the population risk f (a, B) has spurious local minima with inferior error compared to that of the global minimum. This phenomenon occurs even if we assume we know a or a = 1 is merely just the all one's vector. Empirically, such landscape issues seem to be alleviated by over-parameterization. By contrast, our method described in the next section does not require over-parameterization and might be suitable for applications that demand the recovery of the true parameters.

1.2. OUR CONTRIBUTIONS:

Towards learning with the same number of training parameters as the ground-truth model, we first study the landscape of the population risk f (•) and give an analytic formula for it -as an explicit function of the ground-truth parameters and training parameters with the randomness of the data being marginalized out. The formula in equation ( 2.3) shows that f (•) is implicitly attempting to solve simultaneously an infinite number of low-rank tensor decomposition problems with commonly shared components.

Inspired by the formula, we design a new training model whose associated loss function -named f and formally defined in equation (2.5) -corresponds to the loss function for decomposing a matrix (2-nd order tensor) and a 4-th order tensor (Theorem 2.2). Empirically, stochastic gradient descent on f learns the network as shown Section 4.

Despite the empirical success of f , we still lack a provable guarantee on the landscape of f . The second contribution of the paper is to design a more sophisticated objective G(•) whose landscape is provably nice -all the local minima of G(•) are proven to be global, and they correspond to the permutation of the true parameters. See Theorem 2.3.

Moreover, the value and the gradient of G can be estimated using samples, and there are no constraints in the optimization. These allow us to use straightforward SGD (see guarantees in Ge et al. (2015) ; Jin et al. (2017) ) to optimize G(•) and converge to a local minimum, which is also a global minimum (Corollary 2.4).

Finally, we also prove a finite-sample complexity result. We will show that with a polynomial number of samples, the empirical version of G share almost the same landscape properties as G itself (Theorem 2.7). Therefore, we can also use an empirical version of G as a surrogate in the optimization.

1.3. RELATED WORK:

The work of Arora et al. (2014) is one of the early results on provable algorithms for learning deep neural networks, where the authors give an algorithm for learning deep generative models with sparse weights. Livni et al. (2014) , Zhang et al. (2016; 2017b) , and Daniely et al. (2016) study the learnability of special cases of neural networks using ideas from kernel methods. Janzamin et al. (2015) give a polynomial-time algorithm for learning one-hidden-layer neural networks with twice-differentiable activation function and known input distributions. Their approach uses the idea of score function to estimate the high order tensors related to the true components, and then apply tensor decompositions to recover the true parameters. When applied to Gaussian input distribution, the score function becomes Hermite polynomials.

A series of recent papers study the theoretical properties of non-convex optimization algorithms for one-hidden-layer neural networks. Brutzkus & Globerson (2017) and Tian (2017) analyze the landscape of the population risk for one-hidden-layer neural networks with Gaussian inputs under the assumption that the weights vector associated to each hidden variable (that is, the filters) have disjoint supports. Li & Yuan (2017) proves that stochastic gradient descent recovers the ground-truth parameters when the parameters are known to be close to the identity matrix. Zhang et al. (2017a) study the optimization landscape of learning one-hidden-layer neural networks with a specific activation function, and they design a specific objective function that can recover a single column of the weight matrix. Zhong et al. (2017) study the convergence of non-convex optimization from a good initializer that is produced by tensor methods. Our algorithm works for a large family of activation functions (including ReLU) and any full-rank weight matrix. To our best knowledge, we give the first global convergence result for gradient-based methods for our general setting. 3The optimization landscape properties have also been investigated on simplified neural networks models. Kawaguchi (2016) shows that the landscape of deep neural nets does not have bad local minima but has degenerate saddle points. Hardt & Ma (2017) show that re-parametrization using identity connection as in residual networks He et al. (2016a) can remove the degenerate saddle points in the optimization landscape of deep linear residual networks. Soudry & Carmon (2016) show that an over-parameterized neural network does not have bad differentiable local minimum. Hardt et al. (2016) analyze the power of over-parameterization in a linear recurrent network (which is equivalent to a linear dynamical system.)

The optimization landscape has also been analyzed for other machine learning problems, including SVD/PCA phase retrieval/synchronization, orthogonal tensor decomposition, dictionary learning, matrix completion, matrix sensing Baldi & Hornik (1989) Notations: We use • to denote the Euclidean norm of a vector and spectral norm of a matrix. We use • F to denote the Frobenius/Euclidean norm of a matrix or high-order tensor. For a vector x, let x 0 denotes its infinity norm and for a matrix A, let |A| 0 be a shorthand for vec(A) 0 where vec(A) is the vectorization of A.

We use A ⊗ B to denote the Kronecker product of A and B, and A ⊗k is a shorthand for A ⊗ • • • ⊗ A where A appears k times. For vectors a ⊗ b and a ⊗k denote the tensor product. We denote the identity matrix in dimension d × d by Id d×d , or Id when the dimension is clear from the context. We will define other notations when we first use them.

2. MAIN RESULTS:

2.1 CONNECTING 2 POPULATION RISK WITH TENSOR DECOMPOSITION

We first show that a natural 2 loss for the one-hidden-layer neural network can be interpreted as simultaneously decomposing tensors of different orders.

A straightforward approach of learning the model (1.1) is to parameterize the prediction by

ŷ = a σ(Bx) , (2.1)

where a ∈ R d , B ∼ R m×d are the training parameters. Naturally, we can use 2 as the empirical loss, which means the population risk is

f (a, B) = E ŷ -y 2 . (2.2)

Throughout the paper, we use b 1 , . . . , b m to denote the row vectors of B and similarly for B.

That is, we have

B =    b 1 . . . b m    and B =    b 1 . . . b m   .

Let a i and a i 's be the coordinates of a and a respectively.

We give the following analytic formula for the population risk defined above. Theorem 2.1. Assume vectors b i , b i 's are unit vectors. Then, the population risk f defined in equation (2.2) satisfies that

f (a, B) = k∈N σ2 k i∈[m] a i b i ⊗k - i∈[m] a i b ⊗k i 2 F + const . (2.3)

where σk is the k-th Hermite coefficient of the function σ. See section A.1 for a short introduction of Hermite polynomial basis.4 

Connection to tensor decomposition: We see from equation (2.3) that the population risk of f is essentially an average of infinite number of loss functions for tensor decomposition. For a fixed k ∈ N, we have that the k-th summand in equation (2.3) is equal to (up to the scaling factor σ2 k )

f k T k - i∈[m] a i b ⊗k i 2 F . (2.4)

where

T k = i∈[m] a i b i ⊗k is a k-th order tensor in (R d ) ⊗k .

We note that the objective f k naturally attempts to decompose the k-order rank-m tensor T k into m rank-1 components a 1 b ⊗k i , . . . , a m b ⊗k m . The proof of Theorem 2.1 follows from using techniques in Hermite Fourier analysis, which is deferred to Section A.2.

Issues with optimizing f :. It turns out that optimizing the population risk using stochastic gradient descent is empirically difficult. Figure 1 shows that in a synthetic setting where the noise is zero, the test error empirically doesn't converge to zero for sufficiently long time with various learning rate schemes, even if we are using fresh samples in iteration. This suggests that the landscape of the population risk has some spurious local minimum that is not a global minimum. See Section 4 for more details on the experiment setup.

An empirical fix:. Inspired by the connection to tensor decomposition objective described earlier in the subsection, we can design a new objective function that takes exactly the same form as the tensor decomposition objective function f 2 + f 4 . Concretely, let's define ŷ = a γ(Bx) where γ = σ2 h 2 + σ4 h 4 and h 2 (t) = 1 √ 2 (t 2 -1) and h 4 (t) = 1 √ 24 (t 4 -6t 2 + 3) are the 2nd and 4th normalized probabilists' Hermite polynomials Wikipedia (2017a). We abuse the notation slightly by using the same notation to denote the its element-wise application on a vector. Now for each example we use ŷ -y 2 as loss function. The corresponding population risk is

f (a, B) = E ŷ -y 2 .

(2.5)

Now by an extension of Theorem 2.1, we have that the new population risk is equal to the σ2 2 f 2 + σ2 4 f 4 . Theorem 2.2. Let f be defined as in equation (2.5) and f 2 and f 4 be defined in equation (2.4). Assume b i , b i 's are unit vectors. Then, we have

f = σ2 2 f 2 + σ2 4 f 4 + const (2.6)

It turns out stochastic gradient descent on the objective f (a, B) (with projection to the set of matrices B with row norm 1) converges empirically to the ground truth (a , B ) or one of its equivalent permutations. (See Figure 3 .) However, we don't know of any existing work for analyzing the landscape of the objective f (or f k for any k ≥ 3). We conjecture that the landscape of f doesn't have any spurious local minimum under certain mild assumptions on (a , B ). Despite recent attempts on other loss functions for tensor decomposition Ge & Ma (2017) , we believe that analyzing f is technically challenging and its resolution will be potentially enlightening for the understanding landscape of loss function with permutation invariance. See Section 4 for more experimental results.

2.2. LANDSCAPE DESIGN FOR ORTHOGONAL B:

The population risk defined in equation (2.5) -though works empirically for randomly generated ground-truth (a , B ) -doesn't have any theoretical guarantees. It's also possible that when (a , B ) are chosen adversarially or from a different distribution, SGD no longer converges to the true parameters.

To solve this problem, we design another objective function G(•), such that the optimizer of G(•) still corresponds to the ground-truth, and G() has provably nice landscape -all local minima of G() are global minima.

In this subsection, for simplicity, we work with the case when B is an orthogonal matrix and state our main result. The discussion of the general case is deferred to the end of this Section and Section C.

We define our objective function G(B) as

G(B) sign(σ 4 ) E   y • j,k∈[d],j =k φ(b j , b k , x)   -µ sign(σ 4 ) E   y • j∈[d] ϕ(b j , x)   + λ m i=1 ( b i 2 -1) 2 (2.7)

where ϕ(•, •) is defined as

ϕ(v, x) = 1 8 v 4 - 1 4 (v x) 2 v 2 + 1 24 (v x) 4 . (2.8) and φ(•, •, •) is defined as φ(v, w, x) = 1 2 v 2 w 2 + v, w 2 - 1 2 w 2 (v x) 2 - 1 2 v 2 (w x) 2 + 2(v x)(w x)v w + 1 2 (v x) 2 (w x) 2 .

(2.9)

The rationale behind of the choices of φ and ϕ will only be clearer and relevant in later sections.

For now, the only relevant property of them is that both are smooth functions whose derivatives are easily computable.

We remark that we can sample G(•) using the samples straightforwardly -it's defined as an average of functions of examples and the parameters. We also note that only parameter B appears in the loss function. We will infer the value of a using straightforward linear regression after we get the (approximately) accurate value of B .

Due to technical reasons, our method only works for the case when a i > 0 for every i. We will assume this throughout the rest of the paper. The general case is left for future work. Let a max = max a i , a min = min a i , and κ = max a i / min a i . Our result will depend on the value of κ .

Essentially we treat κ as an absolute constant that doesn't scale in dimension. The following theorem characterizes the properties of the landscape of G(•). Theorem 2.3. Let c be a sufficiently small universal constant (e.g. c = 0.01 suffices) and suppose the activation function The theorem above implies that we can learn B (up to permutation of rows and sign-flip) if we take λ to be sufficiently large and optimize G(•) using stochastic gradient descent. In this case, the diagonal matrix D in bullet 1 is sufficiently close to identity (up to sign flip) and therefore a local minimum B is close to B up to permutation of rows and sign flip. The sign of each b i can be recovered easily after we recover a (see Lemma 2.5 below.)

σ satisfies σ4 = 0. Assume µ ≤ c/κ , λ ≥ c -1 a max ,

SGD converges to a local minimum Ge et al. (2015) (under the additional property as established in bullet 2 above), which is also a global minimum for the function G(•). We will prove the theorem in Section B as a direct corollary of Theorem B.1. The technical bullet 2 and 3 of the theorem is to ensure that we can use SGD to converge to a local minimum as stated below. 6 Corollary 2.4. In the setting of Theorem 2.3, we can use stochastic gradient descent to optimize function G(•) (with fresh samples at each iteration) and converge to an approximate global minimum B that is ε-close to a global minimum in time poly(d, 1/ε).

After approximately recovering the matrix B , we can also recover the coefficient a easily. Note that fixing B, we can fit a using simply linear regression. For the ease of analysis, we analyze a slightly different algorithm. The lemma below is proved in Section D. Lemma 2.5. Given a matrix B whose rows have unit norm, and are δ-close to B in Euclidean distance up to permutation and sign flip with δ ≤ 1/(2κ ). Then, we can give estimates a, B (using e.g., Algorithm 1) such that there exists a permutation P where a -P a ∞ ≤ δa max and B is row-wise δ-close to P B .

The key step towards analyzing objective G(B) is the following theorem that gives an analytic formula for G(•).

Theorem 2.6. The function G(•) satisfies

G(B) = 2 √ 6|σ 4 | • i∈[d] a i j,k∈[d],j =k b i , b j 2 b i , b k 2 - |σ 4 |µ √ 6 i,j∈[d] a i b i , b j 4 + λ m i=1 ( b i 2 -1) 2

(2.10) Theorem 2.6 is proved in Section A. We will motivate our design choices with a brief overview in Section 3 and formally analyze the landscape of G in Section B (see Theorem B.1).

Finite sample complexity bounds. Extending Theorem 2.3, we can characterize the landscape of the empirical risk G, which implies that stochastic gradient on G also converges approximately to the ground-truth parameters with polynomial number of samples. Theorem 2.7. In the setting of Theorem 2.3, suppose we use N empirical samples to approximate G and obtain empirical risk G. There exists a fixed polynomial poly(d, 1/ε) such that if N ≥ poly(d, 1/ε), then with high probability the landscape of G has the properties to that of G in bullet 2 and 3 of Theorem 2.3.

All of the results above assume that B is orthogonal. Since the local minimum are preserved by linear transformation of the input space, these results can be extended to the general case when B is not orthogonal but full rank (with some additional technicality) or the case when the dimension is larger than the number of neurons (m < d). See Section C.

3. OVERVIEW: LANDSCAPE DESIGN AND ANALYSIS:

In this section, we present a general overview of ideas behind the design of objective function G(•).

Inspired by the formula (2.3), in Section 3.1, we envision a family of possible objective functions for which we have unbiased estimators via samples. In Section 3.2, we pick a specific function that feeds our needs: a) it has no spurious local minimum; b) the global minimum corresponds to the ground-truth parameters.

3.1. WHICH OBJECTIVE CAN BE ESTIMATED BY SAMPLES?:

Recall that in equation (2.2) of Theorem 2.1 we give an analytic formula for the straightforward population risk f . Although the population risk f doesn't perform well empirically, the lesson that we learn from it help us design better objective functions. One of the key fact that leads to the proof of Theorem 2.1 is that for any continuous and bounded function γ, we have that

E y • γ(b i x) = k∈N γk σk ( j∈[d] a j b j , b i k ) .

Here σk and γk are the k-th Hermite coefficient of the function σ and γ. That is, letting h k the k-th normalized probabilists' Hermite polynomials Wikipedia (2017a) and •, • be the standard inner product between functions, we have σk = h k , σ .

Note that γ can be chosen arbitrarily to extract different terms. For example, by choosing γ = h k , we obtain that

E y • h k (b i x) = σk j∈[d] a j b j , b i k . (3.1)

That is, we can always access functions forms that involves weighted sum of the powers of b i , b i , as in RHS of equation (3.1). Using a bit more technical tools in Fourier analysis (see details in Section A), we claim that most of the symmetric polynomials over variables b i , b j can be estimated by samples: Claim 3.1 (informal). For any polynomial p() over a single variable, there exits a corresponding function φ p such that

E [y • φ p (B, x)] = j a j i p( b j , b i ) (3.2)

Published as a conference paper at ICLR 2018 Moreover, for an any polynomial q(•, •) over two variables, there exists corresponding φ q such that

E [y • φ q (B, x)] = j a j i,k q( b j , b i , b k , b i ) (3.3)

We will not prove these two general claims. Instead, we only focus on the formulas in Theorem A.5 and Theorem A.6, which are two special cases of the claims above.

Motivated by Claim A.3, in the next subsection, we will pick an objective function which has no spurious local minimum among those functional forms on the right-hand sides of equation (3.2) and (3.3).

3.2. WHICH OBJECTIVE HAS NO SPURIOUS LOCAL MINIMA?:

As discussed briefly in the introduction, one of the technical difficulties to design and analyze objective functions for neural networks comes from the permutation invariance -if a matrix B is a good solution, then any permutation of the rows of B still gives an equally good solution (if we also permute the coefficients in a accordingly). We only know of a very limited number of objective functions that guarantee to enjoy permutation invariance and have no spurious local minima Ge et al. (2015) . We start by considering the objective function used in Ge et al. (2015) ,

min P (B) = i j =k b i , b j 2 b i , b k 2 s.t. ∀i ∈ [d], b i = 1 (3.4)

Note that here we overload the notation by using b i 's to denote a set of fixed vectors that we wanted to recover and using b i 's to denote the variables. Careful readers may notice that P (B) doesn't fall into the family of functions that we described in the previous section (that is, RHS equation of (3.2) and (3.3)), because it lacks the weighting a i 's. We will fix this issue later in the subsection. Before that we first summarize the nice properties of the landscape of P (B).

For the simplicity of the discussion, let's assume B forms an orthonormal matrix in the rest of the subsection. Then, any permutation and sign-flip of the rows of B leads to a global minimum of P (•) -when B = SQB with a permutation matrix Q and a sign matrix S (diagonal with ±1), we have that P (B) = 0 because one of b i , b j 2 and b i , b k 2 has to be zero for all i, j, k7 ).

It turns out that these permutations/sign-flips of B are also the only local minima8 of function P (•). To see this, notice that P (B) is a degree-4 polynomial of B. Thus if we pick an index s and fix every row except for b s , then P (B) is a quadratic function over unit vector b s -reduces to a smallest eigenvector problem. Eigenvector problems are known to have no spurious local minimum. Thus the corresponding function (w.r.t b s ) has no spurious local minimum. It turns out the same property still holds when we treat all the rows as variables and add the row-wise norm constraints.

However, there are two issues with using objective function P (B). The obvious one is that it doesn't involve the coefficients a i 's and thus doesn't fall into the forms of equation (3.3). Optimistically, we would hope that for nonnegative a i 's the weighted version of P below would also enjoy the similar landscape property

P (B) = i a i j =k b i , b j 2 b i , b k 2

When a i 's are positive, indeed the global minimum of P are still just all the permutations of the B .9 However, when max a i > 2 min a i , we found that P starts to have spurious local minima . It seems that spurious local minimum often occurs when a row of B is a linear combination of a smaller number of rows of B . See Section F for a concrete example. To remove such spurious local minima, we add a regularization term below that pushes each row of B to be close to one of the rows of B ,

R(B) = -µ i a i j b i , b j 4 (3.5)

We see that for each fixed j, the part in R(B) that involves b j has the form

-µ i a i b i , b j 4 = -µ i a i b i ⊗4 , b ⊗4 j

This is commonly used objective function for decomposing tensor i a i b i ⊗4 . It's known that for orthogonal b i 's, the only local minima are ±b 1 , . . . , ±b d Ge et al. (2015) . Therefore, intuitively R(B) pushes each of the b i 's towards one of the b i 's.10 Choosing µ to be small enough, it turns out that P (B) + R(B) doesn't have any spurious local minimum as we will show in Section B.

Another issue with the choice of P (B) + R(B) is that we are still having a constraint minimization problem. Such row-wise norm constraints only make sense when the ground-truth B is orthogonal and thus has unit row norm. A straightforward generalization of P (B) to non-orthogonal case requires some special constraints that also depend on the covariance matrix B B , which in turn requires a specialized procedure to estimate. Instead, we move the constraints into the objective function by considering adding another regularization term that approximately enforces the constraints.

It turns out the following regularizer suffices for the orthogonal case: S(B) = λ i ( b i 2 -1) 2 . Moreover, we can extend this easily to the non-orthogonal case (see Section C) without estimating any statistics of B in advance. We note that S(B) is not the Lagrangian multiplier and it does change the global minima slightly. We will take λ to be large enough so that b i has to be close to 1. As a summary, we finally use the unconstrained objective

min G(B) P (B) + R(B) + S(B)

Since R(B) and S(B) are degree-4 polynomials of B, the analysis of G(B) is much more delicate, and we cannot use much linear algebra as we could for P (B). See Section B for details.

Finally we note that a feature of this objective G(•) is that it only takes B as variables. We will estimate the value of a after we recover the value of B. (see Section D).

4. SIMULATION:

In this section, we provide simple simulation results that verify that minimizing G(B) with SGD recovers a permutation of B ; however, minimizing Equation (2.2) with SGD results in finding spurious local minima. Based on the formula for the population risk in Equation ( 2.3), we also verified empirically the conjecture that SGD would successfully recover B using the activation functions γ(z) = σ2 h 2 (z) + σ4 h 4 (z),11 even if the data were generated via a model with ReLU activation. (See Section 2.1 for the rationale behind such conjectures.) For all of our experiments, we chose B = Id d×d with dimension d = 50 and a = 1 for simplicity, and the data is generated from a one-hidden-layer network with ReLU or Sigmoid activation without noise. We use stochastic gradient descent with fresh samples at each iteration, and we plot the (expected) population error (that is, the error on a fresh batch of examples).

To test whether SGD converges to a matrix B which is equivalent to B up to permutation of rows, we use a surrogate error metric to evaluate whether B -1 B is close to a permutation matrix. Given a matrix Q with row norm 1, let

e(Q) = min{1 -min i max j |Q ij |, 1 -min j max i |Q ij |}. (4.1)

Then we have that if e(Q) ≤ ε for some ε < 1/3, then it implies that Q is √ 2ε-close to a permutation matrix in infinity norm. On the other direction, we know that if e(Q) > ε, then Q is not ε-close to any permutation matrix in infinity norm. The latter statement also holds when Q doesn't have row norm 1.

Figure 1 shows that without over-parameterization, using ReLU as an activation function, SGD doesn't converge to zero test error and the ground-truth parameters. We decreased step-size by a factor of 4 every 5000 number of iterations after the error plateaus at 10000 iterations. For the final 5000 iterations, the step-size is less than 10 -9 , so we can be confident that the non-zero objective value is not due to the variance of SGD. We see that none of the five runs of SGD converged to a global minimum. Figure 2 shows the result for sigmoid activation which is quantitatively similar.

Figure 3 shows that using σ2 h 2 + σ4 h 4 as the activation function, SGD with projection to the set of matrices B with row norm 1 converges to the ground-truth parameters. We also plot the loss function which converges the value of a global minimum. (We subtracted the constant term in equation (2.6) so that the global minimum has loss 0.)

Figure 4 shows that using our objective function G(B), the iterate converges to a permutation of the ground truth matrix B . The fact that the parameter error goes up and down is not surprising, because the algorithm first gets close to a saddle point and then breaks ties and converges to a one of the global minima.

Finally we note that using the loss function G(•) seems to require significantly larger batch (and sample complexity) to reduce the variance in the gradients estimation. We used batch size 262144 in the experiment for G(•). However, in contrast, for the σ2 h 2 + σ4 h 4 we used batch size 8192 and for relu we used batch size 256.

5. CONCLUSION:

In this paper we first give an analytic formula for the population risk of the standard 2 loss, which empirically may converge to a spurious local minimum. We then design a novel population loss that is guaranteed to have no spurious local minimum.

Designing objective functions with well-behaved landscape is an intriguing and potentially fruitful direction. We hope that our techniques can be useful for characterizing and designing the optimization landscape for other settings.

We conjecture that the objective αf 2 + βf 412 has no spurious local minimum when α, β are reasonable constants and the ground-truth parameters are in general position. We provided empirical evidence to support the conjecture.

Our results assume that the input distribution is Gaussian. Extending them to other input distributions is a very interesting open problem. 

A ANALYTIC FORMULA FOR POPULATION RISKS:

A.1 BASICS ON HERMITE POLYNOMIALS

In this section, we briefly review Hermite polynomials and Fourier analysis on Gaussian space. Let H j be the probabilists' Hermite polynomial Wikipedia (2017a), and let h j = 1 √ j! H j be the normalized Hermite polynomials. The normalized Hermite polynomial forms a complete orthonormal basis in the function space L 2 (R, e -x 2 /2 ) in the following sense 13 . For two functions f, g that map R to R, define the inner product f, g with respect to the Gaussian measure as

f, g = E x∼N (0,1) [f (x)g(x)] .

The polynomials h 0 , . . . , h m , . . . are orthogonal to each other under this inner product:

h i , h j = δ ij .

Here

δ ij = 1 if i = j and otherwise δ ij = 0. Given a function σ ∈ L 2 (R, e -x 2 /2

) , let the k-th Hermite coefficient of σ be defined as

σk = σ, h k .

Since h 0 , . . . , h m , . . . , forms a complete orthonormal basis, we have the expansion that

σ(x) = k∈N σk h k (x) .

We will leverage several other nice properties of the Hermite polynomials in our proofs. The following claim connects the Hermite polynomial to the coefficients of Taylor expansion of a certain exponential function. It can also serve as a definition of Hermite polynomials.

Claim A.1 ((O'Donnell, 2014, Equation 11.8)). We have that for t, z ∈ R,

exp(tz - 1 2 t 2 ) = ∞ k=0 1 k! H k (z)t k .

The following Claims shows that the expectation E [h n (x)h m (y)] can be computed easily when x, y are (correlated) Gaussian random variables. Claim A.2 ((O'Donnell, 2014, Section 11.2)). Let (x, y) be ρ-correlated standard normal variables (that is, both x,y have marginal distribution N (0, 1) and E[xy] = ρ). Then,

E [h m (x)h n (y)] = ρ n δ mn .

As a direct corollary, we can compute Ex∼N (0,Id d×d ) σ(u x)γ(v x) by expanding in the Hermite basis and applying the Claim above.

Claim A.3. Let σ, γ be two functions from R to R such that σ 2 , γ 2 ∈ L 2 (R, e -x 2 /2 ). Then, for any unit vectors u, v ∈ R d , we have that

E x∼N (0,Id d×d ) σ(u x)γ(v x) = i∈N σi γi u, v i .

Proof of Claim A.3. Let s = u x and t = v x. Then s, t are two spherical standard normal random variables that are u, v -correlated, and we have that

E x∼N (0,Id d×d ) σ(u x)γ(v x) = E [σ(s)γ(t)] .

We expand σ(s) and γ(t) in the Fourier basis and obtain that

E [σ(s)γ(t)] = E   i∈N σi h i (s) j∈N γj h j (t)   = i,j σi γj E [h i (s)h j (t)] = i σi γi u, v i (by Claim A.2) A.2 ANALYTIC FORMULA FOR POPULATION RISK f AND f

In this section we prove Theorem 2.1 and Theorem 2.2, which both follow from the following more general Theorem.

Theorem A.4. Let γ, σ ∈ L 2 (R, e -x 2 /2 ), and ŷ = a γ(Bx) with parameter a ∈ R and B ∈ R ×d . Define the population risk f γ as

f γ (a, B) = E y -ŷ 2 . Suppose B =    b 1 . . . b    and B =    b 1 . . . b m    and b i 's and b i 's have unit 2 norm. Then, f (a, B) = k∈N σk i∈[m] a i b i ⊗k -γk i∈[ ] a i b ⊗k i 2 F + const,

where σk , γk are the k-th Hermite coefficients of the function σ and γ respectively.

We can see that Theorem 2.1 follows from choosing γ = σ and Theorem 2.2 follows from choosing γ = σ2 h 2 + σ4 h 4 . The key intuition here is that we can decompose σ into a weighted combination of Hermite polynomials, and each Hermite polynomial influence the population risk more or less independently (because they are orthogonal polynomials with respect to the Gaussian measure).

Proof of Theorem A.4. We have

f γ = E ŷ -y 2 = E a σ(B x) -a γ(Bx) 2 = E    i∈[m] a i σ(b i x) - i∈[ ] a i γ(b i x) 2    = i∈[m],j∈[ ] E a i a j σ(b i x)σ(b j x) + i∈[m],j∈[ ] E a i a j γ(b i x)γ(b j x) -2 i∈[m],j∈[ ] E a i a j σ(b i x)γ(b j x) = i,j∈[m] a i a j k∈N σ2 k b i , b j k + i,j∈[ ] a i a j k∈N γ2 k b i , b j k -2 i∈[m],j∈[ ] a i a j k∈N σk γk b i , b j k (by Claim A.3) = k∈N σk i∈[m] a i b i ⊗k -γk i∈[ ] a i b ⊗k i 2 F . A.3 ANALYTIC FORMULA FOR POPULATION RISK G

In this section we show that the population risk G(•) (defined as in equation (2.7)) has the following analytical formula:

G(B) = 2 √ 6| σ4 | • i∈[d] a i j,k∈[d],j =k b i , b j 2 b i , b k 2 - |σ 4 |µ √ 6 i,j∈[d] a i b i , b j 4 + λ m i=1 ( b i 2 -1) 2 .

The formula will be crucial for the analysis of the landscape of G(•) in Section B. The formula follows straightforwardly from the following two theorems and the definition (2.7). Theorem A.5. Let φ(•, •, •) be defined as in equation (2.9), we have that

E   y • j,k∈[d],j =k φ(b j , b k , x)   = 2 √ 6σ • i∈[d] a i j,k∈[d],j =k b i , b j 2 b i , b k 2 .

Theorem A.6. Let ϕ(•, •) be defined as in equation (2.8), then we have that

E   y • j∈[d] ϕ(b j , x)   = σ4 √ 6 i,j∈[d] a i b i , b j 4 .

In the rest of the section we prove Theorem A.5 and A.6.

We start with a simple but fundamental lemma. Essentially all the result in this section follows from expanding the two sides of equation (A.1) below.

Lemma A.7. Let u, v ∈ R d be two fixed vectors and x ∼ N (0, Id d×d ). Then, for any s, t ∈ R,

exp( u, v st) = E exp(u xt - 1 2 u 2 t 2 ) exp(v xs - 1 2 v 2 s 2 ) . (A.1)

Proof. Using the fact that E exp(v x) = exp( 1 2 v 2 ), we have that,

E exp(u xt - 1 2 u 2 t 2 ) exp(v xs - 1 2 v 2 s 2 ) = E exp((tu + sv) x) exp(- 1 2 u 2 t 2 - 1 2 v 2 s 2 ) = exp( 1 2 tu + sv 2 - 1 2 u t 2 - 1 2 v 2 s 2 ) (by the formula E exp(v x) = exp( 1 2 v 2 )) = exp( u, v st) .

Next we extend some of the results in the previous section to the setting with different scaling (such as when v in Claim A.3 is no longer a unit vector.) Lemma A.8. Let u be a fixed unit vector and v be an arbitrary vector in

R d . Let ϕ(v, x) = 1 8 v 4 -1 4 (v x) 2 v 2 + 1 24 (v x) 4 . u, v 4 δ 4,k = E H k (u x)ϕ(v, x) (A.2)

As a sanity check, we can verify that when v is a unit vector, ϕ(v, x) = √ 24h 4 (v x) and th Lemma reduces to a special case of Claim A.2.

Proof. Let A, B be formal power series in variable s, t defined as A = exp( u, v st) and B = E exp(u xt -1 2 u 2 t 2 ) exp(v xs -1 2 v 2 s 2 ) . We refer the readers to Wikipedia (2017b) for more backgrounds of power series. For casual readers, one can just think of A as B as two power series obtained by expanding the exp(•) via Taylor expansion. For a formal power series A in variable x, let [x α ]A to denote coefficient in front of the monomial x α . By Lemma A.7, we have that A = B, and thus

[s 4 t k ]A = [s 4 t k ]B , (A.3) which implies that 1 24 u, v 4 δ 4,k = E [t k ] exp(u xt - 1 2 t 2 ) • [s 4 ] exp(v xs - 1 2 v 2 s 2 ) = E 1 k! H k (u x)ϕ(v, x) . (A.4)

where the last line is by the fact that ϕ

(v, x) = [s 4 ] exp(v xs -1 2 v 2 s 2

). This can be verified by applying Claim A.1 with t = s v and z = v T x v , and noting that H 4 (x) = x 4 -6x 2 + 3. Now we are ready prove Theorem A.6 using Lemma A.8.

Proof of Theorem A.6. Using the fact that σ

(v x) = ∞ k=0 σk h k (v x), we have that E   y • j ϕ(b j , x)   = i,j∈[d] a i E σ(b i x)ϕ(b j , x) = i,j∈[d] a i ∞ k E σk h k (b i x)ϕ(b j , x) = i,j∈[d] a i E σ4 h 4 (b i x)ϕ(b j , x) = σ4 √ 6 i,j∈[d] a i b i , b j 4

(by Lemma A.8 and

h j = 1 √ j H j )

Towards proving Theorem A.5, we start with the following Lemma. Inspired by the proofs above, we design a function φ(v, w, x) such that we can estimate u, v 2 u, w 2 by taking expectation of E σ(u x)φ(v, w, x) . Lemma A.9. Let a be a fixed unit vector in R d and v, w two fixed vectors in R d . Let ϕ(•, •) be defined as in Lemma A.8. Define φ(v, w, x) as

φ(v, w, x) = ϕ(v + w, x) + ϕ(v -w, x) -2ϕ(v, x) -2ϕ(w, x) (A.5) = 1 2 v 2 w 2 + v, w 2 - 1 2 w 2 (v x) 2 - 1 2 v 2 (w x) 2 (A.6) -2(v x)(w x)v w + 1 2 (v x) 2 (w x) 2 .

Then, we have that

E σ(u x)φ(v, w, x) = 2 √ 6σ 4 u, v 2 u, w 2 .

Proof. Using the fact that u, v + w 2 + u, v -w 4 -2 u, v 2 -2 u, w 4 = 12 u, v 2 u, w 2 and Lemma A.8, we have that

12 u, v 2 u, w 2 δ 4,k = E H k (u x)(ϕ(v + w, x) + ϕ(v -w, x) -2ϕ(v, x) -2ϕ(w, x)) = E H k (u x)φ(v, w, x) . (A.7)

Using the fact that σ(u x) = ∞ k=0 σk h k (u x), we conclude that

E σ(u x)φ(v, w, x) = ∞ k=0 σk E h k (u x)φ(v, w, x) = σ4 √ 6 E H 4 (u x)φ(v, w, x) (by Lemma A.8 and h j = 1 √ j H j ) = 2 √ 6σ 4 u, v 2 u, w 2 (by Lemma A.8 again)

Now we are ready to prove Theorem A.5 by using Lemma A.9 for every summand.

Proof of Theorem A.5. We have that

E   y • j,k φ(b j , b k , x)   = i a i j,k E σ(b i x)φ(b j , b k , x) = 2 √ 6σ 4 i a i j,k b i , b j 2 b i , b k 2 .

(by Lemma A.9)

B LANDSCAPE OF POPULATION RISK G(•):

In this section we prove Theorem 2.3. Since the landscape property is invariant with respect to rotations of parameters, without loss of generality we assume B is the identity matrix Id throughout Published as a conference paper at ICLR 2018 this section. (See Section C for a precise statement for the invariance.) Recall that by Theorem 2.6, the population risk G(•) in the case of B = Id is equal to

G(B) = 2 √ 6|σ 4 | i a i j =k (b j e i ) 2 (b k e i ) 2 - |σ 4 |µ √ 6 d i=1 a i d j=1 (b j e i ) 4 + λ d j=1 b j 2 -1 2 . (B.1)

In the rest of section we work with the formula above for G(•) instead of the original definition.

In fact, for future reference, we study a more general version of the function G. For nonnegative vectors α, β and nonnegative number µ, let G α,β,µ be defined as

G α,β,µ (B) = d i=1 α i j =k (b j e i ) 2 (b k e i ) 2 -µ d i=1 β i d j=1 (b j e i ) 4 + λ d j=1 ( b j 2 -1) 2 (B.2)

Here e i denotes the i-th natural basis vector. We see that G is sub-case of G α,β,µ and we prove the following extension of Theorem 2.3. Let α max = max i α i and α min = min i α i . Then B can be written as B = DP + E where P is a permutation matrix, D is a diagonal matrix with the entries satisfying

1 1 -µβi λ 1 - 18dε 2 β 2 min - ε 2λ ≤ D 2 ii ≤ 1 1 -µβi λ 1 + ε 2λ

and E is an error matrix satisfying 

|E| ∞ ≤ 3ε/β min . As a direct consequence, B is O d (ε)-

h α,β,λ (x) = d i=1 α i x 2 i - d i=1 β i x 4 i + λ x 2 -1 2 (B.3)

We can see that setting α i = a i k =s (b k e i ) 2 , β i = a i , and x = b s gives us the original objective G(B). In this subsection, we will work with h(•) and analyze the properties of the local minima of h(•).

The following lemma shows that a local minimum x of the objective h(•) must be a scaling of a basis vector. For a vector x, let |x| 2nd denotes the second largest absolute values of the entries for x.

We note that |•| 2nd is not a norm. The lemma deals generally an approximate local minimum, though we suggest casual readers simply think of ε, τ = 0 in the lemma. Lemma B.2. Let h(•) be in equation (B.3) with non-negative vectors α and β in R d . Suppose parameters ε, τ ≥ 0 satisfy that ε ≤ τ 3 /β min . If some point x satisfies ∇h(x) ≤ ε and λ min (∇ 2 h(x)) ≥ -τ , then we have

|x| 2nd ≤ τ β min .

Proof. Without loss of generality, we can take ε = τ 3 /β min which means τ = ε 2/3 β 1/3 min . The gradient and Hessian of function h(•) are

∇h(x) = 2 diag(α)x -4 diag(β)x 3 + γx ∇ 2 h(x) = 2 diag(α) -12 diag(β x 2 ) + γId + 8λxx . (B.4)

where γ 4λ( x 2 -1).

Let S = {i : |x i | ≥ δ} be the indices of the coordinates that are significantly away from zero, where We take v ∈ R d such that v 1 = -x 2 / x 2 1 + x 2 2 , and v 2 = x 1 / x 2 1 + x 2 2 , and v j = 0 for j ≥ 2. Then we have that v x = 0 and v = 1. We evaluate the quadratic form and have that

δ = ε βmin 1/3 . Since ∇h(x) ≤ ε, we have that |∇h(x) i | ≤ ε for every i ∈ [d], which implies that ∀i ∈ [d], 2α i x i + γx i -4β i x 3 i ≤ ε (B.5) which further implies that ∀i ∈ S, 2α i + γ -4β i x 2 i ≤ ε δ (B.6) If |S| = 1,

v ∇ 2 h(x)v = v (2 diag(α) + γI d )v -12v diag(β x 2 )v (since v x = 0) = (2α 1 + γ)v 2 1 + (2α 2 + γ)v 2 2 -12β 1 v 2 1 x 2 1 -12β 2 v 2 2 x 2 2 ≤ -8β 1 v 2 1 x 2 1 -8β 2 v 2 2 x 2 2 + ε δ (by equation (B.6) and v = 1) ≤ -8(β 1 + β 2 ) x 2 2 x 2 1 x 2 1 + x 2 2 + ε δ ≤ -8β min x 2 2 + ε δ . Recall that δ = ε βmin 1/3 . Then we conclude that v ∇ 2 h(x)v ≤ -6β 1/3 min ε 2/3 = -6τ.

This contradicts with the assumption that λ min (∇ 2 h(x)) ≥ -β 1/3 min ε 2/3 = τ and that v = 1. Therefore we have |S| = 1 and

|x| 2nd ≤ δ = ε β min 1/3 ≤ τ β min (using ε ≤ τ 3 /β min )

For future reference, we can also show that for a sufficiently strong regularization term (sufficiently large λ), the norm of a local minimum x should be bounded from below and above by 1/2 and 2. This are rather coarse bounds that suffice for our purpose in this subsection. In Section B.2 we will show that all the rows of a local minimum B of G have norm close to 1. Lemma B.3. In the setting of Lemma B.2, 1. Suppose in addition that λ ≥ 4 max(β max , τ ) and ε ≤ 0.1β min d -3/2 , then

x 2 ≤ 2 .

2. Let i = arg max i |x i |. In addition to the previous conditions in bullet 1, assume that λ ≥ 4α i . Then,

x 2 ≥ 1 2 .

We remark that we have to state the conditions for the upperbounds and lowerbounds separately since they will be used with these different conditions. . We first show that x 2 ≤ 2. We divide into two cases:

1 S is empty. Since ε ≤ 0.1β min d -3/2 , then δ ≤ √ 2 √ d . We conclude that x 2 ≤ 2. 2 S is non-empty. For i ∈ S, recall equation (B.6) which implies that

4λ( x 2 -1) ≤ ε δ + 4β i x 2 i ≤ ε δ + 4β max x 2 x 2 ≤ ε 4λδ + β max λ x 2 + 1 Since λ ≥ 4β max , so λ ≥ β 1/3 min ε 2/3 ≥ 3ε 4δ

, and thus from the display above we have that x 2 ≤ 2.

Next we show that x 2 ≥ 1 2 . Again we divide into two cases:

1. S is empty. For the sake of contradiction, assume that x 2 ≤ 1 2 , then γ ≤ -2λ. We show that there is sufficient negative curvature. Recall that

∇ 2 h(x) = 2 diag(α) -12 diag(β x 2 ) + γI + 8λxx 2 diag(α) -12 diag(β x 2 ) -2λI + 8λxx

Choose index j so that α j = α min , then

e j ∇ 2 h(x)e j = 2α min -12β j x 2 j -2λ + 8λx 2 j ≤ 2α min + 8λδ 2 -2l ≤ 2α min -λ(2 -8δ 2 ) ≤ 2α min - 4 3 λ (by δ 2 ≤ 1 12 ) ≤ - 5 6 λ ≤ -3τ (by λ ≥ 4 max{α min , τ })

This contradicts with the fact that λ min (∇ 2 h(x)) ≥ -τ . Thus when S is empty, x 2 ≥ 1 2 . 2. S is non-empty. Recall that i = arg max i |x i |, and by definition i ∈ S. Using Equation (B.6)

γ ≥ -2α i - ε δ which implies that x 2 ≥ 1 - α i λ - ε 4λδ .

Since λ ≥ 4α i , and λ ≥ β

1/3 min ε 2/3 ≥ ε δ , we conclude that x 2 ≥ 1/2.

We have shown that a local minimum x of h should be a scaling of the basis vector e i . The following lemma strengthens the result by demonstrating that not all basis vector can be a local minimumthe corresponding coefficient α i has to be reasonably small for e i being a local minimum. The key intuition here is that if α i is very large compared to other entries of α, then if we move locally the mass of e i from entry i to some other index j, the objective function will be likely to decrease because α j x 2 j is likely to be smaller than α i x 2 i . (Indeed, we will show that such movement will cause a second-order decrease of the objective function in the proof.) Lemma B.4. In the setting of Lemma B.2, let i = arg max i |x i |. If ∇h(x) ≤ ε, and λ min (∇ 2 h(x)) > -τ for 0 ≤ τ ≤ 0.1β min /d and ε ≤ τ 3 /β min , then

α i ≤ α min + 2ε + 2τ + 4β i .

Proof. For the ease of notation, assume WLOG that i = 1. Let δ = (τ /β min ) 1/2 . By the assumptions, we have that δ ≤ 1 √ 6d . By Lemma B.2, we have x 2 ≥ 1 2 , which implies that

x 2 1 ≥ x 2 -(d -1) |x| 2 2nd ≥ 1 2 -d |x| 2 2nd ≥ 1 -dδ 2 ≥ 1 3 . (B.7) Define v = -x k x1 e 1 + e k . Since x 1 is the largest entry of x, we can verify that 1 ≤ v 2 = 1 + x 2 k x 2 1 ≤ 2. By the assumption, we have that v ∇ 2 h(x)v ≥ -τ v 2 ≥ -4τ . (B.8)

On the other hand, recall the form of Hessian (equation (B.4)), by straightforward algebraic manipulation, we have that

v ∇ 2 h(x)v = v 2 diag(α) -12 diag(β x 2 ) + γId + 8λxx . v = 2α 1 ( x k x 1 ) 2 + 2α k -12β 1 x 2 k -12β k x 2 k + γ( x k x 1 ) 2 + γ (by v x = 0) ≤ (2α 1 + γ)( x k x 1 ) 2 -12(β 1 + β k )x 2 k + 2α k + (4β 1 x 2 1 -2α 1 + ε |x 1 | ) (by equation (B.6)) ≤ (4β 1 x 2 1 + ε |x 1 | )( x k x 1 ) 2 -12(β 1 + β k )x 2 k + 2α k + (4β 1 x 2 1 -2α 1 + ε |x 1 | ) (by equation (B.6)) = -8β 1 x 2 k -12β k x 2 k + 4β 1 x 2 1 + 2α k -2α 1 + 4ε (by |x k | ≤ |x 1 | and |x 1 | 2 ≥ 1/3) ≤ 2α k -2α 1 + 4ε + 8β 1 .

(by x ≤ 2 using Lemma B.2)

Combining equation (B.8) and the equation above gives

α 1 ≤ α k + 2ε + 2τ + 4β 1 .

Since k is arbitrary we complete the proof.

The previous lemma implies that it's very likely that the local minimum x can be written as x =

x i e i and the index i is also likely to be the argmin of α. The following technical lemma shows that when this indeed happens, then we can strengthen Lemma B.2 in terms of the error bound's dependency on ε and τ . In Lemma B.2, we have that |x| 2nd is bounded by a function of τ . Here we strengthen the bound to be a function that only depends on ε. Thus as long as τ be small enough so that we can apply Lemma B.2 and Lemma B.4 to meet the condition of the lemma below, then we get an error bound that goes to zero as ε goes to zero. This translates to the error bound in bullet 3 of Theorem B.1 where the bound on E only depends on ε. For casual readers we suggest to skip this Lemma since its precise functionality will only be clearer in the proof of Theorem B.1.

Lemma B.5. In the setting of Lemma B.2, in addition we assume that i = argmin k |α k | and that x can be written as x = x i e i + x -i satisfying

x -i ∞ ≤ 0.1 min{1/ √ d, β min /(β max )} .

Then, we can strengthen the bound to

x -i ∞ ≤ 3ε β min .

Proof. WLOG, let i = 1. Let x j be the second largest entry of x in absolute value. Define v 1 = 4β 1 x 2 1 -2α 1 -γ, and similarly v j = 4β j x 2 j -2α j -γ. Since ∇h(x) ≤ ε, by equation (B.6), we have that As alluded before, in the proof we will first apply the results in Section B.1 to show that when B is a local minimum, each row b s has a unique large entry. Then we will show that the largest entries of each row sit on different columns. The key intuition behind the proof is that if two rows, say row s, t, have their large entries on the same column, then it means that there exists a column-say column k -that doesn't contain largest entry of any row. Then either row s or t will violate Lemma B.4. Or in other words, either row s or t can move their mass into the column k to decrease the function value. This contradicts the assumption that B is a local minimum. 

EQUATION

G α,β,µ (B) = d i=1 ᾱi x 2 i - i βi x 4 i + λ x 2 -1 2 (B.11)

We view the function above as h(x). Now we apply Lemma B.2 (by replacing α, β in Lemma B.2 by ᾱ, β). The assumption that λ min (∇ 2 g α,β,µ (B)) for the ease of notation. We can check that δ ≤ 1 4 √ καd by the assumption. Therefore, we have essentially shown that each row of B has only one single large entry, since the second largest entry is at most δ.

≥ -τ implies that λ min (∇ 2 h(x)) ≥ -τ since ∇ 2 h(x) is a submatrix of ∇ 2 g(B). Moreover, ∇h(x) ≤ ∇G(B) ≤ ε ≤ τ 3 /(

Next we show that each row of B has largest entries on distinct columns. For each row j ∈ [d], let i j = arg max i |e i b j | be the index of the largest entry of b j . We will show that i 1 , . . . , i d are distinct.

For the sake of contradiction, suppose they are not distinct, that is, there are two distinct rows s, t that have the same largest entries on column l, that is, we assume that i s = i t = l. This implies that {i 1 , . . . , i d } = [d] and let k ∈ [d] be the index such that k / ∈ {i 1 , . . . , i d }. We note that by the

assumption δ = τ µβmin 1/2 ≤ 1 4 √ καd ≤ 1 4 √ d . We first bound from above ᾱk ᾱk = α k j =s (b j e k ) 2 ≤ α k dδ 2 ≤ 1 16 α min . (by δ ≤ 1

Assume in addition without loss of generality that |b s e l | ≤ |b t e l |. Let

z l j =s (b j e l ) 2 (B.13)

be the sum of squares of the entries on the column l without entry b j e l , and that ᾱl = α l z l . We first prove that z l ≥ 1/3.

For the sake of contradiction, assume z l < 1/3. Then we have that ᾱl = α l z ≤ 1 3 α l . This implies that λ ≥ 4 max{ᾱ l , τ }, and since l is the index of the largest column of b s we can invoke Lemma B.3 and conclude that b s 2 ≥ 1/2. This further implies that

(b s e l ) 2 ≥ b s 2 -d |b s | 2nd ≥ 1/2 -dδ 2 ≥ 1/3 (by δ ≤ 1/(4 √ d))

Since we have assumed that |b s e l | ≤ |b t e l |. Then we obtain that

z l ≥ |b t e l | 2 ≥ |b s e l | 2 ≥ 1/3 ,

which contradicts the assumption. Therefore, we conclude that z l ≥ 1/3. Then we are ready to bound ᾱl from below:

ᾱl = α l z l ≥ 1 3 α l .

The display above and Equation (B.13) implies that

ᾱl -ᾱk ≥ 1 4 α min . (B.14)

Note that l is the largest entry in absolute value in the vector b s . We will apply Lemma B. Finally, let Q be the matrix that only contain the largest entries (in absolute value) of each columns of B. Since i 1 , . . . , i d are distinct, we have that Q contains exactly one entry per row and per column. Therefore Q can be written as DP where P is a permutation matrix and D is a diagonal matrix. Moreover, we have that b s 2

∞ ≥ b s 2 -d |b s | 2 2nd ≥ 1/4 and b s 2 ≤ 2.

Therefore, the largest entry of each row has absolute value between 1/4 and 2. Therefore

|D| ii ∈ [1/4, 2]. Let E = B -P D. Then we have that |E| ∞ ≤ max s |b s | 2nd ≤ δ,which completes the proof.

Applying Lemma B.5, we can further strengthen Proposition B.6 with better error bounds and better control of the largest entries of each column. Proposition B.7 (Strengthen of Proposition B.6). In the setting of Proposition B.6. Suppose in addition that τ satisfies τ ≤ cµβ 2 min /β max . Then, the matrix B can be written as

B = DP + E ,

where

P is a permutation matrix, D is diagonal such that ∀i ∈ [d], 1 1 -µβi λ 1 - 18dε 2 β 2 min - ε 2λ ≤ |D ii | 2 ≤ 1 1 -µβi λ 1 + ε 2λ and |E| ∞ ≤ 3ε β min .

Proof. By Proposition B.6, we know that

|E| ∞ ≤ δ = τ µβmin 1/2

. Now we use Lemma B.5 to strength the error bound.

As we have done in the proof of Proposition B.6, we again fix an arbitrary s ∈ [d] and all the rows except b s and view G α,β,µ as a function of b s . For all i ∈ [d], let ᾱi = α i j =s (b j e i ) 2 , and βi = µβ i and view G α,β,µ as a function of the form h(x) with α, β replaced by ᾱ, β, namely,

h(x) = k ᾱk x 2 k - k βk x 4 k + λ x 2 -1 2 + const

We will verify the condition of Lemma B.5. Let i be the index of the largest entry in absolute value of the vector b s . Since we have shown that the largest entry in each row sits on different columns, and the second largest entry is always less than δ, we have that,

ᾱi = α i j =s (b j e i ) 2 ≤ α i dδ 2 ≤ 1 16 α min . (by δ ≤ 1 4 √ καd )

For any k = i, we know that the column k contains some entry (k, j k ) which is the largest entry of some row, and we also have that j k = s since the largest entry of row s is on column i. Therefore, we have that

ᾱk = α k j =s (b j e k ) 2 ≥ α l (b j k e k ) 2 ≥ α l ( b k 2 -dδ 2 ) ≥ 1 3 α l (by δ ≤ 1/(4 √ d))

Therefore, ᾱk ≥ ᾱi for any k = i and thus

i = argmin k |ᾱ k |. By the fact that |E| ∞ ≤ δ, we have that x -i ∞ ≤ δ ≤ 0.1 min{1/ √ d, β min /(β max )

}. Now we are ready to apply Lemma B.5 and obtain that |b s | 2nd ≤ 3ε βmin . Applying the argument for every row s gives |E| ∞ ≤ 3ε βmin . Finally, we give the bound for the entires in D. Let v be a short hand for ∇h(b s ) which is equal to the s-th column of ∇G(B). Since B is an ε-approximate stationary point, then we have that v ≤ ε and by straightforward calculation of the gradient, we have

v i = 2ᾱ i x i -4µβ i x 3 i + 4λ( d j=1

x 2 j -1)x i .

Since x i = 0, dividing by x i gives,

0 = 2ᾱ i -4µβ i x 2 i + 4λ( d j=1 x 2 j -1) - v i x i = (4λ -4µβ i )x 2 i + 4λ j =i x 2 j + 2 ᾱi -4λ - v i x i

Rearranging the equation above gives,

x 2 i = 1 4λ -4µβ i   4λ -2ᾱ i -4λ j =i x 2 j - v i x i   = 1 1 -µβi λ   1 - ᾱi 2λ - j =i x 2 j - v i 4λx i   To upper bound x 2

i , we note that |v i | < ε, ᾱi > 0, and j =i x 2 j > 0, so

x 2 i ≤ 1 1 -µβi λ 1 + ε 2λ ≤ 1 + 2µβ i + ε λ (since λ ≥ 4µβ i )

For the lower bound of x 2 i , we note that |E| ∞ ≤ δ = 3ε βmin implies j =i x 2 j ≤ dδ 2 . Moreover, we have proved that each rows has largest entry at different columns. Also note that the largest entry of row b s is on column i. Therefore, we have ᾱi = α i j =s (b T j e i ) 2 ≤ α max dδ 2 . Using these two estimates and δ = 3ε βmin , we have

EQUATION

Finally we are ready to prove Theorem B.1 by applying Proposition B.6.

Proof of Theorem B.1. By setting ε = 0, τ = 0 in Proposition B.6, we have that any local minimum B satisfies that B = DP where P is a permutation matrix and D is a diagonal and the precise diagonal entries of D. It can be verified that all these points have the same function value, so that they are all global minimizers.

Towards proving the second bullet, we note that a saddle point B satisfies that ∇G(B) = 0. We will prove that λ min (∇ 2 G(B)) ≤ -τ 0 . For the sake of contradiction, suppose λ min (∇ 2 G(B)) ≥ -τ 0 .

Then setting ε = 0 and τ = τ 0 in Propostion B.7, we have that B = DP and D ii = ± 1 1-µβi/λ , which by bullet 1 implies that B is a local minimum. This contradicts the assumption that B is a saddle point.

The 3rd bullet is a just a rephrasing of Proposition B.7.

C HANDLING NON-ORTHOGONAL WEIGHTS:

In this section, we first show that when the weight vectors {b i } s are not orthonormal, the local optimum of a slight variant of G(B) still allow us to recover B . The main observation is that the set of local minima are preserved (in a certain sense) by linear transformation of the variables. We design an objective function F (B) that is equivalent to G(B) up to a linear transformation. This allows us to use Theorem 2.3 as a black box to characterize all the local minima of F .

We use λ max (•), λ min (•) to denote the largest and smallest eigenvalues of a square matrix. Similarly, σ max (•) and σ min (•) are used to denote the largest and smallest singular values.

C.1 LOCAL MINIMUM AFTER A LINEAR TRANSFORMATION:

Given a function f (y), we say function g(•) is a linear transformation of f (•) if there is a matrix W such that g(x) = f (W x). If W has full rank, the local minima of f are closely related to the local minima of g.

We recall some standard notation in calculus first. We use ∇f (t) to denote the gradient of f evaluated at t. For example, ∇f (W x) is a shorthand for ∂f (y) ∂y | y=W x , and similarly

∇ 2 f (W x) is ∂ 2 f (y) (∂y) 2 | y=W x .

The following theorem then connects the gradients and Hessians of f (W x) and g(x). Essentially, it shows that the set of local minima and saddle points have a 1-1 mapping between f and g, and the corresponding norms/eigenvalues only differ multiplicatively by quantities related to the spectrum of W . Theorem C.1. Let W ∈ R d×m (d ≥ m) be a full rank matrix. Suppose g : R m → R and f : R d → R are twice-differentiable functions such that g(x) = f (W x) for any x ∈ R m . Then, for all x ∈ R m , the following three properties hold:

1. σ min (W ) ∇f (W x) ≤ ∇g(x) ≤ σ max (W ) ∇f (W x) . 2. If λ min (∇ 2 g(x)) < 0, then σ max (W ) 2 λ min (∇ 2 f (W x)) ≤ λ min (∇ 2 g(x)) ≤ σ min (W ) 2 λ min (∇ 2 f (W x)).

3. The point x satisfies the first and second order optimality condition for g iff y = W x also satisfy the first and second order optimality condition for f .

Proof. The proof follows from the relationship between the gradients of g and the gradients of f . By basic calculus, we have

∇g(x) = ∂f (W x) ∂x = W ∂f (y) ∂y y=W x = W ∇f (W x)

which immediately implies bullet 1. Similarly, we can compute the second order derivative:

∇ 2 g(x) = W [∇ 2 f (W x)]W.

To simplify notation, let A = ∇ 2 f (W x). Let x = arg min x =1 x W AW x, and y = (W x)/ W x . Therefore

λ min (A) ≤ y Ay ≤ λ min (W AW )/ W x 2 ≤ λ min (W AW )/ W 2 .

On the other hand, let y be the unit vector that minimizes y Ay, we know y is in column span of W because f is only defined on the row span, so there must exist a unit vector x such that W x = λy where λ ≥ σ min (W ). For this x we have λ min (W AW ) ≤ x W AW x = λ 2 λ min (A) ≤ σ 2 min (W )λ min (A). This finishes the proof for 2. Finally, notice that W is full rank, so ∇g

(x) = W ∇f (W x) = 0 iff ∇f (W x) = 0. Also, ∇ 2 g(x) = W [∇ 2 f (W x)]W 0 iff ∇ 2 f (W x) 0.

C.2 OBJECTIVE FOR NON-ORTHOGONAL WEIGHTS:

Now we will design a new objective function that can be linearly transformed to the orthonormal case. The main idea is to view the rows of B as the new basis that we work on (which is not necessarily orthogonal). Note that this is already the case for the first two terms of the objective function G(B), we change the objective function as follows: More concretely, we define

F α,µ,λ (B) = 2 √ 6σ • i∈[d] α i j,k∈[d] b i , b j 2 b i , b k 2 - σ4 µ √ 6 i,j∈[d] α i b i , b j 4 + λ m j=1 (( m i=1 α i b j , b i 2 -1) 2 -1) 2 .

Note that the only change in the objective is the regularizer for the norm of b j . It is now replaced by ((

m i=1 α i b j , b i 2 -1) 2 -1) 2

, which tries to ensure the "norm" of b j in the basis defined by row of B to be 1. The objective function that we will optimize corresponds to choosing α i = a i . Similar as before, this function can be computed as expectations

F a ,µ,λ (B) = E   y • j,k∈[d],j =k φ(b j , b k , x)   -µ E   y • j∈[d] ϕ(b j , x)   + λE (x,y),(x ,y ) [ m i=1 y • φ 2 (b i , x) • y • φ 2 (b i , x )], (C.1)

where (x , y ) is an independent sample, and

φ 2 (v, x) = (v x) 2 -v 2 .

Intuitively, if we can find a linear transformation that makes {b i }'s orthonormal, that will reduce the problem to the orthonormal case. This is in fact the whitening matrix:

Let M = m i=1 a i b i (b i ) be the weighted covariance matrix of b i 's. Suppose the SVD of M is U DU and let W = U D -1/2 . We apply the transformation W to the vectors a i b i 's and obtain that o i = W a i b i . We can verify that o i 's are orthogonal vectors because

i∈[m] o i o i = W M W = Id (C.2)

For notational convenience, let's extend the definition of the G(B) in equation by using the putting the relevant information in the subscript

G α,β,λ,o (B) = √ 6σ • i∈[d] a i j,k∈[d],j =k o i , bj 2 o i , bk 2 - σ4 µ √ 6 i,j∈[d] a i o i , bj 4 . + λ m i=1 ( bi 2 -1) 2

(That is, the index o denotes the ground-truth solution with respect to which G is defined.)

The next Theorem shows that we can rotate the objective function F properly so that it matches the objective G with a ground-truth vector o i 's.

Theorem C.2. Let W be defined as above, and let 1/a be the vector whose i-th entry is 1/a i . Then, we have that G 1/a ,µ,λ,oi (B) = F a ,µ,λ (BW )).

Note this can be interpreted as a linear transformation as in vector format BW is equal to B • (W ⊗ Id d×d ).

Proof. The equality can be obtained by straightforward calculation. We note that since B = Therefore, we have that

F a ,µ,λ (B • (W ⊗ Id d×d )) (C.3) = 2 √ 6σ • i∈[d] a i j =k∈[d] b i , W bj 2 b i , W bk 2 - σ4 µ √ 6 i,j∈[d] a i b i , W bj 4 + λ m j=1 ( m i=1 a i W bj , b i 2 -1) 2 . = 2 √ 6σ • i∈[d] 1 a i j,k∈[d] a i W b i , bj 2 a i W b i , bk 2 - σ4 µ √ 6 i,j∈[d] 1 a i a i W b i , bj 4 + λ m j=1 ( m i=1 bj , a i W b i 2 -1) 2 . = 2 √ 6σ • i∈[d] 1 a i j,k∈[d] o i , bj 2 o i , bk 2 - σ4 µ √ 6 i,j∈[d] 1 a i o i , bj 4 + λ m j=1 ( m i=1 bj , o i 2 -1) 2 .

(by the definition of o i 's)

From Theorem 2.3 we can immediately get the following Corollary (note that the only difference is that the coefficients now are 1/a i instead of a i ). Recall a max = max i a i and a min = min i a min , we have

= P -D -ΓB .

Note that P is still a permutation matrix, and D -is still a matrix whose diagonal entries are {±1 ± O(µ/λa min )}, so this is exactly the form we stated in 1. More concretely, the rows of B - are permutations of a i b i .

For bullet 2, it follows immediately from Property 2 in Theorem C.1. Note that by property 2,

λ min (∇ 2 F (BW )) ≤ λ min (∇ 2 G(B)) W 2 = λ min (∇ 2 G(B))σ min (M ).

Finally we will prove 3. Let B = BW -, so that G(B) = F (B). We will prove properties of B using the properties of B from Corollary C.3.

First we observe that by Theorem C.1,

λ min (∇ 2 G(B)) ≥ W 2 λ min (∇ 2 F (B)) ≥ -c min{µ/(κ a da max , λ}.

Therefore the second order condition for Claim 3 in Corollary C.3 is satisfied. Now when ∇F (B) ≤ ε, we have ∇G(B) ≤ ε W = ε/σ min (M ) 1/2 . By Corollary C.3, we know B can be expressed as P DO + E where D is the diagonal matrix, P is a permutation matrix and |E | ∞ ≤ O(εa max /(σ 4 σ min (M ) 1/2 )). We will apply perturbation Theorem C.9 for matrix inversion. Since σ min (P DO) ≥ 1/2, we know when E ≤ 1/4,

(P DO + E ) -1 -(P DO) -1 ≤ 8 √ 2 E .

Here E is bounded by

E F ≤ √ md|E | ∞ ≤ O(εa max √ md/(σ 4 σ min (M ) 1/2

)), which is smaller than 1/4 when ε is small enough.

The corresponding point in F is B = BW , and in 1 we have already proved (P DOW ) -is of the form we want, therefore we can define E = B --(P DOW ) -= (B -P DO) -W -1 , and

E = W -1 (P DO + E ) -1 -(P DO) -1 = O(εa max √ md • κ(M ) 1/2 /σ 4 ).

This finishes the proof.

C.3 HANDLE UNDERCOMPLETE CASE:

The objective function F can handle the case when the weights b i 's are not orthogonal, but still requires the number of components m to be equal to the number of dimensions d. In this section we show how to use similar ideas for the case when the number of components is smaller than the dimension (m < d).

Note that all the terms in F (B) only depends on the inner-products b j , b i . Let S be the span of {b i }'s and P S be the projection matrix to this subspace, it is easy to see that F (B) satisfies

F (B) = F (BP S ).

That is, the previous objective function only depends on the projection of B in the space S. Using similar argument as Theorem C.4, it is not hard to show the only local optimum in S satisfies the same conditions, and allow us to recover B . However, without modifying the objective, the local optimum of F (B) can have arbitrary components in the orthogonal subspace S ⊥ .

In order to prevent the components from S ⊥ , we add an additional 2 regularizer: define F α,µ,λ,δ as follows:

F α,µ,λ,δ (B) = F α,µ,λ (B) + δ 2 B 2 F (C.5)

Intuitively, since the first term F α,µ,λ (B) only cares about the projection BP S , minimizing B 2 F will remove the components in the orthogonal subspace of S. We will choose δ carefully to make sure that the additional term does not change the local optima of F α,µ,λ (B) by too much, while still ensuring a small projection on S ⊥ .

In this case we will consider pseudo-inverse instead of inverse. In particular, for a m × d matrix B, define its pseudo-inverse B † to be the matrix such that BB † = Id m×m and B † B is the projection to the row span of B.

EQUATION

M ). Theorem C.5. For any desired accuracy ε 0 , we can choose parameters ε, δ, τ 0 , µ, λ, such that for the objective function F a ,µ,λ,δ (B), for any B such that

∇F(B) ≤ ε, ∇ 2 F(B) ≥ -τ 0 /2, we have [B † ] = B DΓP + E

where Γ is a diagonal matrix with entries a i , D is a diagonal matrix with entries close to 1, P is a permutation matrix and E ≤ ε 0 .

To choose the parameters, let c be a sufficiently small universal constant (e.g. c = 0.01 suffices). Assume µ ≤ c/κ and λ

≥ 1/(c • a min ). Let τ 0 = c min{µ/(κda max ), λ}σ min (M ). Let δ ≤ min{ cσ4ε0 a max •m √ dκ 1/2 (M ) , τ 0 /2}, and ε = min{λσ min (M ) 1/2 , cδ/ M , cε 0 δσ min (M )}.

We first show that if the gradient is small, then the point cannot have a large component in

S ⊥ . Lemma C.6. If ∇F a ,µ,λ,δ (B) ≤ ε, then P S ⊥ B F ≤ ε/δ.

Proof. Since F a ,µ,λ (B) only depends BP S , we know ∇F a ,µ,λ (B)P S ⊥ = 0. Therefore ε ≥ ∇F a ,µ,λ,δ (B)P S ⊥ F = (δB)P S ⊥ F = δ P S ⊥ B F , and we have BP S ⊥ F ≤ ε/δ as desired.

Next we show that if the gradient of F a ,µ,λ,δ (B) is small, and δ is also small, then the gradient of F a ,µ,λ (B) can be bounded.

Lemma C.7. In the setting of Theorem C.5, if ∇F a ,µ,λ,δ (B) ≤ ε ≤ λσ min (M ) 1/2 , then we have ∇F a ,µ,λ (B) ≤ ε + δ 2m/σ min (M ).

Towards proving Lemma C.7, we first bound the norm of B by the following claim:

Claim C.8. If ∇F a ,µ,λ,δ (B) ≤ λσ min (M ) 1/2 , then each row b i must satisfy b i M b i ≤ 2.

Proof. We prove by contradiction. Assume towards contradiction that there is a column b i such that b i M b i ≥ 2. We consider the quantity,

∂F a ,µ,λ,δ ∂b i (B), b i . Note that F a ,µ,λ,δ has 4 terms: (1) 2 √ 6σ • i∈[d] α i j,k∈[d] b i , b j 2 b i , b k 2 , (2) -σ4µ √ 6 i,j∈[d] α i b i , b j 4 , (3) λ m j=1 (( m i=1 α i b j , b i 2 -1) 2 -1) 2 , (4) δ 2 B 2

F . Among these 4 terms, the first, third and forth terms all contribute positively to this innerproduct (because when b i is moved to (1 -ε)b i all those terms clearly decrease). Term 2

-σ4µ √ 6 i,j∈[m] a i b i , b j

4 contribute negatively. Therefore we can ignore terms 1 and 4:

∂F a ,µ,λ,δ ∂b i (B), b i ≥ ∂ ∂b i [- σ4 µ √ 6 i∈[m] a i b i , b j 4 + λ( i∈[m] a i b i , b j 2 -1) 2 ], b i . Let b i M b i = C ≥ 2, we know i∈[m] a i b i , b j 4 ≤ 1 a min i∈[m] (a i ) 2 b i , b j 4 ≤ C 2 /a min .

Therefore,

∂ ∂b i [- σ4 µ √ 6 i∈[m] a i b i , b j 4 ], b i = - 4σ 4 µ √ 6 i∈[m] a i b i , b j 4 ≥ - 4σ 4 µ √ 6 • C 2 a min

On the other hand,

∂ ∂b i [λ( i∈[m] a i b i , b j 2 -1) 2 , b i = 4λ(b i M b i -1)(b i M b i ) = 4λC(C -1).

By the choice of λ, µ, we can see that the negative term is negligible, and we know We will first show that B S is close to the desirable solution. To do that we will use Theorem C.414 . By the choice of ε, δ, we know from Lemma C.7 that ∇F a ,µ,λ (B S ) ≤ 2δ 2m/σ min (M ). Also, ∇ 2 F a ,µ,λ (B S ) ≥ ∇ 2 F a ,µ,λ (B) -δ ≥ -τ 0 . Therefore we know B S must be of the form By Lemma C.6 we know B ⊥ F ≤ ε/δ. We apply inverse matrix perturbation (Theorem C.9) again, using B = B S + B ⊥ , therefore we know

∂F a ,µ,λ,δ ∂b i (B), b i ≥ 2λC(C -1) Since b i M b i = C,

B † = B † S + E 2 , where E 2 ≤ O( B ⊥ F /σ 2 min (B S )) ≤ ε 0 /2. Combining these two perturbations we know [B † ] = P DΓB + E 1 + E 2 ,

and the error term E 1 + E 2 has spectral norm at most ε 0 .

C.4 TOOLBOX: MATRIX PERTURBATION:

In the proof we used the following theorem for the perturbation of matrices. Theorem C.9 (Stewart and Sun Stewart & guang Sun (1990) ). Consider the perturbation of a matrix A: if B = A + E,then we have

B † -A † ≤ √ 2 A † B † E .

As a corollary, if E ≤ σ min (A)/2, then we have

B † -A † ≤ 2 √ 2σ min (A) -2 E .

D RECOVERING THE LINEAR LAYER:

We will show in this section that if we have are given a δ-approximation of B , then it is easy to recover a . The key observation here is that the correlation between the b i , x and the output y is exactly proportional to a i . We also note that there could be multiple other ways to recover a , e.g., using linear regression with the σ(Bx) as input and the y as output. We chose this algorithm mostly because of the ease of analysis. Lemma (Restatement of Lemma 2.5). Given a matrix B whose rows are δ-close to B in Euclidean distance up to permutation and sign flip with δ ≤ 1/(2κ ). Then, we can give estimates a, B (using e.g., Algorithm 1) such that there exists a permutation P where a -P a ∞ ≤ δa max and B is row-wise δ-close to P B .

To see why this simple algorithm works for recovering a , we need the following simple claim. Claim D.1. For any vector v we have

E[y x, v ] = 1 2 m i=1 a i b i , v .

The proof of this claim follows immediately from the property of Hermite polynomials. Now we are ready to prove the corollary.

Proof. Without loss of generality we assume B is close to a sign flip of B . The unknown permutation does not change the proof.

Since b i is δ close to B i , let u be the vector where u j = b j , b i -b i , we have

a i = m i=1 a i b i , b i = m i=1 a i ( b i , b i + b i , b i -b i ) = a i + a i , u ∈ a i ± a max δ.

Therefore a i is always positive, a i is in the desirable range and B i -B i ≤ δ.

Similarly, if -b i is δ close to B i , we have a i ∈ -a i ± a max δ, and the conclusion still holds.

For the settings considered in Section C, the vectors b i are not necessarily orthogonal. In this case we use the following algorithm: 1 F ) . The expectation between x 2 ∈ [2 i R, 2 i+1 R], for i = 0, 1, 2, ..., is always bounded by 4Γd 1.5 a max 2 i+1 R 5 exp(-2 i R) < ε/2 i+1 . Therefore

∇G(B) -∇G trunc (B) ≤ ∞ i=0 ε/2 i+1 ≤ ε.

The bound for the Hessian follows from the same argument.

Finally, we combine this truncation with a result of Mei et al. (2016) that proves universal convergence of gradient and Hessian. For completeness here we state a version of their theorem with bounded gradient/Hessian: Theorem E.3 (Theorem 1 in Mei et al. (2016) ). Let f (θ) be a function from R p → R and f be its empirical version. If the norm of the gradient and Hessian of a function is always bounded by τ , for variables in a ball of radius r in p dimensions, there exists a universal constant C 0 such that for C = C 0 max{log rτ /δ, 1}, the following hold: Finally we handle the case when B has a row with large norm. We will show that in this case ∇ G(B) must also be large, so B cannot be an approximate local minimum. Lemma E.5. If b i is the row with largest norm and b i ≥ 2, then when N ≥ poly(d, a max /a min ) for some fixed polynomial, we have with high probability ∇ G(B), b i ≥ cλ b i 4 for some universal constant c > 0.

Proof. The proof of this Lemma is very similar to Claim C.8.

Note that by equation (2.7) there are three terms in G(B):( 1 Taking the inner-product with b i , and use the fact that b i form an orthonormal basis, we know

∂ ∂b i [A2(B)], b i ≥ -ca min b i 4 .

On the other hand, when b i ≥ 2, we have for the third term

∂ ∂b i [λ( b i 2 -1) 2 ], b i ≥ λ( b i -1) 4 ≥ λ b i 4 /16.

Since λ is larger than a max , we know the negative contribution from 

F SPURIOUS LOCAL MINIMUM FOR FUNCTION P:

In this section we give an example where the function P does have spurious local minimum.

In this example, d = 4, and the true vectors are the standard basis vectors b i = e i . We will set a 1 = 1, and a 2 = a 3 = a 4 = 2 + δ (where δ > 0 is an arbitrary positive constant). 

:

All global minima of G correspond to the ground truth parameters.

The value and gradient of G can be estimated using samples.With these properties, stochastic gradient descent on G provably converges to the global minimum and learn the ground-truth parameters. We also prove finite sample complexity results and validate the results by simulations.

Permuting the rows of B and the coordinates of a correspondingly preserves the functionality of the network.

This is because if x ∼ N (0, Σ), then we can whiten the data by taking x = Σ -1/2 x and define B = BΣ 1/2 . We note that B x = Bx and therefore we maintain the functionality of the model.

The work of Janzamin et al. (2015); Zhong et al. (2017) are closely related, but they require tensor decomposition as the algorithm/initialization.

When σ = ReLU , we have that σ0 = 1 √ 2π , σ1 = 1 2 . For n ≥ 2 and even, σn = ((n-3)!!) 2 √ 2πn! . For n ≥ 2 and odd, σn = 0.

More precisely, |Dii| = 1 1-µ|σ 4 |a i /( √

6λ)6 In the most general setting, converging to a local minimum of a non-convex function is NP-hard.

Note that B is orthogonal, and j = k

We note that since there are constraints here, we consider the local minimum on the manifold defined by the constraints.

This is the main reason why we require a ≥ 0.

However, note that R(B) by itself doesn't work because it does not prevent the solutions where all the bi's are equal to the same b j .

We also observed that using γ(z) = 1 2 |z| also works but due to the space limitation we don't report the experimental results here.

See equation (2.4) for the definition of f k and Theorem 2.2 for how to access αf2 + βf4 in the setting of one-hidden-layer neural nets.

We denote by L 2 (R, e -x 2 /2 ) the weighted L2 space, namely, L 2 (R, e -x 2 /2 ) f :∞ -∞ f (x) 2 e -x 2 /2 dx < ∞

√ καd )

If we restrict all the vectors to the subspace S, we can still apply Theorem C.4 as long as we replace all inverses with pseudo-inverses.

Figures and Tables:

Figure 1: Data are generated by a network with ReLU activation without noise. The training model uses the same architecture. Left: the estimated population risk doesn't converge to zero. Right: the parameter error using the surrogate in equation (4.1).

Figure 2: Data are generated by a network with sigmoid activation without noise. The training model uses the same architecture. Left: the estimated population risk doesn't converge to zero. Right: the parameter error using the surrogate in equation (4.1).

Figure 4: Learning with objective function G(•). Left: the test loss. Right: the error in parameter space measured by equation (4.1)

Let κ α = α max /α min and c be a sufficiently small universal constant (e.g. c = 10 -2 suffices). Suppose µ ≤ cα min /β max and λ ≥ 4 max(µβ max , α max ). Then, the function G α,β,µ (B) defined as in equation (B.2) satisfies that 1. A matrix B is a local minimum of G α,β,µ if and only if B can be written as B = DP where P is a permutation matrix and D is a diagonal matrix with D ii ∈ ± 1 1-µβi/λ . 2. Any saddle point B has strictly negative curvature in the sense that λ min (∇ 2 G α,β,µ (B)) ≤ -τ 0 where τ 0 = c min{µβ min /(κ α d), µβ 2 min /β max , λ} 3. Suppose B is an approximate local minimum in the sense that B satisfies ∇g(B) ≤ ε and λ min (∇ 2 g(B)) ≥ -τ 0

close to a global minimum in Euclidean distance, where O d (•) hides polynomial dependency on d and other parameters. Here we recall that |E| ∞ denotes the largest entries in the matrix E. Theorem 2.3 follows straightforwardly from Theorem B.1 by setting α = 2 √ 6|σ 4 |a and β = |σ 4 |a / √ 6. In the rest of the section we prove Theorem B.1.Note that our variable B is a matrix of dimension d × d and we use b i to denote the rows of B, that is, Naturally, towards analyzing the properties of a local minimum B, the first step is that we pick a row b s of B and treat only b s as variables and others rows as fixed. We will show that local optimality of b s will imply that b s is equal to one of the basis vector e j up to some scaling factor. This step is done in Section B.1. Then in Section B.2 we show that the local optimality of all the variables in B implies that each of the rows of B corresponds to different basis vector, which implies that B is a permutation matrix (up to scaling of the rows). B.1 STEP 1: ANALYSIS OF LOCAL OPTIMALITY OF A SINGLE ROW Suppose we fix b 1 , • • • , b s-1 , b s+1 , • • • , b d , and optimize only over b s , we obtain the objective h of the following form:

Let S = {i : |x i | ≥ δ} be the indices of the coordinates that are significantly away from zero, where δ =

B.10) and re-arranging gives |x j | ≤ 3 ε βmin . B.2 LOCAL OPTIMALITY OF ALL THE VARIABLES In this section we prove Theorem B.1. Results in Subsection B.1 have established that if B is a local minimum, then each row b s of B has to be a scaling of a basis vector. In this section we show that these basis vectors need to be distinct from each other. The following proposition summaries such a claim (with a weak error analysis). Proposition B.6. In the setting of Theorem B.1, suppose B satisfies ∇g(B) ≤ ε and λ min (∇ 2 g(B)) ≥ -τ for parameters τ, ε satisfying 0 ≤ τ ≤ c min{µβ min /(κ α d), λ} and ε ≤ c min{α min , τ 3 /β min }. Then, the matrix B can be written as B = DP + E , where D is diagonal such that ∀i, |D ii | ∈ [1/4, 2], and P is a permutation matrix, and |E| ∞ ≤ δ

As pointed in the paragraph below equation (B.3), when we restrict our attention to a particular row of B and fix the rest of the rows the function G α,β,µ reduces to the function h(•) in equation (B.3) so that we can apply lemmas in Section B.1. Concretely, fix an index s ∈ [d] and let x = b s . For all i ∈ [d], let ᾱi = α i j =s (b j e i ) 2 , and βi = µβ i . Then we have that

4. We fix every row of B except b s and consider the objective as a function of b s only. Again let ᾱi = α i j =s (b j e i ) 2 , and βi = µβ i and we have the equation (B.11). (Note that now ᾱ depends on the choice of s which we fixed.) Lemma B.4 gives us that ᾱl ≤ ᾱk + 2ε + 2τ + 4 β . Since ε ≤ 1 50 α min , τ ≤ 1 50 α min and βl = µβ l ≤ 1 50 α min , we obtain that ᾱl (B.14). Thus we have established that i 1 , . . . , i d are distinct.

B • (W ⊗ Id d×d ) are W b1 , . . . , W bm .

we have b i ≤ C/σ min (M ). Therefore the norm of the gradient is at least 2λC(C -1)/ b i | ≥ 2 √ 2λσ min (M ), this contradicts with the assumption. The norm of the rows must all be bounded. Proof of Lemma C.7. We have that b i M b i ≤ 2 implies b i 2 ≤ 2/σ min (M ). The norm of the whole matrix is bounded by B F ≤ m i=1 b i 2 ≤ 2m/σ min (M ), so by triangle inequality we have ∇F a ,µ,λ (B) ≤ ∇F a ,µ,λ,δ (B) + δ B F ≤ ε + δ 2m/σ min (M ).

we are ready to prove Theorem C.5.Proof of Theorem C.5. We will separate B into two components B S = BP S and B ⊥ = BP S ⊥ .

P DΓB + E 1 , where E 1 < ε 0 /2. Also at the same time from the proof of Theorem C.4 we know B S = (P DO+ E )W where P DO + E has singular values close to 1. Therefore σ min (B S ) ≥ σ min (W )/2 = 1/2 M .

Recovering a Input: A matrix B with unit row norms that is row-wise δ-close to B in Euclidean distance. Return: Let a i = 2 E[y x, b i ] where E means the empirical average. Set a i ← |a i | and b i ← b i sgn(a i )

Recovering a for general case Input: A matrix B with unit row norms, and B is δ-close to B in spectral norm up to permutation and sign flip. Let u i = 2 E[y x, b i ] where E means the empirical average. Let a = (BB ) -1 u. Return: Set a i ← |a i | and b i ← b i sgn(a i ) Lemma D.2. Given a matrix B whose rows have unit norm, and B -SP B ≤ δ for some permutation matrix P and diagonal matrix S with ±1 entries on diagonals.If σ 2 min (B) 4 √ 2κ √ m , we can give estimates a, B (using e.g., Algorithm 2) such that a-P a ≤ 2 √ 2a max √ m σ -2 min (B) •δ and B -P B ≤ δ.

(a) The sample gradient converges to the population gradient. Namely if N ≥ Cp log p we havePr[ sup θ ≤r ∇f (θ) -∇ fθ ≤ τ Cp log n n ] ≥ 1 -δ.(b) The sample Hessian converges to the empirical Hessian. Namely if N ≥ Cp log p we havePr[ sup θ ≤r ∇f (θ) -∇ fθ ≤ τ Cp log n n ] ≥ 1 -δ.As an immediate corollary of this theorem and Lemma E.2, we have Corollary E.4. In the setting of Theorem 2.7, for every B whose rows have norm at most 2, we have with high probability,∇G(B) -∇ G(B) ≤ ε/2, and ∇ 2 G(B) -∇ 2 G(B) ≤ τ 0 /2.Proof. On the other hand, for all such matrices B, by Lemma E.2 we know the gradient and Hessian of G is close to the gradient and Hessian of G trunc .∇G(B) -∇Gtrunc (B) ≤ ε/4, and ∇ 2 G(B) -∇ 2 G trunc (B) ≤ τ 0 /4. Now, the gradient and Hessian for individual samples for estimating G trunc are bounded by some poly(d, 1/ε), therefore by Theorem E.3 we know the gradient and Hessian of G are close to those of G trunc . When N ≥ poly(d, 1/ε) for a large enough polynomial, we have with high probability, for all B with all rows b i ≤ 2, ∇G trunc (B) -∇ G(B) ≤ ε/4, and ∇ 2 G trunc (B) -∇ 2 G(B) ≤ τ 0 /4. The corollary then follows from triangle inequality.

) sign(σ 4 ) Ê y • j,k∈[d],j =k φ(b j , b k , x) , (2)-µ sign(σ 4 ) Ê y • j∈[d] ϕ(b j , x) , (3) λ m i=1 ( b i 2 -1) 2 .Here Ê is the empirical average over the samples.Note that the first two terms are homogeneous degree 4 polynomials over B, and the third term does not depend on the sample. By argument similar to Corollary E.4, we know for any B where b i has the largest row norm, with the number of samples we choose the gradient of the first two terms is ca min b i 3 close to the gradient of their expectations, where c < 0.01 is a small constant.By Theorem 2.6, we know the expectation of the first two terms are equal toA1(B) = 2 √ 6|σ 4 | • i∈[d] a i j,k∈[d],j =k b i , b j 2 b i , b k 2 and A2(B) = -|σ4|µ √ 6 i,j∈[d] a i b i , b j 4 .Here the gradient of the first term always have positive correlation with b i , so we can ignore it. For the second term, we know the gradient∂ ∂b i [A2(B)] = -|σ 4 |µ √ 6 j a j b j , b i 3 b j .

A2 and the difference between the empirical version and G are both negligible. Therefore we have ∇ G(B), b i ≥ cλ b i 4 as desired. Now we are ready to prove Theorem 2.7: Proof. By Lemma E.5, any point B with ∇ G(B) ≤ ε must have b i ≤ 2 for all i. Now by Corollary E.4, we know the point B we have must satisfy ∇G(B) ≤ ε; ∇ 2 G(B) -τ 0 Id. By point 3 in Theorem 2.3, this implies the guarantee on B.

The spurious local minimum that we consider is b1 = b 2 = e 1 = b 1 , b 3 = e 2 =b 2 , b 4 = The objective P (B) = 1 and the only non-zero term is a 1 b 1 , b 1 2 b 1 , b 2 2 . In order to improve the objective locally, we need to change either b 1 or b 2 , otherwise the term a 1 b 1 , b 1 2 b 1 , b 2 2 is still 1, and all other terms (a i b i , b j 2 b i , b k 2 ) are non-negative.

Then B can be written as B = P DB + EB where P is a permutation matrix, D is a diagonal matrix satisfying the same bound as in bullet 1, and |E| ∞ ≤ O(ε/(σ 4 a min )).

Table content: <table><tr><td>and B is an</td></tr><tr><td>orthogonal matrix. The function G(•) defined as in equation (2.7) satisfies that</td></tr><tr><td>1. A matrix B is a local minimum of G if and only if B can be written as B = DP B where</td></tr><tr><td>P is a permutation matrix and D is a diagonal matrix with D ii ∈ {±1 ± O(µa max /λ)}. 5</td></tr><tr><td>Furthermore, this means that all local minima of G are also global.</td></tr><tr><td>2. Any saddle point B has a strictly negative curvature in the sense that λ min (∇ 2 G(B)) ≥</td></tr><tr><td>-τ 0 where τ 0 = c min{µa min /(κ d), λ}</td></tr><tr><td>3. Suppose B is an approximate local minimum in the sense that B satisfies</td></tr><tr><td>∇G(B) ≤ ε and λ min (∇ 2 G(B)) ≥ -τ 0</td></tr><tr><td>As a direct consequence, B is O d (ε)-close to a global minimum in Euclidean distance,</td></tr><tr><td>where O d (•) hides polynomial dependency on d and other parameters.</td></tr></table>

Nathan Srebro and Tommi Jaakkola. Weighted low-rank approximations. In ICML, 2013. G.W. Stewart and Ji guang Sun. Matrix Perturbation Theory. Computer science and scientific computing. Academic Press, 1990. ISBN 9780126702309. URL https://books.google.com/books?id= l78PAQAAMAAJ.

Table content: <table><tr><td>Ju Sun, Qing Qu, and John Wright. When are nonconvex problems not scary? arXiv preprint arXiv:1510.06096,</td></tr><tr><td>2015.</td></tr><tr><td>Yuandong Tian. An analytical formula of population gradient for two-layered relu network and its applications</td></tr><tr><td>in convergence and critical point analysis. arXiv preprint arXiv:1703.00560, 2017.</td></tr><tr><td>Wikipedia. Hermite polynomials -wikipedia, the free encyclopedia, 2017a. URL https://en.</td></tr><tr><td>wikipedia.org/w/index.php?title=Hermite_polynomials&amp;oldid=796842411. [On-</td></tr><tr><td>line; accessed 1-September-2017 ].</td></tr><tr><td>Wikipedia. Formal power series -wikipedia, the free encyclopedia, 2017b. URL https://en.</td></tr><tr><td>wikipedia.org/w/index.php?title=Formal_power_series&amp;oldid=797671381. [On-</td></tr><tr><td>line; accessed 20-September-2017 ].</td></tr></table>

then we are done because |x| 2nd ≤ δ. Next we prove that |S| ≥ 2. For the sake of contradiction, we assume that |S| ≥ 2. Moreover, WLOG, we assume that |x| 1 ≥ |x| 2 are the two largest entries of |x| in absolute values.

Table content: <table/>

µβ min ) Hence by Lemma B.2, we have that the second largest entry of |b s | satisfies ∀s, |b s | 2nd ≤ δ.

Table content: <table><tr><td/><td/><td>(B.12)</td></tr><tr><td>where δ</td><td>µβmin τ</td><td>1/2</td></tr></table>

Peer review (iclr2018):
 This paper studies the problem of learning one-hidden layer neural networks and is a theory paper. A well-known problem is that without good initialization, it is not easy to learn the hidden parameters via gradient descent. This paper establishes an interesting connection between least squares population loss and Hermite polynomials. Following from this connection authors propose a new loss function. Interestingly, they are able to show that the loss function globally converges to the hidden weight matrix. Simulations confirm the findings. Overall, pretty interesting result and solid contribution. The paper also raises good questions for future works. For instance, is designing alternative loss function useful in practice? In summary, I recommend acceptance. The paper seems rushed to me so authors should polish up the paper and fix typos. Two questions: 1) Authors do not require a^* to recover B^*. Is that because B^* is assumed to have unit length rows? If so they should clarify this otherwise it confuses the reader a bit. 2) What can be said about rate of convergence in terms of network parameters? Currently a generic bound is employed which is not very insightful in my opinion.