the success of deep learning is due, to a large extent, to the remarkable effectiveness of gradient-based optimization methods applied to large neural networks. in this talk i will discuss some general mathematical principles allowing for efficient optimization in over-parameterized non-linear systems, a setting that includes deep neural networks. remarkably, it seems that optimization of such systems is "easy". in particular, optimization problems corresponding to these systems are not convex, even locally, but instead satisfy locally the polyak-lojasiewicz (pl) condition allowing for efficient optimization by gradient descent or sgd. we connect the pl condition of these systems to the condition number associated to the tangent kernel and develop a non-linear theory parallel to classical analyses of over-parameterized linear equations. \\ \\ in a related but conceptually separate development, i will discuss a new perspective on the remarkable recently discovered phenomenon of transition to linearity (constancy of ntk) in certain classes of large neural networks. i will show how this transition to linearity results from the scaling of the hessian with the size of the network. \\ \\ joint work with chaoyue liu and libin zhu.