Context. The population risk of a two-layer network is nonconvex in the weights. Mei et al. send the number of hidden units to infinity with the output normalization and follow the empirical distribution of the neurons. The risk is a convex quadratic functional of that distribution, and SGD moves it by a Wasserstein gradient flow, in which neurons are particles transported by a common potential. Mass cannot jump, so the flow can stall at stationary points that are not minima; a spread-out initial distribution or a little noise prevents that, and the number of hidden units drops out of the dynamics. Neurons move by order one, unlike the lazy regime. The companion paper of Chizat and Bach proves that noiseless limits are global minimizers under homogeneity and a support condition.
Setting. Data , network with , square loss, and one-pass SGD with step . With and the positive semidefinite kernel , the risk depends on the neurons only through their empirical measure and extends to every : where , the first variation of , is the potential each neuron feels. The limit transports mass down that potential, , formally the Wasserstein gradient flow of (a reading the paper notes without proving it). Noisy SGD (weight decay , Gaussian noise at inverse temperature ) gives the Wasserstein gradient flow of the free energy , with potential .
Statics and Theorem 3 (SGD tracks the PDE). If a minimizer of has , then , and is a global minimizer when . Under boundedness and Lipschitz conditions, with i.i.d. initialization from , for every with , with probability , So and suffice, samples reach PDE time , and the same holds for noisy SGD (, , sub-Gaussian ) with the diffusion PDE.
Convergence theorems. Along the noiseless PDE is nonincreasing, and is a fixed point iff , a larger set than the minimizers. Theorem 4: with noise, under regularity and bounded above and below, has a unique minimizer, the Gibbs fixed point ; the flow converges to it from any of finite free energy, and with . Theorem 5 combines this with Theorem 3: for there is , independent of , such that noisy SGD with has for with probability . Theorems 6 and 7 (noiseless stability): is a fixed point iff ; if , any supported in a small ball around converges to it exponentially. Conversely, if is a fixed point at which is nonsingular with a negative eigenvalue and sits strictly below the level (plus a compactness condition on level sets), no with bounded density converges to .
Theorem 1 and the companion result. For two centered Gaussian classes, given , a bounded monotone piecewise-linear meeting explicit conditions, and any radial initialization with bounded density and risk below 1, for all large enough , SGD with and has for all with probability : samples, independent of . Theorem 2 is the same with the variances differing only on an unknown subspace of dimension , so the network must find the subspace. Chizat and Bach minimize over nonnegative measures, convex and smooth, with the lift . If are 2-homogeneous (ReLU-type) and separates two spheres around the origin, or 1-homogeneous in (sigmoid-type) and it separates from , then a flow that converges has a global minimizer as its limit, as do particle flows as in either order (Sard-type conditions omitted).
The static problem is convex, and optimality is a condition on the potential. makes convex in , is at the empirical measure, and sampling neurons i.i.d. from loses only the diagonal of the double sum, . For optimality expand Moving mass from near a support point where is higher by to changes the risk by ; conversely the support condition makes the linear term nonnegative, and the quadratic term is nonnegative by positive semidefiniteness. The gap between stationarity ( on the support) and optimality ( minimal on the support) is the whole difficulty of the dynamics.
SGD stays close to i.i.d. copies of a McKean-Vlasov process (propagation of chaos). Couple each neuron to the nonlinear dynamics started at the same point, which exists and is unique by Sznitman's theorem and makes the i.i.d. with law solving the PDE. The gap comes from time discretization (order ), a martingale (order , by Azuma-Hoeffding) and the empirical measure in the drift, which costs the average coupling distance over the other neurons plus an i.i.d. fluctuation of order , since is bounded. Grönwall on the maximal deviation closes the argument and is where comes from.
The PDE descends the risk, and its stationary points carry no current. By the weak form of the PDE, so the risk is monotone and a fixed point is a measure supported on critical points of its own potential. If has a deeper valley where has no mass, transport cannot reach it, and is stationary without being optimal.
With noise the free energy is strictly convex, so the flow has a unique limit. Entropy makes strictly convex, with the Gibbs equation as first-order condition, and the diffusion PDE dissipates it, so the dissipation vanishes along a sequence, tightness gives a limit point with a density, and there is constant, which makes it the unique Gibbs measure. The temperature cost comes from smoothing: convolving a near-optimal with raises by while its entropy is at least , and at the terms cancel against the entropy upper bound, leaving . No rate in comes out; the relevant log-Sobolev constant can be exponentially small in , suggesting .
Without noise, a stable atom attracts, and a saddle cannot be reached from a bounded density. For stability, test against : for supported in a small ball the positive Hessian gives , so decays exponentially, and a second test function keeps the support inside the ball. At a nondegenerate saddle the characteristics expand along the negative eigendirection, so mass converging to must start near a codimension-one stable set, and a bounded density puts too little mass in a thin slab around it to deliver the atom . This is why the examples assume bounded densities: they exclude initializations sitting exactly on saddles.
In the Gaussian example symmetry reduces the PDE to one dimension, and at the risk depends on two numbers. The PDE preserves rotation invariance (which no finite set of neurons has), so is determined by the law of . As independent uniform directions are orthogonal, so each class output concentrates at , , and the risk is a sum of squares of the class residuals . The radial force factors, so it changes sign at most once, and the signs of determine the outcome: equal signs leave only stationary points with risk at least 1, never reached from below 1; one mixed sign traps mass at , the global minimizer when ; the other puts at a maximum of the potential, which Step 5 rules out. For the limit has zero risk, and finite follows by continuity of the PDE in and Theorem 3.
Homogeneity plus spread initialization turns stationary limits into global minima. A limit has on its support; optimality needs everywhere. If is negative somewhere, take a negative regular value of its restriction to the sphere: near the cone over that sublevel set is invariant and, by 2-homogeneity, the radial velocity there is at least , so and any mass in the cone grows exponentially and pushes the flow out of every neighborhood of . The support condition keeps mass in every cone: by a topological degree argument, if separates two spheres then so does (in the 1-homogeneous case the sets separated are , and the mass in the cone grows at least linearly instead of exponentially). So a convergent flow cannot converge to a non-optimal point; the result gives no rate but needs no noise. In the experiments particle gradient descent needs only slightly more particles than the sparsest minimizer (for a 4-neuron ReLU teacher in , 5 fail and 10 succeed).
Consequences and limits. With normalization the number of hidden units is not a parameter of the dynamics: once , SGD follows a PDE with a convex risk landscape, independent of , and samples reach any fixed PDE time. Global convergence needs entropy (at a temperature cost of order against the penalized risk ), symmetry, or homogeneity with a support condition. The main limit is time: the error bound grows like , so the approximation helps only when the PDE converges in bounded time, and that time is uncontrolled (heuristically ). The noiseless global results assume convergence or use symmetric models with tailored activations, and everything is for one hidden layer with scaling, which Yang and Hu (next) place in a larger space of abc-parametrizations.
Terms
- ; convex in since
- : half the first variation of , the potential each neuron feels
- Distributional dynamics
- , the gradient flow of
- Fixed point vs minimizer
- supp versus supp
- Propagation of chaos
- each neuron stays close to an i.i.d. McKean-Vlasov copy with the same start
- ; strictly convex, unique Gibbs minimizer
- Temperature cost
- class residuals at in the Gaussian example; their signs classify fixed points
- Separation condition
- separates two spheres (2-homog.) or (1-homog.)
- Optimality in
- everywhere and on the support
Quiz
- In the proof of Theorem 3, what controls the error from replacing the empirical measure of the neurons by in each neuron's drift?is bounded and Lipschitz, so the drift error is at most plus the deviation of an average of independent terms. Grönwall then closes over the maximal deviation, which is where comes from.
- What does the temperature cost in Theorem 4, and where does the come from?Compare at with the lower bound on at its minimizer: the terms of the two entropy estimates cancel, leaving plus from smoothing.
- Why do Theorems 1 and 7 assume the initialization has a bounded density?Near a fixed point with a negative curvature direction the flow expands that direction, so only mass close to the stable set reaches it. A point mass placed on the saddle would stay; a bounded density cannot deliver the atom .
- Theorem 3's error bound carries a factor . What does that imply about using the PDE to analyze SGD?The bound is for a fixed horizon and degrades exponentially in it. The examples work because the reduced PDE reaches near-optimal risk at a finite , after which neurons and samples suffice.
Sources
- Song Mei, Andrea Montanari, and Phan-Minh Nguyen. A Mean Field View of the Landscape of Two-Layers Neural Networks. Proceedings of the National Academy of Sciences, 2018.
- Lenaic Chizat and Francis Bach. On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport. NeurIPS, 2018.