On the Convergence of Gradient Descent Training for Two-layer ReLU-networks in the Mean Field Regime
Stephan Wojtowytsch
Introduction
Practitioners have found that artificial neural networks can be trained by gradient descent-based algorithms to fit many complicated target functions. While it is well-understood why the function class is sufficiently expressive for this purpose [Bar93, Cyb89, Hor91, LLPS93], the choice of optimal network parameters in applications is a highly non-convex problem. It is not fully understood why cleverly initialized gradient descent achieves good performance in practice.
In [CB18b], the authors prove that if the parameter distributions of neural network-like models converge to a limiting distribution, then the limit is in fact a global minimizer. The result is true for a class of ‘spread out’ initial conditions (implying very wide networks) and under some technical assumptions. One of the most prominent cases concerns function models with the same homogeneity as neural networks with a single hidden layer and ReLU (or leaky ReLU) activation. However, the result does not apply directly due to the lack of differentiability of these activation functions.
In this article, we extend the main result of [CB18b] for this ReLU-like setting and generalize previous results for some cases. The results proved here improve upon previous work in two ways:
Our analysis applies to ReLU-networks with suitable initial conditions rather than toy models with similar properties.
We only assume that a limiting object, whose existence is guaranteed by compactness, is unique.
In the analysis we exploit that ReLU activation
Consider a two-layer mean field network model
As time goes to infinity, converges to minimum Bayes risk.
The velocity potential converges to a unique limit locally uniformly as .
If approaches MBR, we can additionally identify the limit
The study of Wasserstein gradient flows in the context of (infinitely wide) shallow neural networks is motivated below. The same problem exactly captures the gradient descent training of finite neural networks for infinitesimal learning rate and asymptotically captures stochastic gradient descent when the learning rate is so small/batch size is so large that stochastic effects are negligible.
As time goes to infinity, converges to minimum Bayes risk.
The velocity potential converges to locally uniformly as .
The loss function is assumed to be -smooth (with bounded derivative). We can consider more general loss functions (e.g. mean squared error), but only for uniformly bounded data. The initial condition can be generalized, but we require that at time we have -almost surely. The Minkowski inner product is preserved along the gradient evolution and the condition unless also allows us to avoid issues of non-differentiability. To establish existence of a minimizer, it suffices that a certain projection of converges.
The significance of our result is as follows.
We do not need to assume the existence of a limit (guaranteed by compactness), but only its uniqueness.
One of the main complications of the question of convergence to minimal energy for this gradient flow is the dependence on the initial condition. The question whether the limit of the velocity potential is generically unique can be asked independently of the initial condition and seems more approachable by standard means of analysis. We therefore believe that this perspective might be a first step towards the convergence theory for Wasserstein gradient flows for shallow neural networks.
In the proof, we show directly that convergence to minimal energy implies convergence of the velocity potentials to zero. This resembles the first order optimality condition in classic calculus and does not require deep geometric insight. In the converse direction, the geometry of the energy landscape is used via the homogeneity of the activation function. While we formulate all results for ReLU-activation, they hold equivalently for leaky ReLU networks. We prove that the second moments of the evolving parameter distribution grow at most sublinearly under general conditions and show that if the unique limit does not vanish identically, they grow exponentially. Thus only is admissible as a unique limit. In this situation the second moments – which are bounded below by zero – decrease linearly at a positive rate unless decays to minimum Bayes risk.
The article is structured as follows. In the remainder of this section, we briefly review previous work and collect some notation. In Section 2, we describe the setting, state our main assumptions, and review some additional background information on Wasserstein gradient flows and continuity equations. In Section 3, we state our main results. Some concrete examples of data distributions and loss functionals to which the results apply are listed in Section 4. We conclude with a discussion of our results in Section 5. Longer proofs and some technical details are collected in Appendix A. Appendix B is dedicated to the technical condition of Morse-Sard type which we assume.
Introductions to machine learning in general and neural networks in specific can be found for example in [SSBD14, HH19, GBC16, MBW+19].
The question why (stochastic) gradient descent starting at a suitable random initialization finds good parameters for artificial neural networks despite the fact that the energy landscape is highly non-convex has attracted much attention and several competing explanations have emerged.
One avenue of research aims to uncover a description of gradient descent in neural networks in the infinite neuron limit in the mean field scaling regime [CB18b, RVE18, SS20, MMN18]. Convergence criteria in the shallow network setting are developed for example in [AKSG19] and [CB18b], but have not been established generally.
Another line of articles [EMWW19, EMW19d, BM19, DZPS18, DLL+18, JGH18, ADH+19] considers a heavily overparametrized regime with large initialization. In this setting, the gradient flow for neural networks behaves is proved to behave like the gradient flow of a very wide random feature model [EMW19d, EMWW19] with high probability over the choice of (suitable) initial condition. In particular, the direction and bias of a neuron barely change from their (random) initialization in this regime. Chizat and Bach dub this the ‘lazy training regime’ since neurons hardly move. They show that the underlying analysis is due rather to a (usually implicit) scaling assumption on initialization rather than the specific structure of neural networks [CB18a].
The success of neural networks in practical applications has been explained by the observation that – unlike any linear theory – neural networks can beat the ‘curse of dimensionality’ [Bar93]. It thus seems unlikely that linearization is able to explain their recent success. Furthermore, in these studies parameters are usually initialized so large that the path norm a two-layer network with hidden neurons scales like at initialization. Natural generalization bounds as derived in [EMW19a, EMW18] therefore do not apply.
Practitioners tend to train neural networks using stochastic gradient descent rather than full gradient descent. For small learning rate (time step size), the evolution can be described by SDEs with Gaussian noise [HLLL19, LTE15]. The noise coefficient is given by the covariance of the gradient, which is usually neither isotropic nor homogeneous. However, in the mean field regime and assuming that the noise is standard Gaussian, one can prove that the parameter distribution converges to a good value (minimizer of a regularized risk functional), see [HRSS19]. The derivation is built on the link of the heat equation to both stochastic analysis and optimal transport theory [JKO98]. In this case, the parameter distribution approaches the stationary measure of a Markov process as time approaches infinity. If the noise is sufficiently large, the convergence is exponential, while for small noise, the stationary measure approaches a minimizer of the mean field risk functional.
Rigorous convergence results in realistic settings can be obtained under strong assumptions on the initial condition (or a state which arises along the gradient flow). One example is [BJ18], where the authors show that if a neural network has well chosen parameters at some time, the parameters improve along the gradient flow. In [AKSG19] the authors study a mean field gradient flow and show that under a regularity/closeness assumption, the gradient flow converges. Unfortunately, the condition cannot be verified in practice. Global convergence for a toy model with similar properties is established in [EMW19c, Section 7].
Some results in [CB18b] also apply to neural networks with smooth activation and more than one hidden layer. However, the imposition of a linear structure results in network-like models where each neuron in the outermost layer has its own trainable weights for the deeper layers. More recent works in the mean field setting consider deep neural networks whose parameters are initialized independently across the layers [AOY19, NP20, SS19]. The independence is preserved through time (‘propagation of chaos’) and a mean field description is available in different scaling limits. The theory is entirely different from that of shallow networks. While a shallow networks can be described by indexed particles , the paths in a deep network through multiple layers have a more complicated interacting multi-index structure .
2. Notations and Terminology
Background and Assumptions
In this section, we describe the objects under consideration in this article. Some assumptions will be relaxed in Section 3.4.
For this introduction, the choice of cone is inessential and will be motivated later in Section 2.5. Note that the family
The property is known to hold when the parameters are not constrained to a cone, the factor is not present and coefficients are included before [Cyb89]. None of these differences are significant as
A parameter distribution is a Borel probability measure on with finite second moments
i.e. is an element of Wasserstein space over the cone . We denote the realization of as
The uniform distribution on the unit sphere satisfies (P4).
which encodes many important properties of the problem.
2. The Risk Functional
Combining all previous notions, we define the risk functional ,
A few observations are in order. Recall that or denotes the space of Radon measures with finite second moments (on the natural space in a given context, which usually is ).
The function is measurable (see Lemma 2.3 below), but cannot generally be assumed to be continuous.
We note that there exists a measurable selection of minimizer for . This is not entirely immediate even when is strictly convex.
The functional admits a minimizer if and only if there exists a measure such that
In particular, as is -Lipschitz (where again denotes the second moments of ), there must be a version of which is Lipschitz-continuous. The Lipschitz condition is far from sufficient [EW20b]. Since
the set of minimizers is a convex subset of .
Write . The fact that implies that the measure representing a function cannot be unique: Any measure such that (i.e. for all measurable ) represents the function since
In ReLU networks, another source of non-uniqueness is the identity
More generally, if represents and represents , then for any consider the probability measure
In particular, while the minimizer of is unique if is strictly convex, a minimizer of must be highly non-unique. This is a major obstacle in linearization-based approaches to convergence.
3. Wasserstein Gradient Flows
The study of Wasserstein gradient flows in machine learning is motivated by the following observation: The parameters of a parametrized function
evolve by the time-accelerated Euclidean gradient flow
if and only if their distribution follows the -Wasserstein gradient flow of the extended risk functional
A key observation is that the individual particles are irrelevant and only their distribution matters when computing . We refer to two-layer network functions of the form as mean field networks in contrast to classical two-layer networks . Both classes are identical from the perspective of approximation theory, but lead to different dynamic models in the infinite-width limit. Classical networks are described by the linearized dynamics of neural tangent kernels, while mean field networks evolve truly non-linearly by Wasserstein gradient flows.
Thus optimizing mean field network parameters by the gradient flow of a risk functional is equivalent to optimizing their distribution by a Wasserstein gradient flow, see e.g. [CB18b, Proposition B.1]. An expanded heuristic can also be found in Appendix A.
The gradient flow and the map (so also the risk functional ) are naturally defined on the Wasserstein space of probability measures with finite second moments. Background on optimal transport theory and Wasserstein gradient flows can be found e.g. in [AGS08, San15, Vil08].
In this article, we mostly consider Wasserstein gradient flows of continuous distributions. By continuity, the Wasserstein gradient flows starting at converge to the solution of the Wasserstein gradient flow starting at for all . Even more, the limits
commute (if they exist). A proof under an additional technical condition (which can be eliminated if one considers gradient flows of unregularized risk or the second moment regularizer) is given in Appendix B of [CB18b]. The complication arises from regularizing functionals which do not have the correct homogeneity, which leads the authors to consider compactly supported initial conditions.
Hence if the gradient flow starting at a measure converges to a minimizer of risk, then gradient flows starting at closeby empirical measures asymptotically achieve low risk. The theory, at this point, is purely qualitative, but nonetheless indicative for practical applications.
The Wasserstein gradient flow is described by the continuity equation
denote the variational derivative of with respect to and its spatial gradient respectively.
4. Continuity Equations
Then according to [Amb08, Proposition 4], we have
The Lemma does not apply directly to the situation which we will consider since the flow field will be positively one-homogeneous and thus unbounded in most cases. However, the result also applies under the weaker assumption
see [Amb08, Remark 7]. The condition of at most linear growth is required to prevent particles from escaping to infinity in finite time. Thus (2.5) and (2.6) apply also in our situation.
5. Initial Condition
There are two considerations concerning the initial parameter distribution of the gradient flow. The first is specific to ReLU activation and of a technical nature while the second one is more geometric and concerns energy decay to minimum Bayes risk/convergence to minimizers.
We can formally compute the parameter gradient of the activation function
There is a more subtle problem of regularity. Assumption (P4) guarantees that
generally fails to even be continuous. This difficulty can only be circumvented if is close to zero whenever is close to zero. At this point, the geometry of the ReLU function as the product of two positively one-homogeneous functions comes into play. Namely, we can use the fact that
In particular, the cone of space-like vectors
is preserved along the gradient flow evolution. Inside , we have , which allows us to save the Lipschitz property. We therefore restate an assumption on the initial condition more explicitly.
It is possible to consider initial conditions supported on other super-level sets like instead. A flow starting at supported on will never reach a point where , but on the other hand does not allow us to exploit the positive two-homogeneity of in as easily since is not a cone. Positive two-homogeneity is essential to many arguments below, so we proceed with instead.
5.2. Omni-directional initial conditions
It is well-known that the functional is not sufficiently convex in Wasserstein geometry to guarantee convergence to global minimizers from any initial condition. In particular, if a global minimizer exists but cannot be written as an empirical measure with atoms, any initial condition corresponding to an empirical measure with atoms cannot converge to since the continuity equation has no smoothing effect and preserves atomic measures.
The following class of initial conditions is successful in theory and applications.
We call a probability measure on omni-directional if every open cone in has positive measure.
Omnidirectional initial condition: is omni-directional.
Clearly, an omni-directional initial condition is an abstraction available only in the infinite-width limit.
6. Morse-Sard Property
Below, we prove existence and uniqueness for gradient flow training of ReLU-activated two-layer networks under the assumptions listed above. For technical reasons, we add an assumption which has only been established in full generality in dimension . The assumption is only required when discussing the limiting behavior of the gradient flow.
locally uniformly on . Then the restriction of to the unit sphere has the property that does not vanish anywhere on the level set for Lebesgue-almost every , where denotes the gradient of tangent to the sphere and the tangent map to the projection onto the sphere.
We discuss the Morse-Sard condition below in Appendix B. Using smoothness, we establish the property in dimension two and provide evidence on the other hand that (M-S) may not be expected to hold in high dimension in full generality. We isolate the point in the proof where the condition is used and where an argument would need to be adapted in order to avoid it.
A weaker version of the main result holds without this condition.
Evolution of the Parameter Distribution
We first establish that solutions to gradient flow training exist. Assume all conditions outlined above except for (IC2) and (M-S), which are only required for statements about limiting objects.
Let . Then there exists a unique solution to the Wasserstein gradient flow (2.3).
The next statement will be useful to understand the behavior of limits as .
If is omni-directional and denotes the Wasserstein gradient flow starting at , then is omni-directional for all .
This Lemma is a simpler version of [CB18b, Theorem 3.3]. The proof is based on the flow map representation. Since the activation function is positively two-homogeneous in the network parameters, the flow field is positively one-homogeneous, which means that half-rays move as half-rays and cones are preserved under the flow. Both results also apply directly to explicitly regularized risk functions with suitable homogeneity such as
2. Growth of Second Moments
Recall that we had denoted the second moment of by
Under gradient flow training, can only grow sublinearly in time.
If evolves by the Wasserstein-gradient flow of , then
On the other hand, the key insight of [CB18b] is that the homogeneity of implies that if the velocity potentials were to converge to a non-trivial limit as , it would lead to exponential growth of .
converge to a function and a vector field respectively, locally uniformly on . If , then
We give both proofs in the appendix for the reader’s convenience. The proof of Lemma 3.4 is the only point in the document where the assumptions (IC2) and (M-S) are used.
3. Main Results: Lipschitz Loss
We can now characterize the convergence of Wasserstein gradient flows for the risk functional with omni-directional initial conditions entirely. We consider the simultaneous -limit set
Assume the above conditions (L1), (L2), (L3), (P1), (P2), (P3), (P4), (LP1), (LP2), (IC1), (IC2), (M-S). Then
if and only if consists of only one element.
If consists of only one element, then that element is .
The first statement of the Theorem does not require (IC2) and (M-S). Verifying that there exists only a single element in is non-trivial. Generally uniqueness is proved by showing that the limit satisfies an equation which can be studied separately. Even assuming that there exists a limiting measure such that , the natural ‘zero dissipation in the limit’ condition
only shows that for -almost all . This is significantly weaker than every if concentrates on a small set. Functions satisfying the zero-dissipation property are stationary points of the flow, and there are many of them which are not the global minimum. Not assuming the existence of a limit , linearization becomes highly involved since the map is far from injective. This makes the question of uniqueness non-trivial. Despite these obstacles, we believe the result to be a first step towards a general convergence theory. Without assumptions (IC2), (M-S), a weaker result holds.
Assume that (L1), (L2), (L3), (P1), (P2), (P3), (P4), (LP1), (LP2) and (IC1) hold. Then
if and only if contains only the function .
Having found a characterization for risk converging to zero for omni-directional initial conditions, we now turn our attention to the question of whether we can find a minimizer of risk. The corollary is almost immediate.
If in addition to the assumptions of Theorem 3.5 we assume that there exist a sequence of times and a measure on such that in 2-Wasserstein distance and , then , i.e. is a risk minimizing measure.
The existence of a suitable subsequence is guaranteed if the -th moments of remain uniformly bounded for some . A version of Corollary 3.7 also holds under the same assumptions ad Theorem 3.6. Under a weaker condition, we obtain a weaker statement.
If in addition to the assumptions of Theorem 3.5 we assume that the second moments remain uniformly bounded (at least along a subsequence of times ) and , there exists a measure such that (i.e. a risk minimizing measure).
Again, there is a version of Corollary 3.8 under the conditions of Theorem 3.6. The measures may not have a limit in 2-Wasserstein distance, but we can explicitly construct from by a reparametrization argument. If the second moments of remain uniformly bounded in time, there exists a subsequence which converges to a limit in -Wasserstein distance for all . This is not sufficient since the map is not continuous in this topology, as the following example shows:
4. Main Results: Smooth Loss and Bounded Data
for any . We consider the modified loss function
for and the modified risk functional
for all such that .
In particular, the gradient flow of starting at a fixed measure independent of exists and describes the gradient flow of for . Note that the growth rate of does not depend on . Thus we may take to infinity to find that the gradient flow of exists on . We have shown the following.
Replace assumption (P2) by the stronger assumption
and condition (L2) by the weaker assumption that
Then the gradient flow of starting at exists. If is omni-directional, so is for all .
Also the results on the convergence of gradient flows generalize under slightly stronger assumptions on the loss function. Examining the proof of Theorem 3.5, we find that the relevant properties of the proof are the following, which we postulate as conditions for smooth loss functions.
.
Assume the conditions (L1), (L2’), (L3), (P1), (P2’), (P3), (P4), (LP1), (LP2), (IC1), (IC2), (M-S), (SL1), (SL2) and (SL3). Then
if and only if consists of only one element.
If consists of only one element, then that element is .
Corollaries 3.7 and 3.7 remain true also in this case, and Theorem 3.6 generalizes in the same way.
Examples
We imposed a number of abstract conditions on the loss function, data distribution, and initial condition. In this section we consider concrete situations where the conditions are met.
then any is an admissible minimizer. More generally, we can observe that Huber loss has a characteristic smoothing length scale. If data is very spotty on a larger length scale, uniqueness of the minimum may not hold.
is almost surely not finite-valued. Our results apply directly in the first situation, but not the second. In this case, the minimizer is simple enough to be understood directly. Namely,
would be expected to lead to similar behavior. Here is any compactly supported probability density, is a small parameter and denotes Lebesgue measure. Empirical measures are recovered in the singular limit .
Using Theorem 2.1, many data distributions of practical importance are admissible for Lipschitz loss, including all distributions which have a bounded density with respect to Lebesgue measure and decay suitably fast at infinity, e.g.
distributions with continuous density on a bounded open set or
Gaussian mixture models with uniformly bounded means and variances.
For general loss functions, the first class is admissible, while Gaussian mixture models are excluded for purely technical reasons.
The question which lower-dimensional objects have admissible geometry remains open at this point.
Initial conditions need to be omni-directional and satisfy the scaling property
The easiest choice of admissible condition is to independently choose uniformly distributed on and uniformly distributed on $(w,b)$ according to a standard normal distribution with mean zero and unit variance. It is easily computed that
and due to [Ver18, Theorem 3.1.1], the norm of concentrates close to in the sense that
for a universal constant . Thus if is distributed on a domain sufficiently smaller than and is reasonably large with respect to the network width, then with high probability satisfies (IC1).
Conclusion
We have shown that the convergence of gradient descent training with infinitesimal step size for two-layer networks with ReLU or leaky ReLU activation starting at omni-directional initial conditions is equivalent to the convergence of the velocity potential to a unique limit (under certain technical conditions). The result holds for a fairly general class of loss functions and data distributions. Convergence along subsequences is guaranteed by compactness.
We have shown that convergence to minimal Bayes risk is equivalent to the convergence of the velocity potentials to a unique limit (for suitable initial conditions). Whether the limiting potential is generally unique remains one of the most relevant open questions in theoretical machine learning.
To prove existence and make use of the flow map representation, we are restricted to population risk for suitable data distributions. Especially for the case of low-dimensional data in high-dimensional spaces, the regularity condition on the data manifold is hard to understand and check.
Even if a risk-minimizing measure exists and risk decays to its minimum, it is unclear whether
the second moments remain bounded, and
the measures converge to a minimizer weakly or in -Wasserstein distance (assuming that remains bounded).
State-of-the-art neural network architectures can have hundreds or even thousands of layers, far from the two-layer situation considered here. In [CB18b], the authors consider also the case of smooth bounded activation functions which are linear in one direction (and sufficiently smooth). These results apply to network architectures in which every node in the outermost layer is given its own set of parameters for deeper layers. Other models for mean field training of deep networks [AOY19, Ngu19, NP20, SS19] are very different from models for shallow networks. No analogous result is available in this setting.
Appendix A Proofs
In this section we collect the previously omitted proofs.
Thus is represented by as for
In particular, there is a canonical representative in the unit sphere
For the derivative estimates below, we can assume without loss of generality that , as the Lipschitz estimate extends to the boundary points by uniform continuity. Given a density , denote
We prove the first claim. Let . Without loss of generality, . Here, we can even take in the decay condition and compute
This is bounded from above uniformly when is bounded away from by (A.1) and close to by (A.2). The passage to the limit can be justified using Fatou’s lemma. A similar estimate holds for the limit , and the derivative in direction of increasing/decreasing radially is the same as that in direction of changing .
Then we can therefore bound the tangential derivative as follows.
The remainder of the proof proceeds as above, except for the weight of in front of the density. While previously a decay as for would have been sufficient, here we need decay as at infinity.
The proof of the second statement is similar to the first. The third statement is immediate from the definition. To consider the fourth statement, let be the set of Radon probability measures
for all open sets . In particular, the symmetric differences of open sets are open. This establishes the Lipschitz condition by the previous analysis since
In particular, sums of Gaussian distributions or compactly supported regular distributions as they occur in density estimation are admissible data distributions for our purposes. They can be computed from a given finite data sample and mollify the problem sufficiently for our convergence result.
Many full-dimensional data distributions satisfy (P4), but distributions with a bounded density on the hypersphere is admissible. If data is concentrated on a manifold of dimension , the intuition is that should not have any ‘straight’ segments which lie mostly in a lower-dimensional affine subspace.
A complete characterization of admissible measures is beyond the scope of this article. We move on to the proof of the measurability of .
Hence the function is a Caratheodory integrand (finite, continuous in and measurable in ) where belongs to a second countable complete space. It is well-known that such functions are jointly measurable, see [AB94, Theorem 14.75]. Sketch of proof: Define and the sequence of functions
Second claim. To find we use the Kuratowski-Ryll-Nardzewski Selection Theorem [AB94, Theorem 14.86] which states that if the (possibly multi-valued) map
is a weakly measurable correspondence (see [AB94, Chapter 14]) with nonempty closed values in a Polish space, then it admits a measurable selector. The only non-trivial fact is the weak measurability of , which means that we need to check that the set
is measurable in whenever is open. Any open set admits a countable dense subset , which means that
is measurable due to the continuity of in . We conclude that
For the reader’s convenience, we link Wasserstein gradient flows to classical gradient flows.
Let and . Then
Thus if the parameters evolve by the law for all , then their distribution satisfies the transport equation
by the flow map representation. This is precisely the PDE formulation of the 2-Wasserstein gradient flow. ∎
Now we show that gradient flow of exists for any initial condition and that the omni-directionality of the initial measure is preserved along the gradient flow evolution (for finite time). Except for technical issues stemming from the lack of regularity in ReLU activation, the analysis follows [CB18b, Appendix B].
is a smooth cut-off function. In particular, note that
is Lipschitz continuous with Lipschitz constant .
The first term on the right is bounded by
since is a positiively one-homogeneous function which is Lipschitz-continuous on the sphere and thus Lipschitz continuous. The second term on the right is
Tangency condition. We can write . Then the normal to is parallel to . Fix and consider any such that . Since close to , we have
since is positively one-homogeneous. The equality also holds trivially at for which , so in particular after integration. ∎
In the calculus of variations (which encompasses the study of gradient flows), different notions of convexity play a key role. In vector spaces, convexity is a condition along straight lines, which (at least for Hilbert spaces) are the same as length-minimizing curves. The natural generalization to (geodesically complete) metric spaces is to consider the notion of convexity where a functional is ‘convex’ if it is convex along constant-speed length minimizing geodesics. The analogy is particularly strong in -Wasserstein space, which carries the formal structure of a Hilbert manifold, see [Ott01] or [Vil08, Chapter 15]. This concept of convexity is referred to as displacement convexity and has been recognized since [McC97] as a useful notion when considering gradient flows.
The functionals we consider are not convex in Wasserstein space – in fact, convergence to a global minimizer is not guaranteed. For the existence of gradient flows, a weaker concept suffices. Recall that the functional is called -displacement convex, if the following holds: If is a geodesic in Wasserstein space, then
By analogy with the smooth Euclidean case, we can think of the condition as a lower bound on the Hessian . Convexity corresponds to -convexity and uniform convexity to -convexity for .
It suffices to show that is -convex on $h^{\prime\prime}\geq-\lambda\,W^{2}_{2}(\pi_{0},\pi_{1})h^{\prime}\lambda\,W_{2}^{2}(\pi_{0},\pi_{1})$-Lipschitz, which can be thought of as a type of Hessian bound from both sides instead of just one side. Note that
Step 2. Existence of the gradient flow follows directly from [AGS08, Theorem 11.2.1].
Step 3. In this step, we show that the gradient flow of preserves the cone , i.e. if , then for all . Note that the flow field
is Lipschitz-continuous in with a uniform Lipschitz constant for all times by Lemma A.2. Like in Section 2.4, we find that where is the flow map defined by
It thus suffices to show that for every . This is immediate since
is parallel to on the boundary since is parallel to at whenever it is defined – see also Section 2.5. ∎
We now prove that the gradient flow preserves the omni-directionality of measures (for finite positive time).
Since we can solve the ordinary differential equation backwards in time for any , is a bi-Lipschitz homeomorphism.
Finally, we note that for all since
due to the homogeneity of . Thus, the flow preserves half-rays and cones.
Proof of omni-directionality. Consider an open cone . Then by [Amb08, Lemma 4], we have
since also is an open cone in . ∎
The analysis of the flow map shows more. Since rays are preserved, the projected measures on the unit sphere evolve by the continuity equation
where is the tangential gradient to the unit sphere. In particular, if has a density with respect to the uniform measure on , then has a density and
Next we show that the second moment of grows at most sublinearly in time.
Note that has finite second moments, so the quadratic test function in the variational formulation is admissible. If is compactly supported, then so is for all by the flow map representation and the linear growth of the flow field at infinity. In this situation, the identity is obvious. Otherwise, the argument is easily justified by using approximating test functions where is a smooth cutoff function satisfying , for and for . Thus for every we have
Since is monotone decreasing and bounded from below (by zero), converges to a limit. Thus, for every we can choose such that for every and hence
Note that the proof applies in great generality to models with a linear structure. The next proof concerns the exponential growth of second moments if the velocity potential converges to a non-trivial limit. It is adapted from [CB18b] and repeated in this context for the reader’s convenience. The following proof is the only point at which the Morse-Sard property is used in this article. It is also the only argument which hinges on the omni-directionality of the initial parameter distribution.
for all , and
does not vanish on where is the inner normal vector to .
Using Assumption (M-S), can for example be chosen as
for some . We define the localized second moments
Since is compact and locally uniformly, we find that there exists such that on for all . In particular, no mass flows out of after time : If then also for . Thus
Secondly since locally uniformly, there exists such that
for all . Without loss of generality, we assume that . In particular
for and , using the positive two-homogeneity of . Thus
for and , and consequently
If is omni-directional, then so is and . ∎
Morally, assumption (M-S) is used to control the sign of a boundary flux term. Without an assumption of this type, the term would at most be asymptotically non-negative. It would be necessary to control the size of the boundary term by a volume contribution and its asymptotic behavior.
A.2. Proofs from Section 3
We use these results to prove the main theorem.
Step 1. Since and are positively two- and one-homogeneous respectively, we find that and for any . According to Lemma A.2, we may assume a uniform Lipschitz bound on . This implies a uniform Lipschitz bound also on on bounded sets. We thus conclude that and have convergent subsequences, since Lipschitz-space embeds compactly into the space of continuous functions by the Arzelà-Ascoli theorem.
Step 2. First, assume that consists of only one element . Then either or . In the first case, we have by Lemma 3.4 that grows exponentially in time, contradicting Lemma 3.3. In the second case, we use homogeneity to show that
because . Since is bounded from below by zero, it cannot decrease linearly at a fixed non-zero rate for all large arguments. We conclude that
Step 3. Now, assume that , i.e.
where is the augmented loss function discussed in Section 2.2. Since the first integrand is always larger than the second one, their difference is positive and thus we conclude that
Thus . By compactness, we know that is non-empty, and we have showed that for any sequence, we can extract a subsequence for which . Since locally uniform convergence is generated by a topology, this means that is the only possible limit point. The same argument can be used for the gradient. ∎
Note that omni-directionality is only used to exclude the case that , whereas is only an admissible limit if decays to MBR. This corresponds to the fact that if and only if is a global minimizer of , see [CB18b, Proposition 3.1].
Omni-directionality of the initial condition (IC2) and the Morse-Sard property are both involved only in excluding a unique limit . They could therefore be replaced for example by the zero-limit assumption
If locally uniformly on and , then
The following two proofs establish the corollaries to the main theorem concerning minimizers.
If we assume in addition that there exists a probability measure and a sequence of times such that , then we find by [Vil08, Theorem 6.9] that
Thus minimizes . ∎
Consider the measures on defined by
for , or equivalently
where is the canonical projection. While is undefined at , the projection of the measure with weight is well-defined. Under the moment bound assumption, the measures are uniformly bounded and
. In this case and is a risk minimizer.
. In this case, we define the dilation map and
for all , so is a risk minimizer.
Thus the projection to the unit sphere adds compactness beyond the moment bound.
Appendix B The Morse-Sard Property
The result is due to Morse for [Mor39] and Sard for general [Sar42]. It is easy to extend the result to sufficiently differentiable manifolds, and there are more precise statements available for the Hausdorff measure of where
Morse-Sard theorems are known to fail in infinite dimension even for infinitely smooth maps, unless additional assumptions are imposed. Under weak conditions, however, the set of functions for which the Theorem holds is dense in the -topology [EM68].
Due to its fundamental importance, some effort has been made to establish Morse-Sard type properties in other function classes. Among these are
Morse-Sard theorems in classes of weakly differentiable functions [Fig08, BKK13, BKK15, dP01, KK18]. Here the relation between differentiability and integrability may even be chosen low enough to ensure continuity, but not classical differentiability of the functions under consideration.
Morse-Sard theorems for the distance from a submanifold [Rif04] or more generally Lipschitz functions which are given as suprema of smooth functions over suitable index sets [BDDR16].
Morse-Sard theorems for subanalytic functions, see [BDL06].
Morse-Sard theorems for dc functions in two dimensions [PZ06]. A function is dc if it can be written as differences of two convex functions. In particular, every -function with bounded second derivatives is dc. Thus the result cannot be generalized to higher dimensions.
In non-smooth function classes, a notion of gradient almost everywhere (with respect to a suitable Hausdorff measure) or a sub-differential is used.
We show below that (M-S) holds unconditionally in dimension . In [CB20], the Morse-Sard theorem for subanalytic functions from [BDL06] has successfully been used to establish a condition of Morse-Sard property in a very similar application. The subanalytic function that the authors consider in [CB20] is a finite sum of ReLU-like terms and the subanalyticity stems from the finiteness of the sum. The number of summands corresponds to the number of data samples in an empirical measure. The approach is therefore incompatible with assumption (P4) for the ReLU case.
While it does not apply in our situation, we briefly sketch the result and its application in a similar situation. Consider . Then is only Lipschitz-smooth and not , but has the Morse-Sard property due to its sub-analyticity.
We recall the following Morse-Sard theorem.
We show that this applies to finite ReLU networks.
is continuous and sub-analytic.
Continuity is clear. Let . Since is affine linear on the set , the graph is a plane and thus sub-analytic here. Now assume that and for all . Then, locally after a rotation and translation we have
The graph of this function is sub-analytic since
The case when more terms vanish can be treated similarly, but is somewhat tedious to write out. It is, however, crucial that the sum is finite to ensure that there are at most finitely many sets to be united and intersected. ∎
B.2. ReLU Geometry on the Sphere
We can exploit the special geometry of the problem to reduce the dimension slightly. We can write
the only critical value is (possibly) zero. On the other hand, consider in . We note that
B.3. A mild counterexample
We show that functions with similar structural properties as (or ) may not satisfy a Morse-Sard property in dimension .
The space of Barron functions is discussed in detail in [EMW18, EMW19b, EW20a] and [EW20b, Appendix A]. The space is named after Andrew Barron who first established that a large class of functions could be represented in such a way. We cite a simplified version of Barron’s main theorem.
Using the identity and Parseval’s identity, we compute
In dimension there exist Barron functions which do not have the Morse-Sard property.