January 22, 2024
We study the generalization performance of gradient methods in the fundamental stochastic convex optimization setting, focusing on its dimension dependence. First, for full-batch gradient descent (GD) we give a construction of a learning problem in dimension \(d=O(n^2)\), where the canonical version of GD (tuned for optimal performance of the empirical risk) trained with \(n\) training examples converges, with constant probability, to an approximate empirical risk minimizer with \(\Omega(1)\) population excess risk. Our bound translates to a lower bound of \(\Omega (\sqrt{d})\) on the number of training examples required for standard GD to reach a non-trivial test error, answering an open question raised by [1] and [2] and showing that a non-trivial dimension dependence is unavoidable. Furthermore, for standard one-pass stochastic gradient descent (SGD), we show that an application of the same construction technique provides a similar \(\Omega(\sqrt{d})\) lower bound for the sample complexity of SGD to reach a non-trivial empirical error, despite achieving optimal test performance. This again provides an exponential improvement in the dimension dependence compared to previous work [3], resolving an open question left therein.
The study of generalization properties of stochastic optimization algorithms has been at the heart of contemporary machine learning research. While in the more classical frameworks studies largely focused on the learning problem [4], [5], in the past decade it has become clear that in modern scenarios the particular algorithm used to learn the model plays a vital role in its generalization performance. As a prominent example, heavily over-parameterized deep neural networks trained by first order methods output models that generalize well, despite the fact that an arbitrarily chosen Empirical Risk Minimizer (ERM) may perform poorly [6]–[8]. The present paper aims at understanding the generalization behavior of gradient methods, specifically in connection with the problem dimension, in the fundamental Stochastic Convex Optimization (SCO) learning setup; a well studied, theoretical framework widely used to study stochastic optimization algorithms.
The seminal work of [9] was the first to show that uniform convergence, the canonical condition for generalization in statistical learning [10], [11] may not hold in high-dimensional SCO: they demonstrated learning problems where there exist certain ERMs that overfit the training data (i.e., exhibit large population risk), while models produced by e.g., Stochastic Gradient Descent (SGD) or regularized empirical risk minimization generalize well. The construction presented by [9], however, featured a learning problem with dimension exponential in the number of training examples, which only served to prove an \(\Omega(\log{d})\) lower bound on the sample complexity for reaching non-trivial population risk performance, where \(d\) is the problem dimension. In a followup work, [1] showed how to dramatically improve the dimension dependence and established an \(\Omega(d)\) sample complexity lower bound, matching (in terms of \(d\)) the well-known upper bound obtained from standard covering number arguments [12].
Despite settling the dimension dependence of uniform convergence in SCO, it remained unclear from [1], [9] whether the sample complexity lower bounds for uniform convergence actually transfer to natural learning algorithms in this framework, and in particular, to common gradient-based optimization methods. Indeed, it is well-known that in SCO there exist simple algorithms, such as SGD, that the models they produce actually generalize well with high probability [12], despite these lower bounds. More technically, the construction of [1] relied heavily on the existence of a “peculiar” ERM which does not seem reachable by gradient steps from a data-independent initialization, and it was not at all clear (and in fact, stated as an open problem in [1]) how to adapt the construction so as to pertain to ERMs that could be found by gradient methods.
In an attempt to address this issue, [2] recently studied the population performance of batch Gradient Descent (GD) in SCO, and demonstrated problem instances where it leads (with constant probability) to an approximate ERM that generalizes poorly, unless the number of training examples is dimension-dependent.1 Subsequently, [13] generalized this result to the more general class of batch first-order algorithms. However, due to technical complications, the constructions in these papers were based in part on the earlier arguments of [9] rather than the developments by [1], and therefore fell short of establishing their results in dimension polynomial in the number of training examples. As a consequence, their results are unable to rule out a sample complexity upper bound for GD that depends only (poly-)logarithmically on problem dimension.
In this work, we resolve the open questions posed in both [1] and [2]: Our first main result demonstrates a convex learning problem where GD, unless trained with at least \(\Omega(\sqrt d)\) training examples, outputs a bad ERM with constant probability. This bridges the gap between the results of [1] and actual, concrete learning algorithms (albeit with a slightly weaker rate of \(\Omega(\sqrt d)\), compared to the \(\Omega(d)\) of the latter paper) and greatly improves on the previous \(\Omega(\log{d})\) lower bound of [2], establishing that the sample complexity of batch GD in SCO has a significant, polynomial dependence on the problem dimension.
Furthermore, in our second main result we show how an application of the same construction technique provides a similar improvement in the dimension dependence of the empirical risk lower bound presented in the recent work of [3], thus also resolving the open question left in their work. This work demonstrated that in SCO, well-tuned SGD may underfit the training data despite achieving optimal population risk performance. At a deeper level, the overfitting of GD and underfitting of SGD both stem from a combination of two conditions: lack of algorithmic stability, and failure of uniform convergence; as it turns out, this combination allows for the output models to exhibit a large generalization gap, defined as the difference in absolute value between the empirical and population risks. Our work presents a construction technique for such generalization gap lower bounds that achieves small polynomial dimension dependence, providing for an exponential improvement over previous works.
In some more detail, our main contributions are as follows:
We present a construction of a learning problem in dimension \(d = O(nT+n^2+\eta^2T^2)\) where running GD for \(T\) iterations with step \(\eta\) over a training set of \(n\) i.i.d.-sampled examples leads, with constant probability, to a solution with population error \(\Omega(\eta\sqrt T + 1/\eta T)\). 2 In particular, for the canonical configuration of \(T=n\) and \(\eta = \Theta(1/\sqrt{n})\), the lower bound becomes \(\Omega(1)\) and demonstrates that GD suffers from catastrophic overfitting already in dimension \(d = O(n^2)\). Put differently, this translates to an \(\widetilde{\Omega}(\sqrt{d})\) lower bound the number of training examples required for GD to reach nontrivial test error. See 1 below for a formal statement and further implications of this result.
Furthermore, we give a construction of dimension \(d=\widetilde{O}(n^2)\) where the empirical error of one-pass SGD trained over \(T=n\) training examples is \(\Omega(\eta\sqrt n + 1/\eta n)\). Assuming the standard setting of \(\eta = \Theta(1/\sqrt{n})\), chosen for optimal test performance, the empirical error lower bound becomes \(\Omega(1)\), showing that the “benign underfitting” phenomena of one-pass SGD is exhibited already in dimension polynomial in the number of training samples. Rephrasing this lower bound in terms of the number of training examples required to reach nontrivial empirical risk, we again obtain an \(\widetilde{\Omega} (\sqrt{d})\) sample complexity lower bound. See 2 for the formal statement and further implications.
Both of the results above are tight (up to logarithmic factors) in view of existing matching upper bounds of [14]. We remark that the constructions leading to the results feature differentiable Lipschitz and convex loss functions, whereas the lower bounds in previous works concerned with gradient methods [2], [3], [13] crucially applied only to the class of non-differentiable loss functions. From the perspective of general non-smooth convex optimization, this feature of the results imply that our lower bounds remain valid under any choice of a subgradient oracle of the loss function (as opposed to only claiming that there exists a subgradient oracle under which they apply, like prior results do).
Our work builds primarily on two basic ideas. The first is due to [1], whereby an exponential number (in \(n\)) of approximately orthogonal directions, that represent the potential candidates for a “bad ERM,” are embedded in a \(\Theta(n)\)-dimensional space. The second idea, underlying [2], [3], [13], [14] is to augment the loss function with a highly non-smooth component, that is capable of generating large (sub-)gradients around initialization directed at all candidate directions, that could steer GD towards a bad ERM that overfits the training set.
The major challenge is in making these two components play in tandem: since the candidate directions of [1] are only nearly orthogonal, the progress of GD towards one specific direction gets hampered by its movement in other, irrelevant directions. And indeed, previous work in this context fell short of resolving this incompatibility and instead, opted for a simpler construction with a perfectly-orthogonal set of candidate directions, that was used in the earlier work of [9]. Unfortunately though, this latter construction requires the ambient dimensionality to be exponential in the number of samples \(n\), which is precisely what we aim to avoid.
Our solution for overcoming this obstacle, which we describe in length in 3, is based on several novel ideas. Firstly, we employ multiple copies of the original construction of [1] in orthogonal subspaces, in a way that it suffices for GD to make a single step within each copy so as to reach, across all copies, a bad ERM solution; this serves to circumvent the “collisions” between consecutive GD steps alluded to above. Secondly, we carefully design a convex loss term that, when augmented to the loss function, forces successive gradient steps to be taken in a round-robin fashion between the different copies, so that each subspace indeed sees a single update step through the GD execution. Lastly, we introduce a novel technique that memorizes the full training set by “encoding” it into the iterates in a convex and differentiable manner, so that the GD iterate itself (to which the subgradient oracle has access) contains the information required to “decode” the right movement direction towards a bad ERM. We further show how all of these added loss components can be made differentiable, so as to allow for a differentiable construction overall. A detailed overview of these construction techniques and a virtually complete description of our construction are provided in 3.
Our work belongs to the body of literature on stability and generalization in modern statistical learning theory, pioneered by [9] and the earlier foundational work of [15]. In this line of research, [14], [16] study algorithmic stability of SGD and GD in the smooth and non-smooth (convex) cases, respectively. In the general non-smooth case which we study here, [14] gave an iteration complexity upper bound of \(O(\eta\sqrt T + \ifrac{1}{\eta T} + \ifrac{\eta T}{n})\) test error for \(T\) iterations with step size \(\eta\) over a training set of size \(n\). The more recent work of [2] showed this to be tight up to log-factors in the dimension independent regime, and [13] further extends this result to any optimization algorithm making use of only batch gradients (i.e., gradients of the empirical risk). Even more recently, [17] considers (multi-pass) SGD and GD in a more general SCO model where individual losses may be non-convex (but still convex on average), and prove a sample complexity lower bound for GD showing it learns in a suboptimal rate with any step size and any number of iterations.
With relation to the sample complexity of an (arbitrary) ERM in SCO, [1] showed that reaching \(\epsilon\)-test error requires \(\Omega(\ifrac d\epsilon + \ifrac1{\epsilon^2})\) training samples, but did not establish optimality of this bound. In a recent work, [18] show this to be nearly tight and presents a \(\widetilde{O}(\ifrac d\epsilon + \ifrac1{\epsilon^2})\) upper bound for any ERM, improving over the \(O(\ifrac{d}{\varepsilon^2})\) upper bound that can be derived from standard covering number arguments. Another recent work related to ours is that of [19], who provided another example for a setting in which learnability can be achieved without uniform convergence, showing that uniform convergence may not hold in the class of vector-valued linear (multi-class) predictors. However, the dimension of their problem instance was exponential in the number of training examples.
Another relevant body of research focuses on understanding the effective generalization of over-parameterized models trained to achieve zero training error through gradient methods (see e.g., [20]–[22]). This phenomenon appears to challenge conventional statistical wisdom, which emphasizes the importance of balancing data fit and model complexity, and motivated the study of implicit regularization (or bias) as a notion for explaining generalization in the over-parameterized regimes. Our findings in this paper could be viewed as an indication that, at least in SCO, generalization does not stem from some form of an implicit bias or regularization; see [2], [3] for a more detailed discussion.
We consider the standard setting of Stochastic Convex Optimization (SCO). The problem is characterized by a population distribution \(\mathcal{D}\) over an instance set \(Z\), and loss function \(f : W \times Z \rightarrow \mathbb{R}\) defined over convex domain \(W \subseteq \mathbb{R}^d\) in \(d\)-dimensional Euclidean space. We assume that, for any fixed instance \(z \in Z\), the function \(f(w, z)\) is both convex and \(L\)-Lipschitz with respect to its first argument \(w\). In this setting, the learner is interested in minimizing the population loss (or risk) which corresponds to the expected value of the loss function over \(\mathcal{D}\), defined as \[F(w) = \mathbb{E}_{z \sim \cD}[f(w, z)], \] namely, finding a model \(w \in W\) that achieves an \(\varepsilon\)-optimal population loss, namely such that \(F(w) \leq F(w_*) + \varepsilon,\) where \(w_*\in \argmin_{w\in W} F(w)\) is a population minimizer.
To find such a model \(w\), the learner uses a set of \(n\) training examples \(S = \{z_1, \ldots, z_n\}\), drawn i.i.d.from the unknown distribution \(\mathcal{D}\). Given the sample \(S\), the corresponding empirical loss (or risk), denoted \(\widehat{F}(w)\), is defined as the average loss over samples in \(S\): \[\widehat{F}(w) = \frac{1}{n}\sum_{i=1}^n f(w, z_i). \] We let \(\widehat{w}_*\in \arg\min_{w\in W} \widehat{F}(w)\) denote a minimizer of the empirical risk, refered to as an empirical risk minimizer (ERM). Moreover, for every \(w\in W\), we define the generalization gap at \(w\) as the absolute value of the difference between the population loss and the empirical loss, i.e., \(\abs{ F(w)-\widehat{F}(w) }\).
We consider several canonical first-order optimization algorithms in the context of SCO. First-order algorithms make use of a (deterministic) subgradient oracle that takes as input a pair \((w,z)\) and returns a subgradient \(g(w,z) \in \partial_w f(w,z)\) of the convex loss function \(f(w,z)\) with respect to \(w\). If \(\abs{\partial_w f(w,z)} = 1\), the loss \(f(\cdot,z)\) is differentiable at \(w\) and the subgradient oracle simply returns the gradient at \(w\); otherwise, the subgradient oracle is allowed to emit any subgradient in the subdifferential set \(\partial_w f(w,z)\).
First, we consider standard gradient descent (GD) with a fixed step size \(\eta>0\) applied to the empirical risk \(\smash{\widehat{F}}\). We allow for a potentially projected, \(m\)-suffix averaged version of the algorithm that takes the following form: \[\label{gd95update95rule} \begin{alignedat}{2} &\text{initialize at} & &w_1 \in W ; \\ &\text{update} & \qquad &w_{t+1} = \Pi_W\sbr[3]{ w_t - \frac{\eta}{n}\sum_{i=1}^n g(w_t,z_i) }, \qquad \forall ~ 1 \leq t < T ; \\ &\text{return} & &w_{T,m}\eqq \frac{1}{m}\sum_{i=1}^mw_{T-i+1} . \end{alignedat}\tag{1}\] Here \(\Pi_W:\R^d\to W\) denotes the Euclidean projection onto the set \(W\); when \(W\) is the entire space \(\R^d\), this becomes simply unprojected GD. The algorithm returns either the final iterate, the average of the iterates, or more generally, any \(m\)-suffix average (\(1\leq m\leq T\)) of iterates.
The second method that we analyze is Stochastic Gradient Descent (SGD), which is again potentially projected and/or suffix averaged. This method uses a fixed stepsize \(\eta>0\) and takes the following form: \[\label{sgd95update95rule} \begin{alignedat}{2} &\text{initialize at} & &w_1 \in W ; \\ &\text{update} & \qquad &w_{t+1} = \Pi_W\sbr[1]{ w_t - \eta g(w_t,z_t) }, \qquad \forall ~ 1 \leq t < T ; \\ &\text{return} & &w_{T,m}\eqq \frac{1}{m}\sum_{i=1}^mw_{T-i+1} . \end{alignedat}\tag{2}\]
Our main contributions in the context of SCO are tight lower bounds for the population loss of GD and for the empirical loss of SGD, where the problem dimension is polynomial in the number of samples \(n\) and steps \(T\). First, for the population risk performance of GD, we prove the following:
Theorem 1. Fix \(n>0\), \(T>3200^2\) and \(0\leq \eta\leq \frac{1}{5\sqrt{T}}\) and let \(d=178nT+2n^2+\max\set{1,25\eta^2T^2}\). There exists a distribution \(\mathcal{D}\) over instance set \(Z\) and a convex, differentiable and \(1\)-Lipschitz loss function \(f:\R^d \times Z\to \R\) such that for GD (either projected or unprojected; cf. 1 with \(W=\mathbb{B}^{d}\) or \(W=\R^d\) respectively) initialized at \(w_1=0\) with step size \(\eta\), for all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has, with probability at least \(\frac{1}{6}\) over the choice of the training sample, \[\begin{align} \label{eq95lower95bound95GD} F(w_{T,m}) - F(w_*) = \Omega\br{\min\cbr{ \eta\sqrt{T}+\ifrac{1}{\eta T}, 1 }} . \end{align}\qquad{(1)}\]
For SGD, we prove the following theorem concerning its convergence on the empirical risk:
Theorem 2. Fix \(n>2048\) and \(0\leq \eta\leq \frac{1}{5\sqrt{n}}\) and let \(d=712n\log n+2n^2+\max\set{1,25\eta^2n^2}\). There exists a distribution \(\mathcal{D}\) over instance set \(Z\) and a convex, \(1\)-Lipschitz and differentiable loss function \(f:\R^d \times Z\to \R\) such that for one-pass SGD (either projected or unprojected; cf. 2 with \(W=\mathbb{B}^{d}\) or \(W=\R^d\) respectively) over \(T=n\) steps initialized at \(w_1=0\) with step size \(\eta\), for all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has, with probability at least \(\frac{1}{2}\) over the choice of the training sample, \[\begin{align} \label{eq95lower95bound95sgd} \widehat{F}(w_{T,m}) - \widehat{F}(\widehat{w}_*) = \Omega\br{\min\cbr{ \eta\sqrt{T}+\ifrac{1}{\eta T}, 1 }} . \end{align}\qquad{(2)}\]
As noted in the introduction, both of the bounds above are tight up to logarithmic factors in view of matching upper bounds due to [14]. For GD tuned for optimal convergence on the empirical risk, where \(T=n\) and \(\eta = \Theta(1/\sqrt{n})\), 1 gives an \(\Omega(1)\) lower bound for the population error, which precludes any sample complexity upper bound for this algorithm of the form \(O(d^p/\epsilon^q)\) unless \(p \geq \tfrac12\). In particular, this implies an \(\Omega(\sqrt{d})\) lower bound the number of training examples required for GD to reach a nontrivial population risk. In contrast, lower bounds in previous work [2] only implies an exponentially weaker \(\Omega(\log{d})\) dimension dependence in the sample complexity. We note however that there is still a small polynomial gap between our sample complexity lower bounds to the known (nearly tight) bounds for generic ERMs [1], [18]; we leave narrowing this gap as an open problem for future investigation.
More generally, with GD fixed to perform \(T = n^{\alpha}, \alpha>0\) steps, and setting \(\eta\) so as to optimize the lower bound, the right-hand side in ?? becomes \(\Theta(n^{-\ifrac{\alpha}{4}})\), which rules out any sample complexity upper bound of the form \(O(d^p/\epsilon^q)\) unless it satisfies \(\max\{2,\alpha+1\} p + \tfrac14 \alpha q \geq 1\).3 Specifically, we see that any dimension-free upper bound with \(T=n\) must have at least an \(1/\epsilon^4\) dependence on \(\epsilon\); and that for matching the statistically optimal sample complexity rate of \(1/\epsilon^2\), one must either run GD for \(T=n^2\) steps or suffer a polynomial dimension dependence in the rate (e.g., for \(T=n\) this dependence is at least \(d^{1/4}\)).
Similar lower bounds (up to a logarithmic factor) are obtained for SGD through 2, but for the empirical risk of the algorithm when tuned for optimal performance on the population risk with \(T=n\). In this case, the bounds provide an exponential improvement in the dimension dependence over the recent results of [3], showing that the “benign underfitting” phenomena they revealed for one-pass SGD is exhibited already in dimension polynomial in the number of training samples.
Finally, we remark that our restriction on \(\eta\) is only meant for placing focus on the more common and interesting range of stepsizes in the context of stochastic optimization. It is not hard to extend the result of 1 2 to larger values of \(\eta\) (in this case the lower bounds are \(\Omega(1)\), the same rate the theorems give for \(\eta=\Theta(1/\sqrt{T})\)), in the same way this is done in previous work (e.g., [2], [3]).
In this section we outline the main ideas leading to our main results and give an overview of the lower bound constructions. As discussed above, the main technical contribution of this paper is in establishing the first \(\Omega(\eta\sqrt{T})\) term in ?? ?? using a loss function in dimension polynomial in \(n\) and \(T\), and this is also the focus of our presentation in this section. In [prelim] [sec:make_unif_reach] [setup_encode] [sec_sktch_stab] we focus on GD and describe the main ideas and technical steps towards proving our first main result; in 3.6 we survey the additional steps and adjustments needed to obtain our second main result concerning SGD.
Starting with GD and 1, recall that our goal is to establish a learning scenario where GD is likely to converge to a “bad ERM”, namely a minimizer of the empirical risk whose population loss is large. We will do that in four steps: we will first establish that such a “bad ERM” actually exists; then, we will show how to make such a solution reachable by gradient steps from the origin; we next describe how the information required to identify this solution can be “memorized” by GD into its iterates; and finally, we show how to combine these components and actually drive GD towards a bad ERM.
Our starting point is the work of [1] that demonstrated that in SCO, an empirical risk minimizer might fail to generalize, already in dimension linear in the number of training samples. More concretely, they showed that for any sample size \(n\), there exists a distribution \(\mathcal{D}\) over convex loss functions in dimension \(d=\Theta(n)\) such that, with constant probability, there exists a “bad ERM”: one that overfits the training sample and admits a large generalization gap.
Their approach was based on a construction of a set of unit vectors of size \(2^{\Omega(n)}\), denoted \(U\), that are “nearly orthogonal”: the dot product between any two distinct \(u, v \in U\) satisfies \(|\langle u,v\rangle| \leq \frac{1}{8}\).4 Then, they take the power set \(Z = P(U)\) of \(U\) as the sample space (namely, identifying samples with subsets of \(U\)), the distribution \(\mathcal{D}\) to be uniform over \(Z\), and the (convex, Lipschitz) loss \(h_{\text{F16}}: \R^{\Theta(n)} \times Z \to \R\) to be defined as follows: \[\label{feldman95func} h_{\text{F16}}(w,V) = \max\cbr[2]{ \tfrac{1}{2},\max_{u\in V} \langle u,w\rangle }.\tag{3}\] For this problem instance, they show that with constant probability over the choice of a sample \(S=\{V_1,\ldots,V_n\} \mathop{\smash[t]{\overset{\mathrm{iid}}{\sim}}}\mathcal{D}^n\) of size \(n=O(d)\), at least one of the vectors in \(U\), say \(u_0 \in U\), will not be observed in any of the sets \(V_1,\ldots,V_n\), namely \(u_0 \in U \setminus \bigcup_{i=1}^n V_i\). Finally, they prove that such a vector \(u_0\) is in fact an \(\Omega(1)\)-bad ERM (for which the generalization gap is \(\Omega(1)\)).
To see why this is the case, note that, since every vector \(u\in U\) is in every training example \(V_i\) with probability \(\frac{1}{2}\), the set \(U\) (whose size is exponential in \(n\)) is large enough to guarantee the existence of a vector \(u_0 \notin \bigcup_{i=1}^n V_i\) with constant probability. Consequently, the empirical loss of such \(u_0\) equals \(\frac{1}{2}\) (since \(\abr{u_0,v} \leq \tfrac18\) for any \(v \in V_i\) and therefore \(h_{\text{F16}}(u_0,V_i)=\tfrac12\) for all \(i\)). However, for a fresh example \(V \sim \mathcal{D}\), with probability \(\tfrac12\) it holds that \(u_0\in V\), and therefore \(h_{\text{F16}}(u_0,V)=1\), in which case the population risk of \(u_0\) is at least \(=\frac{1}{2}\cdot\frac{1}{2}+\frac{1}{2}\cdot \frac{1}{2}=\frac{3}{4}\) and the generalization gap is therefore at least \(\tfrac14\).
As [1] explains in their work, although there exists an ERM with a large generalization gap, it is not guaranteed that such a minimizer is at all reachable by gradient methods, within a reasonable (say, polynomial in \(n\)) number of steps. This is because in their construction, the loss function \(h_{\text{F16}}\) remains flat (and equals \(\tfrac12\), see 3 ) inside a ball of radius \(\Omega(1)\) around the origin, where GD is initialized; within this ball, all models are essentially “good ERMs” that admit zero generalization gap. It remains unclear how to steer GD, with stepsize of order \(\eta = O(1/\sqrt{T})\) over \(T\) steps, away from this flat region of the loss towards a bad ERM, such as the \(u_0\) identified above.
To address this challenge, we modify the construction of [1] in a fundamental way. The key idea is increase dimensionality and replicate [1]’s construction in \(T\) orthogonal subspaces; this would allow us to decrease, in each of the subspaces, the distance to a bad ERM to only \(O(\eta)\), rather than \(\Theta(1)\) as before. Then, while each of these subspace ERMs is only \(\Omega(\eta)\)-bad, when taken together, they constitute an \(\Omega(1)\)-bad ERM in the lifted space whose distance from the origin is roughly \(\eta \sqrt{T} = \Theta(1)\), yet is still reachable by \(T\) steps of GD.
More concretely, we introduce a loss function \(h:\R^{d'}\times P(U)\to\R\) (for \(d'=\Theta(n)\)) that resembles [1]’s function from 3 up to a minor adjustment: \[\label{our95feldman} h(w',V) = \max\cbr[2]{ \tfrac{3}{32}\eta , \max_{u\in V} \abr[1]{u , w'} } .\tag{4}\] As in the original construction by [1], \(V\) here ranges over subsets of a set \(U \subseteq \R^{d'}\) of size \(2^{\Omega(d')}\), the elements of which are nearly-orthogonal unit vectors. Then, we construct a loss function in dimension \(d = Td'\) by applying \(h\) in \(T\) orthogonal subspaces of dimension \(d'\), denoted \({W}^{(1)},\ldots,{W}^{(T)}\), as follows:5 \[\label{uniform95convergence95objective} \ell_1(w,V) = \sqrt{\sum_{k=2}^{T} \br[2]{ h({w}^{(k)},V) }^2 } ~.\tag{5}\] Here and throughout, \({w}^{(k)}\) refers to the \(k\)’th orthogonal component of the vector \(w\), that resides in the subspace \(W^{(k)}\). Finally, the distribution \(\mathcal{D}\) is again taken to be uniform over \(Z = P(U)\), and a training set is formed by sampling \(S=\{V_1,\ldots,V_n\}\sim \cD^n\). As before, we know that with probability at least \(\frac{1}{2}\), there exists a vector \(u_0\) such that \(u_0 \in U \setminus \bigcup_{i=1}^n V_i\).
With this setup, it can be shown that \(\ell_1\) is indeed convex and \(O(1)\)-Lipschitz, and further, that any vector \(w\) satisfying \({w}^{(k)} = c\eta u_0\) for a sufficiently large constant \(c>0\) and \(\Omega(T)\)-many components \(k\), is an \(\Omega(1)\)-bad ERM with respect to \(\ell_1\). The important point is that, unlike in [1]’s original construction, such bad ERMs are potentially reachable by GD: it is sufficient to guide the algorithm to make a single, small step (with stepsize \(\eta\)) towards \(u_0\) in each subspace \({W}^{(k)}\).
There is one notable obstacle to the plan we just described: the vector \(u_0\) is determined in a rather complex way by the full description of the training set and it is unclear how to reproduce such a vector through subgradients of the loss function. Indeed, recall that the only access GD has to the training set is through subgradients of individual functions \(g(w, V_1), \ldots, g(w, V_n)\) (and linear combinations thereof), and none of these has direct access to the full training set that could allow for determining a vector \(u_0 \in U \setminus \bigcup_{i=1}^n V_i\).
To circumvent this difficulty, another key aspect of our construction involves a mechanism that effectively memorizes the full training set in the iterate \(w\) itself, using the first few steps of GD. For this memorization, we can, for example, further increase the dimension of the domain \(W\) and create an “encoding subspace,” denoted as \({W}^{(0)}\) (and the corresponding component of a vector \(w \in W\) is indicated by \({w}^{({0})}\)), which is orthogonal to \({W}^{(1)}, \ldots, {W}^{(T)}\). In this subspace, each step taken with respect to (a linear combination of) individual gradients \(g(w_t, V_i)\) encodes the information on the sets \(V_1,\ldots,V_n\) into the iterate \(w_t\). Then, since the subgradient oracle receives \(w_t\) as input, it can reconstruct the training set encoded in \({w_t}^{(0)}\) and recover \(u_0\), in every subsequent step.
On its own, the task of memorizing the training set is not particularly challenging and can be addressed in a rather straightforward manner.6 What turns out to be more challenging is to design the encoding in such a way that \(u_0\) is realized as the unique subgradient (i.e., the gradient) of the loss function. This would be crucial for establishing that our lower bound is valid for any subgradient oracle, and not only for an adversarially chosen one (as well for making the construction differentiable; we discuss this later on, in 3.5).
Let us describe an encoding mechanism where \(u_0\) acts as the unique subgradient at \(w_1=0\). We will employ an encoding subspace \({W}^{(0)}\) of dimension \(\Theta(n^2)\), and augment samples with a number \(j \in [n^2]\), drawn uniformly at random; namely, each sample in the training set is now a pair \((V_i, j_i) \in P(U) \times [n^2]\), for \(i=1,\ldots,n\). We then create an encoding function \(\phi : P(U)\times[n^2]\to {W}^{(0)}\) such that \(\phi(V,j)\) maps the set \(V\) into the \(j\)’th (\(2\)-dimensional) subspace of the encoding space. The role of \(j\) is to ensure that, with constant probability, sets in the training sample are mapped to distinct subspaces of the encoding space \({W}^{(0)}\), and thus can be uniquely inferred given the encoding. To implement the encoding within the optimization process, we introduce the following term into the loss: \[\label{endcoding95term95gd} \ell_2(w,(V,j)) \eqq \langle -\phi(V,j),{w}^{({{0}})}\rangle .\tag{6}\] Following a single step of GD, the iterate becomes \({w_2}^{(0)}=\frac{\eta}{n}\sum_{i=1}^n \phi(V_i,j_i)\), and by the properties of the encoding \(\phi\) it is then possible, with constant probability, to fully recover the sets \(V_1, \ldots, V_n\) in the training set, given the iterate \(w_2\) .
Next, we introduce an additional term into the loss function, whose role is to “decode” the training set \(V_1, \ldots, V_n\) from \(w_t\) and produce a vector \(u_0\in U\setminus\bigcup_{i=1}^nV_i\) as a subgradient. For this, we represent every potential training set using a vector \(\psi\in \Psi\subseteq \mathbb{B}^{2n^2}\), and define a mapping \(\alpha: \R^{2n^2}\to U\) that, for every \(\psi\in\Psi\), provides a vector \(\alpha(\psi) \in U\) that does not appear in any of the sets \(V_i\) in the training sample associated with \(\psi\) (if such a vector exists). Finally, we add the following term to the loss function, \[\label{decoding95term95gd} \ell_3(w) \eqq \max\cbr{ \delta_1,\max_{\psi\in \Psi} \cbr{ \langle \psi,{w}^{({{0}})}\rangle - \beta\langle \alpha(\psi), {w}^{(1)}\rangle } } ,\tag{7}\] where \(\beta,\delta_1>0\) are small predefined constants. We can show, assuming that in the first step, the training set was encoded to the iterate (\({w_2}^{(0)}=\frac{\eta}{n}\sum_{i=1}^n \phi(V_i,j_i)\)), that for a suitable choice of the encoder (\(\phi\)) and decoder (\(\psi\) and \(\alpha\)), in the following iteration, the vector \(\psi^*\in\Psi\) that represents the actual training set \(V_1, \ldots, V_n\) is realized as a unique maximizer in 7 , which in turn triggers a gradient step along \(u_0 \eqq \alpha(\psi)\) in the subspace \(W^{(1)}\).
Our final task is to finally make GD converge to a “bad ERM,” namely to a model \(w\) such that \({w}^{(k)} = c\eta u_0\) for a sufficiently large constant \(c>0\) and \(\Omega(T)\)-many values of \(k\), assuming it was successfully initialized at \(w\) with \({w}^{(1)}=c_1u_0\) (and \({w}^{(k)}=0\) for \(k>1\)) as we just detailed. We will accomplish this by forcing GD into making a single step towards \(u_0\) in \(\Omega(T)\) of the subspaces \({W}^{(1)}, \ldots, {W}^{(T)}\).
To this end, we employ a variation of a technique used in previous lower bound constructions [2], [3], [14] to induce gradient instability around the origin. In these prior instances, however, the potential directions of progress—analogous to vectors in our set \(U\)—were perfectly orthogonal (and thus, the dimension of space was required to be exponential in \(n\)). In contrast, in our scenario the vectors in \(U\) are only approximately orthogonal, and directly applying this approach could lead to situations where gradient steps from consecutive iterations may interfere with progress made in correlated directions in previous iterations.
To address this, we introduce a careful variation on this technique, based on augmenting the loss function with the following convex term: \[\label{stability95term95GD} \ell_4(w) = \max\cbr{ \delta_2,\max_{u \in U,\, k< T} \cbr{ \tfrac{3}{8}\langle u,{w}^{(k)}\rangle - \tfrac{1}{2}\langle u,{w}^{(k+1)}\rangle }} ,\tag{8}\] where \(\delta_2>0\) is a small constant (that will be set later). The key idea here is that following the initialization stage, the inner maximization above is always attained at the same vector \(u=u_0\), and for values of \(k\) that increase by \(1\) in every iteration of GD. Consequently, subgradient steps with respect to this term will result in making a step towards \(u_0\) in each of the components \({w}^{(1)}, {w}^{(2)}, \ldots\) one by one, avoiding interference between consecutive steps. At the end of this process, there are \(\Omega(T)\) values of \(k\) such that \({w}^{(k)} = \tfrac{1}{8}\eta u_0\), which is what we set to achieve.
In some more detail, assuming GD is successfully initialized at a vector \(w\) with \({w}^{(1)}=c_1u_0\) and \({w}^{(k)}=0\) for \(k>1\) (\(c_1 >0\) is a small constant), note that the maximum in 8 is uniquely attained at \(k=1\) and \(u=u_0\). Consequently, the subgradient of \(\ell_4\) at initialization is a vector \(g\) such that \({g}^{(1)}=\frac{3}{8}u_0\), \({g}^{(2)}=-\frac{1}{2}u_0\) (and \({g}^{(k)}=0\) for \(k\neq 1,2\)), and taking a subgradient step with stepsize \(\eta\) results in \({w}^{(1)} = \br[0]{\eta\beta-\frac{3\eta}{8}} u_0\) and \({w}^{(2)}=\frac{\eta}{2}u_0\) (for \(k\neq 1,2\), \({w}^{(k)}\) remains as is). In each subsequent iteration, the maximization in 8 is attained at an index \(k\) for which \({w}^{(k)}=\frac{\eta}{2}u_0\) and at \(u=u_0\).7 Subsequently, every gradient step adds \(-\frac{3\eta}{8}u_0\) to \({w}^{(k)}\) and \(\frac{\eta}{2}u_0\) to \({w}^{(k+1)}\) and results in \({w}^{(2)} = {w}^{(3)} = \ldots = {w}^{(k)} = \frac{\eta}{8}u_0\) and \({w}^{(k+1)}=\frac{\eta}{2}u_0\) (whereas for all \(s>k+1\), \({w}^{(s)}\) remains zero).
Finally, we note that the GD dynamics we described ensure that the iterates \(w_1,\ldots,w_T\) remain strictly within the unit ball \(\mathbb{B}^{d}\), even when the algorithm does not employ any projections. As a consequence, the construction we described applies equally to a projected version of GD, with projections to the unit ball, and the resulting lower bound will apply to both versions of the algorithm.
We can now integrate the ideas described in [prelim] [sec:make_unif_reach] [setup_encode] [sec_sktch_stab] into a construction of a learning problem where GD overfits the training data (with constant probability), that would serve to prove our lower bound for gradient decent. To summarize this construction:
The examples in the learning problem are parameterized by pairs \((V,j) \in Z \eqq P(U) \times [n^2]\), where \(U\) is the set of nearly-orthogonal vectors described in 3.1, and \(P(U)\) is its power set;
The population distribution \(\mathcal{D}\) is uniform over pairs \((V,j) \in Z\), namely such that \(V \sim \Unif(P(U))\) (i.e., \(V\) is formed by including every element \(u\in U\) independently with probability \(\tfrac{1}{2}\)) and \(j \sim \Unif([n^2\)]);
The loss function in this construction, \(f: W \times (P(U)\times [n^2])\to \R\), is then given by: \[\begin{align} \label{loss95def95gd95in95setup95nondiff} \forall ~ (V,j)\in Z , \qquad f(w, (V,j)) &\eqq \ell_{1}(w, V) + \ell_{2}(w, (V,j))+ \ell_{3}(w)+ \ell_{4}(w) , \end{align}\tag{9}\] with the terms \(\ell_{1},\ell_{2},\ell_{3},\ell_{4}\) as defined in 5 6 7 8 respectively.
With a suitable choice of parameters, this construction serves to proving 1. We remark that, while \(f\) in this construction is convex and \(O(1)\)-Lipschitz, it is evidently non-differentiable. For obtaining a construction with a differentiable objective that maintains the same lower bound and establish the full claim of 1, we add one final step of randomized smoothing of the objective. This argument hinges on the fact that the subgradients of \(f\) are unique along any possible trajectory of GD, so that smoothing in a sufficiently small neighborhood would preserve gradients along any such trajectory (and thus does not affect the the dynamics of GD), while making the objective differentiable everywhere. The full proof of 1 is deferred to 6.
Moving on to discuss our second main result for SGD, we provide here a brief overview of the necessary modifications upon the construction for GD to establish the lower bound for SGD in 2; further details can be found in 5. In the case of SGD, our goal is to establish underfitting: namely, to show that the algorithm may converge to a solution with an excessively large empirical risk despite successfully converging on the population risk.
The main ideas leading to our construction for SGD are similar to what we discussed above, but there are several necessary modifications that arise from the fact that, whereas in GD the entire training set is revealed already in the first iteration, in SGD it is revealed sequentially, one training sample at a time. In particular, unlike in the case of GD where it is possible to identify a bad ERM \(u_0\) at the few first steps of the algorithm and steer the algorithm in this direction in every subspace \({W}^{(1)}, {W}^{(2)}, \ldots\), for SGD the required progress direction in \({W}^{(t)},\) represented as a “bad solution” \(u_t\), can be only determined in the \(t\)’th step based on the encoded training set up to that point, \(V_1, \ldots, V_{t-1}\). As a result, it is crucial to modify the loss function such that the process of decoding such \(u_t\) from \(V_1, \ldots, V_{t-1}\) occurs in every iteration \(t\).
Another essential adjustment involves identifying a solution with a large generalization gap (namely large empirical risk, low population risk) and guiding the SGD iterates to converge to such a solution. Considering the function \(\ell_1\) defined in 5 , such a solution is represented by a vector \(u\in U\) that appears in all of the sets \(V_1,\ldots,V_n\) in the training sample. However, since \(u_t\) cannot depend on future examples, our goal within every subspace \({W}^{(t)}\) is to take a single gradient step towards a vector \(u_t\) present only in sets up to that point, namely in \(\bigcap_{i=1}^{t-1} V_i\) (note that such \(u_t\) maximizes the corresponding loss functions \(\ell_1(w,V_1)\ldots \ell_1(w,V_{t-1})\)). Additionally, to ensure that gradients for future loss functions remain zero and do not affect the algorithm’s dynamics, it is necessary to to guarantee that \(u_t \in \bigcap_{i=t}^n \overline{V}_i\); in other words, we are looking for a solution \(u_t \in \bigcap_{i=1}^{t-1} V_i \cap \bigcap_{i=t}^n \overline{V}_i\). For ensuring that such a vector actually exists (with constant probability), we lift the dimension of the set \(U\) and the subspaces \(\{{W}^{(k)}\}_{k=1}^{n}\) to \(d=\Theta(n\log n)\) (instead of \(\Theta(n)\) as before) and modify the distribution \(\mathcal{D}\) so as to have that \(V\) is sampled such that every element \(u\in U\) is included in \(V\) independently with probability \(\ifrac{1}{4n^2}\).
With these adaptations in place, we can obtain 2; for more details we refer to 5.
In this section, we provide a formal proof of our main result for GD. We establish a lower bound of \(\Omega\br[0]{\eta \sqrt{T}}\) for the population loss of GD, where the hard loss function is defined in a \(d\)-dimensional Euclidean space, where the dimension \(d\) is polynomial in the number of examples \(n\). In 6 we complete the proof of 1, by showing a lower bound of \(\min\cbr[0]{ \ifrac{1}{\eta T},1 }\), and a construction of a differentiable objective that holds the lower bound stated in 1.
For the first step, for a dimension \(d'\) that will be set later, we use a set of approximately orthogonal vectors in \(\R^{d'}\) with size (at least) exponential in \(d'\), the existence of which is given by the following lemma, adapted from [1].
Lemma 1. For any \(d' \geq 256\), there exists a set \(U_{d'} \subseteq \R^{d'}\), with \(|U_{d'}| \geq 2^{d'/178}\), such that for all \(u, v\in U_{d'}, u\neq v\), it holds that \(|\abr{u, v}|\leq \frac{1}{8}\).
Now, let \(n\) be the number of examples in the training set. We define the set \(U\eqq U_{d'}\) to be a set as specified by 1 for \(d'=178n\). Then, as outlined in 3, we define the sample space \(Z\eqq \{(V,j): V\subseteq U, j\in[n^2]\}\) and the hard distribution \(\mathcal{D}\) as the uniform distribution.
Moreover, we consider the loss function \(f:\R^d\to \R\) (defined in 9 for \(d\eqq Td'+2n^2=178nT+2n^2\). This loss function is convex and \(5\)-Lipschitz over \(\R^d\), as established in the following lemma:
Lemma 2. For every \((V,j) \in Z\), the loss function \(f(w,(V,j))\) is convex and \(5\)-Lipschitz over \(\R^d\) with respect to its first argument.
For this construction of distribution and loss function, we obtain the following theorem.
Theorem 3. Assume that \(n>0\), \(T>3200^2\) and \(\eta\leq\frac{1}{\sqrt{T}}\). Consider the distribution \(\mathcal{D}\) and the loss function \(f\) that defined in 3.5 for \(d=178nT+2n^2\), \(\varepsilon = \frac{1}{n^2} \br[0]{1-\cos\br[0]{\frac{2\pi}{|P(U)|}}}\), \(\beta=\frac{\epsilon}{4T^2}\), \(\delta_1=\frac{\eta}{2n}\) and \(\delta_2=\frac{3\eta\beta}{16}\). Then, for Unprojected GD (cf. 1 with \(W=\R^d\)) on \(\widehat{F}\), initialized at \(w_1=0\) with step size \(\eta\), we have, with probability at least \(\frac{1}{6}\) over the choice of the training sample:
The iterates of GD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,T\);
For all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has: \[F(w_{T,m}) - F(w_*) = \Omega\br[1]{\eta\sqrt{T}} .\]
We next give a key lemma that characterizes the trajectory of GD when applied to the empirical risk \(\widehat{F}\) formed by the loss function \(f\) and the training sample \(S=\{(V_i,j_i)\}_{i=1}^n\). The characterization holds under a certain “good event”, given as follows: \[\begin{align} \label{good95event95gd} \cE \eqq \cbr[1]{ \bigcup\nolimits_{i=1}^n V_i\neq U } \cap \cbr[1]{ j_k\neq j_l,\; \forall k\neq l }. \end{align}\tag{10}\] In words, under the event \(\cE\) there exists at least one “bad direction” (which is a vector in the set \(U \setminus \bigcup\nolimits_{i=1}^n V_i\)) and there is no collision between the indices \(j_1,\ldots,j_n\). In the following lemma we show that \(\cE\) holds with a constant probability. The proof is deferred to 7.2.
Lemma 3. For the event \(\cE\) defined in 10 , it holds that \(\Pr(\cE) \geq \frac{1}{6}\).
Under this event, the dynamics of GD are characterized as follows.
Lemma 4. Assume the conditions of 3, and consider the iterates of unprojected GD on \(\widehat{F}\), with step size \(\eta \leq \ifrac{1}{\sqrt{T}}\) initialized at \(w_1=0\). Under the event \(\cE\), we have for all \(t\geq 5\) that \[\begin{align} \label{eq:gd95exp} {w_t}^{(k)} = \begin{cases} \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k=\text{{0}} ; \\ \br[1]{-\tfrac{3}{8} + \frac{t-2}{4}\frac{\epsilon}{T^2} } \eta u_{0} &\quad k=1 ; \\ \frac{1}{8}\eta u_{0} &\quad 2\leq k\leq t-3 ; \\ \frac{1}{2}\eta u_{0} &\quad k=t-2 ; \\ 0 &\quad t-1\leq k\leq T , \end{cases} \end{align}\qquad{(3)}\] where \(u_0\) is a vector such that \(u_0\in U \setminus \bigcup_{i=1}^n V_i\).
To prove 4, we break down to the different components of the loss and analyze how the terms \(\ell_1,\ell_3\) and \(\ell_4\) affects the dynamics of \(GD\) under the event \(\cE\). For each of these components, which involve maximum over linear functions, we show which term achieves the maximum value for each \(w_t\) and derive the expressions for the gradients at those points by the maximizing terms. First, we show that under this event, the gradients of \(\ell_1\) do not affect the dynamics since in any iteration \(t\) the gradient of \(\ell_1\) is zero, as stated in the following lemma. The proof is deferred to 7.
Lemma 5. Assume the conditions of 3 and the event \(\cE\). Let \(w\in \R^d\) be such that for every \(2\leq k\leq T\), \({w}^{(k)}=c\eta u_0\) for \(c\leq \frac{1}{2}\) and \(u_0\in U\setminus \bigcup_{i=1}^n V_i\). Then, for every \(i\), it holds that
for every \(k\geq2\), it holds \(\max_{u\in V_i} \langle {w}^{(k)}, u_0 \rangle\leq \frac{\eta}{16};\)
\(\ell_1\) is differentiable at \(w\) and for all \(i \in [n]\), we have \(\nabla\ell_1(w,V_i)=0.\)
Next, for the term \(\ell_3\), as outlined in 3.3, it is used for identifying the actual training set \(S=\{(V_i,j_i)\}_{i=1}^n\) given an encoding \(\psi^*=\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i)\) in the iterate \({w_t}^{({0})}\) and ensuring a performance of gradient step in \({W}^{(1)}\) towards a corresponding vector \(u_0\in U\setminus \bigcup_{i=1}^n V_i\) in the following iteration. It is done by getting \(\psi^*\) as a maximum of linear functions (with positive constant margin) over the set \(\Psi\) which contains all possible encoded datasets. This idea is formalized in the following lemma.
Lemma 6. Assume the conditions of 3 and the event \(\cE\). Let \(\psi^*=\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i)\) and \(w \in \R^d\) be such \({w}^{({{0}})}=\eta\psi^*\), and let \({w}^{(1)}=c\eta u_0\) for \(|c|\leq 1\) and \(u_0\in U\setminus \bigcup_{i=1}^n V_i\). Then
For every \(\psi\in\Psi\), \(\psi\neq \psi^*\): \[\begin{align} \langle{w}^{({{0}})}, \psi^*\rangle - \tfrac{\epsilon}{4T^2}\langle \alpha(\psi^*), {w}^{(1)}\rangle > \langle{w}^{({{0}})}, \psi\rangle - \tfrac{\epsilon}{4T^2}\langle \alpha(\psi), {w}^{(1)}\rangle + \tfrac{\eta\epsilon}{4} ; \end{align}\]
For \(\psi = \psi^*\), it holds that \[\begin{align} \langle{w}^{({{0}})}, \psi^*\rangle - \tfrac{\epsilon}{4T^2}\langle \alpha(\psi^*), {w}^{(1)}\rangle > \delta_1 + \tfrac{\eta}{16n}; \end{align}\]
\(\ell_3\) is differentiable at \(w\) and the gradient is given as follows: \[\begin{align} {(\nabla \ell_{3}(w))}^{(k)}=\begin{cases} \psi^* &\quad k={0};\\ - \tfrac{\epsilon}{4T^2}u_0 &\quad k=1;\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
Finally, for \(\ell_4\), as detailed in 3.4, the role of this term is to make the last iterate \(w_T\) hold \({w_T}^{(k)}=\frac{\eta}{8}\eta u_0\) for \(\Omega(T)\) many sub-spaces \({W}^{(k)}\). In the following lemma, we show that in every iteration \(t\), every gradient step increases the amount of such \(k\)s by \(1\), namely, in every iteration \(t\), the maximum of \(\ell_4\) is attained at \(u=u_0\) and index \(k_t=\arg\max\{k: {w_t}^{(k)}\neq 0\}\), which increases by 1 in every iteration, making the \({w_{t+1}}^{(k_t)}=\frac{\eta}{8}\eta u_0\).
Lemma 7. Assume the conditions of 3 and the event \(\cE\). Let \(w\in \R^d\), \(u_0\in U\setminus \bigcup_{i=1}^n V_i\) and \(3\leq m < T\) be such that \({w}^{(1)}=c\eta u_0\) for \(-\frac{3}{8}\leq c\leq 0\), \({w}^{(k)}=\frac{\eta}{8}u_0\) for every \(2\leq k\leq m-1\), \({w}^{(k)}=\frac{\eta}{2}u_0\) and \({w}^{(k)}=0\) for every \(k\geq m\). Then, it holds that,
For every pair \(u\in U\) and \(k<T\) such that \(k\neq m\) or \(u\neq u_0\), \[\begin{align} \tfrac{3}{8}\langle u_0,{w}^{(m)}\rangle - \tfrac{1}{2}\langle u_0,{w}^{(m+1)}\rangle > \tfrac{3}{8}\langle u,{w}^{(k)}\rangle - \tfrac{1}{2}\langle u,{w}^{(k+1)}\rangle + \tfrac{\eta}{64} \end{align}\]
\[\begin{align} \tfrac{3}{8}\langle u_0,{w}^{(m)}\rangle - \tfrac{1}{2}\langle u_0,{w}^{(m+1)}\rangle > \delta_2+\tfrac{\eta}{64}. \end{align}\]
\(\ell_4\) is differentiable at \(w\) and the gradient is given as follows:\[\begin{align} {\br[1]{\nabla \ell_{4}(w)}}^{(k)}=\begin{cases} \frac{3}{8}u_0 &\quad k=m;\\ -\frac{1}{2}u_0 &\quad k=m+1;\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
of 4. We prove the lemma by induction on \(t\); the base case, for \(t=5\), is proved in 21 in 7 and here we focus on the induction step. For this, fix any \(t \geq 5\) and assume the that the lemma holds for \(w_t\); we will prove the claim for \(w_{t+1}\).
First, for \(\ell_1\), note that, by the hypothesis of the induction, for every \(2\leq k\leq T\), \({w_t}^{(k)}=c\eta u_0\) for \(c\leq\frac{1}{2}\), thus, by 5, for every \(i\), \(\nabla \ell_{1}(w_t,V_i)=0\).
For \(\ell_2\), we know that, for every \(i\), \[\begin{align} {\br[1]{\nabla \ell_{2}(w_t,(V_i,j_i))}}^{(k)}=\begin{cases} - \phi(V_i,j_{i}) &\quad k={0};\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] For \(\ell_{3}\), using the hypothesis of the induction, which implies that \({w_t}^{(1)}=c\eta u_0\) for \(|c|\leq1\) and \({w_{t}}^{({{0}})}=\frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i)\), by 6, we get that, \[\begin{align} {\br[1]{\nabla \ell_{3}(w_t)}}^{(k)}=\begin{cases} \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i}) &\quad k={0};\\ -\frac{\epsilon}{4T^2}u_0 &\quad k=1;\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] For \(\ell_4\), by the hypothesis of the induction we know that \({w_t}^{(1)}=\br[1]{-\frac{3}{8}+\frac{(t-2)}{4}\frac{\epsilon}{T^2}}\eta u_0\), thus, \({w_t}^{(1)}=c\eta u_0\) for \(-\frac{3}{8}c\leq 0\). Then the conditions of 7 hold for \(m=t-2\), thus, it holds that, \[\begin{align} {\br[1]{\nabla \ell_4(w_{t})}}^{(k)} = \begin{cases} \frac{3}{8}u_0 &\quad k=t-2;\\ -\frac{1}{2}u_0 &\quad k=t-1;\\ 0 &\quad \text{otherwise} .\end{cases} \end{align}\] Combining all together, we get that, \[\begin{align} {\br[1]{\nabla \widehat{F}(w_t)}}^{(k)}=\begin{cases} -\frac{\epsilon}{4T^2} u_{0} &\quad k=1;\\ \frac{3}{8} u_{0} &\quad k=t-2; \\ -\frac{1}{2} u_{0} &\quad k=t-1; \\ 0 &\quad \text{otherwise}, \end{cases} \end{align}\] where \(u_0\in U \setminus \bigcup_{i=1}^n V_i\), and the lemma follows. ◻
Now we can turn to prove 3. Here we prove the lower bound for the case of suffix averaging with \(m=1\), namely, when the output solution is the final iterate \(w_T\) of GD; the full proof for the more general case can be found in 7.3.
of 3 (\(m=1\) case). We prove the theorem under the condition that \(\cE\) occurs. First, in 22 in appendix 7 we know that for every \(t\), we have that \(\|w_t\|\leq 1\).
Next, \(w_T\) is as in ?? . Now, we notice that if a vector \(v\in U\) is in a set \(V\subseteq U\), it holds that \(\max_{u\in V} \langle u, v\rangle=1\). However, if \(v\notin V\), it holds that \(\max_{u\in V} \langle u,v\rangle=\frac{1}{8}\). As a result, by the fact that every vector for a fresh pair \((V,j)\sim D\), \(u_0\in U\) is in \(V\) with probability \(\frac{1}{2}\), the following holds: \[\begin{align} \E_V\sqrt{\sum_{k=2}^T\max\cbr{ \frac{3\eta}{32}, \max_{u\in V} \langle u,{w_T}^{(k)}\rangle }^2} &\geq \E_V\sqrt{\sum_{k=2}^{T-3}\max\cbr{ \frac{3\eta}{32}, \max_{u\in V} \langle u,{w_T}^{(k)}\rangle }^2} \\&= \E_V\sqrt{(T-4)\max\cbr{ \frac{3\eta}{32}, \max_{u\in V} \langle u, \frac{\eta}{8}u_{0}\rangle }^2} \\&= \frac{\eta\sqrt{T-4}}{8}\E_V\max\cbr{ \frac{3}{4}, \max_{u\in V} \langle u, u_{0}\rangle } \\&\geq \frac{\eta\sqrt{T-4}}{8}\left(\frac{3}{4}\Pr(u_{0}\notin V) + \Pr(u_{0}\in V)\right) \\&= \frac{7\eta}{64}\sqrt{T-4} . \end{align}\] Moreover, we notice that for every \(t\), \(V\subseteq U\) and \(j\in[n^2]\), \(\ell_2(w_t, (V,j))\geq-\|{w_{t}}^{({{0}})}\|\geq -\eta\), \(\ell_3(w_t)\geq \delta_1\) and \(\ell_4(w_t)\geq \delta_2\), thus, it holds that \[\begin{align} F(w_T) &\geq \frac{7\eta}{64}\sqrt{T}+\delta_1+\delta_2-\eta \geq \eta\left(\frac{7}{64}\sqrt{T}-1\right) ;\\ F(w_*) &\leq F(0) \leq \frac{3\eta}{32}\sqrt{T}+\eta . \end{align}\] Then, since \(T\) is assumed large enough so that \(2 \leq \frac{1}{128} \sqrt{T}\), we conclude \[\begin{align} F(w_T) - F(w_*) \geq \eta \br{ \frac{1}{64}\sqrt{T}-2 } \geq \frac{\eta}{128}\sqrt{T} . &\qedhere \end{align}\] ◻
In this section we show a formal proof of our main result for SGD. As in \(GD\), we construct a hard loss function, which is defined in a \(d\)-dimensional Euclidean space such that \(d\) is polynomial in the number of examples \(n\). Using this construction, we establish a lower bound of \(\Omega\br[0]{ \eta \sqrt{T} }\) for the empirical loss of SGD with \(T=n\) iterations. We complete the proof of 2 in 6.
For the first step of the construction, we use 1 (see 4), which shows for every dimension \(d'\) an existence of a set of approximately orthogonal vectors in \(U\in \R^{d'}\) with size exponential in \(d'\). We define the set \(U\) to be \(U\eqq U_{d'}\) for \(d'=712n \log n\) and the sample space to be \(Z^{\text{SGD}}\eqq \{V: V\subseteq U\}\). Moreover, we define the hard distribution \(\mathcal{D}^{\text{SGD}}\) to be such that every \(u\in U\) is included in \(V \subseteq U\) independently with probability \(\delta=\frac{1}{4n^2}\).
For the hard loss function, we continue referring to every vector \(w\in \R^d\) as a concatenation of vectors, \(w = ({w}^{({{0}})}, {w}^{(1)},{w}^{(2)},\ldots,{w}^{(n)}\)), where for \(1\leq k\leq n\), \({w}^{(k)}\in \R^{712n \log n}\) and \({w}^{({{0}})}\in \R^{2n^2}\). In this construction, \({w}^{({{0}})}\) is also a concatenation of \(n\) vectors \({w}^{({0}, 1)},\ldots,{w}^{({0}, n)}\) such that each for every \(r\in[n]\), \({w}^{({0}, r)}\in \R^{2n}\)
Our approach is, as in \(GD\), in every iteration \(t\), to encode the set \(V_t\), sampled from \(\mathcal{D}^{\text{SGD}}\) into the iterate \({w}^{({0})}_{t+1}\). For this, we construct an encoder, \(\phi:P(U) \times [n]\to \R^{2n}\), a decoder \(\alpha:\R^{2n}\to U\), a real number \(\epsilon>0\) and \(n\) sets denoted as \(\Psi_1,\ldots,\Psi_n\). Here, the idea behind the construction is such set \(\psi_k\) represents all of the possible training sets with \(k\) examples, \(\{V_1\ldots,V_k\}\), and in every iteration \({t}\), it is possible to get the vector \(\psi^*_{t-1}\in \Psi_{t-1}\) that is recognized with the actual sets \(V_1,\ldots,V_{t-1}\) that are sampled before this iteration, as a maximizer of a linear function with margin \(\epsilon\). Then, as outlined in 3.6, we aim to output a vector \(u_t \in \bigcap_{i=t}^n \overline{V}_i\). The exact construction of such \(\epsilon,\phi,\alpha,\Psi_{1},\ldots,\Psi_n\) is detailed in 23 in 8.
Then, for \(\epsilon,\phi,\alpha,\Psi_1,\ldots,\Psi_n\) and \(d\eqq nd'+2n^2=712n^2\log n+2n^2\) we define the loss function in our construction. The loss function \(f^{\text{SGD}}\) is composed of three terms: \(\ell^{\text{SGD}}_{1}\), \(\ell^{\text{SGD}}_{2}\), \(\ell^{\text{SGD}}_{3}\), and is defined as follows, \[\begin{align} \label{sgd95loss95func} &f^{\text{SGD}}(w, V) \eqq \underbrace{\sqrt{\sum_{k=2}^T \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w}^{(k)}\rangle \right)^2}}_{\ell^{\text{SGD}}_1(w,V) \eqq} \\&\quad + \max\bigg(\delta_1,\max_{k\in [n-1], u\in U,\psi\in \Psi_k}\bigg(\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle \notag \\ &\quad\quad\quad\quad\quad\quad -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle\bigg)\bigg)\notag \\& \notag +\underbrace{\langle {w}^{({0},1)},-\frac{1}{4n^2}\phi(V,1)\rangle -\langle \frac{1}{n^3} u_1, {w}^{(1)}\rangle}_{\ell^{\text{SGD}}_3(w,V)\eqq} , \end{align}\tag{11}\] where the second term is denoted \(\ell^{\text{SGD}}_2(w,V)\) and \(u_1\) is an arbitrary vector in \(U\). In the following lemma, we establish that the above loss function in indeed convex and Lipschitz over \(\R^d\). The proof appears in 8.
Lemma 8. For every \(V\in Z\), the loss function \(f^{\text{SGD}}(w,V)\) is convex and \(4\)-Lipschitz over \(\R^d\) with respect to its first argument.
For this construction of distribution and loss function, we show the following theorem,
Theorem 4. Assume that \(n>2048\) and \(\eta\leq \frac{1}{\sqrt{T}}\). Consider the distribution \(\mathcal{D}^{\text{SGD}}\) and the loss function \(f^{\text{SGD}}\) with \(d=712 n^2\log n +2n^2\), \(\varepsilon = \frac{1}{n^2} \br[0]{1-\cos\br[0]{\frac{2\pi}{|P(U)|}}}\) and \(\delta_1=\frac{\eta}{8n^3}\). Then, for Unprojected SGD (cf. 2 with \(W=\R^d\)) with \(T=n\) iterations, initialized at \(w_1=0\) with step size \(\eta\), we have, with probability at least \(\frac{1}{2}\) over the choice of the training sample,
The iterates of SGD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,T\);
For all \(m=1,\ldots, T\), the \(m\)-suffix averaged iterate has: \[\widehat{F}^{\text{SGD}}(w_{T,m}) - \widehat{F}^{\text{SGD}}(\widehat{w}_*) = \Omega\br[1]{\eta\sqrt{T}} .\]
As in GD, we provide a key lemma that characterizes the trajectory of SGD under a certain "good event". For this good event, given a random training set sample \(S=\{V_i\}_{i=1}^n\), we denote \(P_t=\bigcap_{i=1}^{t-1}V_i\) and \(S_t=\bigcap_{i=t}^{t=n}\overline{V_i}\). Moreover, if \(P_t\neq \emptyset\), we denote \(r_t=\argmin \{r:V_t\in P_t\}\) and \(J_t=v_{r_{t}}\in U\). The good event is given as follows, \[\label{good95event95sgd} \cE'=\{\forall t\leq T \;P_t\neq\emptyset \;\text{and} \;J_t\in S_t\}\tag{12}\] In the following lemma we show that \(\cE'\) occurs with a constant probability. The proof appears in 8.
Lemma 9. For \(T=n\) and the event \(\cE'\) defined in 12 , it holds that \(\Pr(\cE')\geq \frac{1}{2}\).
Under this event, the dynamics of \(SGD\) is characterized as follows,
Lemma 10. Assume the conditions of 4, and consider the iterates of unprojected* \(SGD\), with step size \(\eta\leq \frac{1}{\sqrt{T}}\) initialized at \(w_1=0\). Under the event \(\cE'\), we have for \(t\geq 4\) and \(s\neq {0}\), \[\begin{align} {w_t}^{(k)}=\begin{cases} -\frac{3}{8}\eta u_{1} + (t-1)\frac{\eta}{n^3} u_1 &\quad k=1 \\ \frac{1}{8}\eta u_{k} &\quad 2\leq k\leq t-2 \\ \frac{1}{2}\eta u_{t-1} &\quad k=t-1 \\ 0 &\quad t\leq k\leq n, \end{cases} \end{align}\] and for \(s={0}\), \[\begin{align} {w_t}^{({0},k)}=\begin{cases} \frac{\eta}{4n^2}\sum_{i=2}^{t-1} \phi(V_i,1) & k= 1 \\ \frac{\eta}{4n^2}\sum_{i=1}^{t-1}\phi(V_i,i) & k= t-1 \\ 0 & k\notin\{1,t-1\}. \end{cases} \end{align}\] where \(u_1 \in U\) and every another vector \(u_{k}\) holds \(u_{k}\in \bigcap_{i=1}^{k-1}V_i\cap \bigcap_{i=k}^{n}\overline{V_i}\).*
For proving this key lemma, we analyze how the terms \(\ell^{\text{SGD}}_1,\ell^{\text{SGD}}_2\) affects the dynamics of SGD under the event \(\cE'\). First, we show that the gradients of \(\ell^{\text{SGD}}_1\) does not affect the dynamics of \(SGD\), as the gradient of this term in any iterate \(w_t\) is zero. The idea is formalized in the following lemma. The proof is deferred to 8.
Lemma 11. Assume the conditions of 4 and the event \(\cE'\). Let \(w\in \R^d\) and \(t\) be such that for every \(2\leq k\leq t-1\), \({w}^{(k)}=c\eta u_k\) for \(c\leq \frac{1}{2}\) and every such \(u_k\) holds \(u_k\in \bigcap_{i=1}^{k-1}V_i\cap \bigcap_{i=k}^{n}\overline{V_i}\), and for every \(t\leq k\leq T\), \({w}^{(k)}=0\). Then, for every \(t\), it holds that, \(\ell^{\text{SGD}}_1\) is differentiable at \((w,V)\) and for all \(i \in [n]\), we have \(\nabla\ell^{\text{SGD}}_1(w,V_t)=0.\)
Now, we analyze the gradient of \(\ell^{\text{SGD}}_2\). The role of this component is to decode the next "bad solution" \(\alpha\left(\frac{1}{n}\sum_{i=1}^{t-1}\phi(V_i, i)\right)\) from the sets \(V_1,\ldots,V_{t-1}\), and make a progress in this direction in some subspace \({W}^{(t-1)}\). In the following lemma, we show that the gradient of \(\ell^{\text{SGD}}_2\), serves this goal.
Lemma 12. Assume the conditions of 4 and the event \(\cE'\). For every \(k\), let \(\psi^*_k=\frac{1}{n}\sum_{t=1}^{k}\phi(V_t, t)\). Moreover, let \(m\geq 3\) and \(w\in \R^d\) such that \({w}^{(1)}=c\eta u_1\) for \(-\frac{3}{8}\leq c\leq 0\) and \(u_1\in U\), for every \(2\leq k\leq m-1\), \({w}^{(k)}=\frac{1}{8}\eta u_k\) such that every \(u_k\) holds \(u_k\in \bigcap_{t=1}^{k-1}V_t\cap \bigcap_{t=k}^{n}\overline{V_t}\), \({w}^{(m)}=\frac{1}{2}\eta u_m\) where \(u_m\) holds \(u_m\in \bigcap_{t=1}^{m-1}V_t\cap \bigcap_{i=m}^{n}\overline{V_t}\) and for every \(m+1\leq k\leq T\), \({w}^{(k)}=0\). Moreover, assume that \(w\) holds \({w}^{(0,m)}=\frac{\eta}{4n}\psi^*_m\), \(\|{w}^{(0,1)}\|\leq \eta\) and for every \(k\notin \{m,1\}\), \({w}^{(0,k)}=0\). Then, for every \(V\subseteq U\), \(\ell^{\text{SGD}}_2\) is differentiable at \((w,V)\) and, we have for \(k\neq 0\), \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w,V)}^{(k)}= \begin{cases} \frac{3}{8} u_{m} &\quad k=m \\ -\frac{1}{2} \alpha(\psi_{m}^*) &\quad k=m+1 \\ 0 &\quad k\notin \{m,m+1\} \end{cases} \end{align}\] and, \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w,V)}^{({0}, k)}= \begin{cases} \frac{1}{4n^2}\sum_{t=1}^{m}\phi(V_t,i)&\quad k= m \\ -\frac{1}{4n^2}\sum_{t=1}^{m}\phi(V_t,i)-\frac{1}{4n^2}\phi(V,i)&\quad k= m+1 \\ 0&\quad k\notin \{m,m+1\}. \end{cases} \end{align}\]
Now we can prove 10.
of 10. We assume that \(\cE'\) holds and prove the lemma by induction on \(t\). We begin from the basis of the induction, \(t=4\), which is proved in 26 in 8. Now, we assume the hypothesis of the induction, that the lemma holds for iteration \(t\) and turn to show the required for iteration \(t+1\).
First, we notice that for every \(2\leq k\leq t-1\), \({w_t}^{(k)}=c\eta u_k\) for \(c\leq \frac{1}{2}\) and every such \(u_k\) holds \(u_k\in \bigcap_{i=1}^{k-1}V_i\cap \bigcap_{i=k}^{n}\overline{V_i}\), and for every \(t\leq k\leq T\), \({w_t}^{(k)}=0\). Then, by 11, we have that \(\nabla\ell^{\text{SGD}}_1(w_t,V_t)=0.\)
Second, \(\ell^{\text{SGD}}_3\) is a linear function, thus, \[\nabla {\ell^{\text{SGD}}_3(w_t,V_t)}^{(s)}=\begin{cases} -\frac{1}{n^3}u_1 &s=1 \\ -\frac{1}{4n^2}\phi(V_t,1)& s= {0},1 \\0 & \text{otherwise}.\end{cases}\] Third, For \(\ell^{\text{SGD}}_2(w_t,V_t)\), we notice for \(m=t-1\geq 3\) it holds that \({w_t}^{(1)}=c\eta u_1\) for \(-\frac{3}{8}\leq c\leq 0\) and \(u_1\in U\), for every \(2\leq k\leq m-1\), \({w_t}^{(k)}=\frac{1}{8}\eta u_k\) such that every \(u_k\) holds \(u_k\in \bigcap_{t=1}^{k-1}V_t\cap \bigcap_{t=k}^{n}\overline{V_t}\), \({w_t}^{(m)}=\frac{1}{2}\eta u_m\) where \(u_m\) holds \(u_m\in \bigcap_{t=1}^{m-1}V_t\cap \bigcap_{i=m}^{n}\overline{V_t}\), and for every \(m+1\leq k\leq T\), \({w}^{(k)}=0\). Moreover, \(w_t\) holds \({w}^{(0,m)}=\frac{\eta}{4n}\psi^*_m\), \(\|{w_t}^{(0,1)}\|\leq \eta\) and for every \(k\notin \{m,1\}\), \({w_t}^{(0,k)}=0\). Then, by 12, we get that, we have for \(k\neq 0\), \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w_t,V_t)}^{(k)}= \begin{cases} \frac{3}{8} u_{t-1} &\quad k=t-1 \\ -\frac{1}{2} \alpha(\psi_{t-1}^*) &\quad k=t \\ 0 &\quad k\notin \{t-1,t\} \end{cases} \end{align}\] and, \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w_t,V_t)}^{({0}, k)}= \begin{cases} \frac{1}{4n^2}\sum_{i=1}^{t-1}\phi(V_i,i)&\quad k= m \\ -\frac{1}{4n^2}\sum_{i=1}^{t}\phi(V_i,i)&\quad k= m+1 \\ 0&\quad k\notin \{m,m+1\}. \end{cases} \end{align}\] Now, by 23, for \(j=\argmin_{i}\{i:v_i \in \bigcap_{i=1}^{t-1} V_i\}\), we get that \[\begin{align} \alpha(\psi_{t-1}^*)=v_{j}\in \bigcap_{i=1}^{t-1} V_i. \end{align}\] We notice that \(\bigcap_{i=1}^{t-1} V_i=P_t\) and thus \(\alpha(\psi_{t-1}^*)=J_t\). Then, by \(\cE'\), \(\alpha(\psi_{t-1}^*)\) also holds \(\alpha(\psi_{t-1}^*)\in S_{t}\). Combining the above together, we get, for \(u_t=\alpha(\psi_{t-1}^*)\in P_t\cap S_t\), \[\begin{align} {\nabla f(w_t,V_t)}^{(k)}= \begin{cases} - \frac{1}{n^3}u_1&\quad k=1\\ \frac{3}{8} u_{t-1} &\quad k=t-1 \\ -\frac{1}{2} u_{t} &\quad k=t \\ 0 &\quad k\notin \{1,t-1,t\}, \end{cases} \end{align}\] and, \[\begin{align} {\nabla f(w_t,V_t)}^{({0}, k)}= \begin{cases} -\frac{1}{4n^2}\phi(V_3,1) &\quad k=1 \\ \frac{1}{4n^2}\sum_{i=1}^{t-1}\phi(V_i,i)&\quad k=t-1 \\ -\frac{1}{4n^2}\sum_{i=1}^{t}\phi(V_i,i)&\quad k=t \\ 0&\quad k\notin \{1,t-1,t\}, \end{cases} \end{align}\] and the lemma follows. ◻
The proof of 4 is similar to 3, using 10 instead of 4, and is deferred to 8.
This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreements No.; 882396). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. This work received additional support from the Israel Science Foundation (ISF, grant number 2549/19), from the Len Blavatnik and the Blavatnik Family foundation, and from the Adelis Foundation.
In this section, we complete the proof of 1 2, by showing a construction of a differentiable objective that maintains the same lower bounds given in 3 33 4. Our general approach is to use a randomized smoothing of the original objectives. Then, we use the fact that the subgradients are unique along any possible trajectory of GD, to show that when smoothing is applied within a sufficiently small neighborhood, gradients along any such trajectory are preserved. Consequently, this approach does not impact the dynamics of the optimization algorithm, while simultaneously ensuring the objectives become differentiable everywhere.
The hard distribution \(\mathcal{D}\) is defined to be as in 4. The hard loss function is a smoothing of \(f\) (9 ), and is defined as \[\begin{align} \label{loss95def95gd95in95setup95diff} \tilde{f}(w,(V,j)) \eqq \E_{v\in B}\sbr{ f(w+\delta v,(V,j)) } , \end{align}\tag{13}\] for a sufficiently small \(\delta>0\) and the \(d\)-dimensional unit ball \(B\). Analogously, we denote the empirical loss and the population loss with respect to the loss function \(\tilde{f}\) as \(\widehat{\tilde{F}}(w)=\frac{1}{n}\sum_{i=1}^n \tilde{f}(w,(V_i,j_i))\) and \(\tilde{F}(w)=\E_{(V,j)\sim \mathcal{D}} \tilde{f}(w,(V,j))\), respectively. The loss function \(\tilde{f}\) is differentiable, \(5\)-Lipschitz with respect to its first argument and convex over \(\R^d\), as stated in the following lemma.
Lemma 13. For every \((V,j) \in Z\), the loss function \(\tilde{f}\) is differentiable, convex and \(5\)-Lipschitz with respect to its first argument and over \(\R^d\).
We first prove the following theorem,
Theorem 5. Assume that \(n>0\), \(T>3200^2\) and \(\eta\leq\frac{1}{\sqrt{T}}\). Consider the distribution \(\mathcal{D}\) and the loss function \(\tilde{f}\) for \(d=178nT+2n^2\), \(\varepsilon = \frac{1}{n^2} \br[0]{1-\cos\br[0]{\frac{2\pi}{|P(U)|}}}\), \(\beta=\frac{\epsilon}{4T^2}\), \(\delta=\frac{\eta\beta}{32}\), \(\delta_1=\frac{\eta}{2n}\) and \(\delta_2=\frac{3\eta\beta}{16}\). Then, for Unprojected GD (cf. 1 with \(W=\R^d\)) on \(\widehat{F}\), initialized at \(w_1=0\) with step size \(\eta\), we have, with probability at least \(\frac{1}{6}\) over the choice of the training sample:
The iterates of GD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,T\);
For all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has: \[\tilde{F}(w_{T,m}) - \tilde{F}(w_*) = \Omega\br[1]{\eta\sqrt{T}} .\]
Now we show that the dynamics of GD when is applied on \(\widehat{\tilde{F}}\) is identical to dynamics of the algorithm on \(\widehat{F}\), as stated in the following lemma.
Lemma 14. Under the conditions of 5 3, let \(w_t,\tilde{w}_t\) be the iterates of Unprojected GD with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), on \(\widehat{F}\) and \(\widehat{\tilde{F}}\) respectively. Then, if \(\cE\) occurs, then for every \(t\in[T]\), it holds that \(w_t=\tilde{w}_t\).
Next, we set out to establish the proof for 5.
of 5. Let \(\overline{w_{T,m}}\) be the \(m\)-suffix average of \(GD\) when is applied on \(\widehat{F}\). Let \(\overline{w_*}=\argmin_w F(w)\). By 14, we know that, with probability of at least \(\frac{1}{6}\), \(\cE\) occurs and \(w_{T,m}=\overline{w_{T,m}}\). Then, by 3 and 32, \[\begin{align} \frac{\eta}{3200}\sqrt{T}&\leq F(\overline{w_{T,m}})-F(\overline{w_*}) \\&=F(w_{T,m})-F(\overline{w_*}) \\&\leq \tilde{F}(w_{T,m})+5\delta-\tilde{F}(\overline{w_*})+5\delta \\&\leq \tilde{F}(w_{T,m})+5\delta-\tilde{F}(w_*)+5\delta, \end{align}\] and, \[\begin{align} \tilde{F}(w_{T,m})-\tilde{F}(w_*)&\geq \frac{\eta}{3200}\sqrt{T}-\frac{10\eta\epsilon}{128T^2} \\&\geq \frac{\eta}{3200}\sqrt{T}-\frac{\eta}{10T^2} \\&\geq \frac{\eta}{6400}\sqrt{T}. \end{align}\] ◻
Now we can finally prove 1. The proof is an immediate corollary from 5 and the lower bound of \(\Omega\left(\min\left(\frac{1}{\eta T},1\right)\right)\) given in 35 in 10. It’s important to highlight that we offer a rigorous proof for a modified version of 1, where the loss function \(f\) possesses a Lipschitz constant of only 5. By scaling down this loss function by a factor of \(\frac{1}{5}\) and simultaneously adjusting the step size \(\eta\) by a factor of 5, we can employ the same proof to establish the validity of 1.
of 1. We know that \(\eta\leq \frac{1}{5\sqrt{T}}\). First, by 5, we know that for Unprojected \(GD\) and \(d_1=178nT+2n^2\), there exist a distribution \(\mathcal{D}\) over a probability space \(Z\), a constant \(C_1\) and a loss function \(\tilde{f}:\R^{d_1}\times Z\to \R\) such that, with probability of at least \(\frac{1}{6}\), \[\tilde{F}(w_{T,m})-\tilde{F}(w_*)\geq C_1\eta\sqrt{T.}\] Second, by 35, we know that for Unprojected \(GD\) and \(d_2=\max(25\eta^2T^2,1)\), there exist a constant \(C_2\) and a deterministic loss function \(\tilde{f}^{\text{OPT}}:\R^{d_2}\to \R\) such that \[\tilde{f}^{\text{OPT}}(w_{T,m})-\tilde{f}^{\text{OPT}}(w_*)\geq C_2\min\left(1,\frac{1}{\eta T}\right)\] Now, let \(C=\frac{1}{2}\min \left(C_1, C_2\right)\). If \(\eta\geq T^{-\frac{3}{4}}\), then, \(\eta\sqrt{T}\geq \min(1,\frac{1}{\eta T})\), and we get, \[\tilde{F}(w_{T,m})-\tilde{F}(w_*)\geq C\left(\eta\sqrt{T} +\min\left(1,\frac{1}{\eta T}\right)\right)\geq C\left( \min\left(1,\eta\sqrt{T}+\frac{1}{\eta T}\right)\right).\] Otherwise, we get that, \[\tilde{f}^{\text{OPT}}(w_{T,m})-\tilde{f}^{\text{OPT}}(w_*)\geq C\left(\eta\sqrt{T} +\min\left(1,\frac{1}{\eta T}\right)\right)\geq C\left( \min\left(1,\eta\sqrt{T}+\frac{1}{\eta T}\right)\right).\] Since in both cases, by 35 5, \(w_t\in \mathbb{B}^{d}\) for every \(t\in[T]\), the theorem is applicable also for Projected GD. ◻
The hard distribution \(\mathcal{D}^{\text{SGD}}\) is defined to be as in 5. The hard loss function is a smoothing of \(f^{\text{SGD}}\) (11 ), and is defined as \[\begin{align} \label{loss95def95sgd95in95setup95diff} \tilde{f}^{\text{SGD}}(w,V) \eqq \E_{v\in B}\sbr{ f^{\text{SGD}}(w+\delta v,V) } , \end{align}\tag{14}\] for a sufficiently small \(\delta>0\) and the \(d\)-dimensional unit ball \(B\). Analogously, we denote the empirical loss and the population loss with respect to the loss function \(\tilde{f}^{\text{SGD}}\) as \(\widehat{\tilde{F}}^{\text{SGD}}(w)=\frac{1}{n}\sum_{i=1}^n \tilde{f}^{\text{SGD}}(w,V_i)\) and \(\tilde{F}^{\text{SGD}}(w)=\E_{V\sim \mathcal{D}} \tilde{f}^{\text{SGD}}(w,V)\), respectively. The loss function \(\tilde{f}^{\text{SGD}}\) is differentiable, \(4\)-Lipschitz with respect to its first argument and convex over \(\R^d\), as stated in the following lemma.
Lemma 15. For every \(V\in Z\), the loss function \(\tilde{f}^{\text{SGD}}\) is differentiable, convex and \(4\)-Lipschitz with respect to its first argument and over \(\R^d\).
We first prove the following theorem,
Theorem 6. Assume that \(n>2048\) and \(\eta\leq \frac{1}{\sqrt{n}}\). Consider the distribution \(\mathcal{D}^{\text{SGD}}\) and the loss function \(\tilde{f}^{\text{SGD}}\) with \(d=712 n^2\log n +2n^2\), \(\varepsilon = \frac{1}{n^2} \br[0]{1-\cos\br[0]{\frac{2\pi}{|P(U)|}}}\), \(\delta=\frac{\eta\varepsilon}{32n^3}\) and \(\delta_1=\frac{\eta}{8n^3}\). Then, for Unprojected SGD (cf. 2 with \(W=\R^d\)) with \(T=n\) iterations, initialized at \(w_1=0\) with step size \(\eta\), we have, with probability at least \(\frac{1}{2}\) over the choice of the training sample,
The iterates of SGD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,n\);
For all \(m=1,\ldots, n\), the \(m\)-suffix averaged iterate has: \[\widehat{\tilde{F}}^{\text{SGD}}(w_{n,m}) - \widehat{\tilde{F}}^{\text{SGD}}(\widehat{w}_*) = \Omega\br[1]{\eta\sqrt{n}} .\]
Now, As in GD, the main step in proving 6 is to show that taking expectation of \(f^{\text{SGD}}\) for every point \(w\) in a ball with small enough radius does not change the dynamics of \(SGD\).
Lemma 16. Under the conditions of 6 4, let \(w_t,\tilde{w}_t\) be the iterates of Unprojected SGD with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), on \(\widehat{F}^{\text{SGD}}\) and \(\widehat{\tilde{F}}^{\text{SGD}}\) respectively. Then, if \(\cE'\) occurs, then for every \(t\in[T]\), it holds that \(w_t=\tilde{w}_t\).
Next, we set out to establish the proof for 6.
of 6. Let \(\overline{w_{n,m}}\) be the \(m\)- suffix average of \(SGD\) when is applied on \(f^{\text{SGD}}\) and let \(\overline{\widehat{w}_*}=\argmin_w \widehat{F}^{\text{SGD}}(w)\). By 16, we know that, with a probability \(\frac{1}{2}\) ,\(w_{n,m}=w^\text{SGD}_{n,m}\). Then, by 4 and 32, \[\begin{align} \frac{\eta}{64000}\sqrt{n}&\leq \widehat{F}^{\text{SGD}}(\overline{w_{n,m}})-\widehat{F}^{\text{SGD}}(\overline{\widehat{w}_*}) \\&=\widehat{F}^{\text{SGD}}(w_{n,m})-\widehat{F}^{\text{SGD}}(\overline{\widehat{w}_*}) \\&\leq \widehat{\tilde{F}}^{\text{SGD}}(w_{n,m})+4\delta-\widehat{\tilde{F}}^{\text{SGD}}(\overline{\widehat{w}_*})+4\delta \\&\leq \widehat{\tilde{F}}^{\text{SGD}}(w_{n,m})+4\delta-\widehat{\tilde{F}}^{\text{SGD}}(\widehat{w}_*)+4\delta, \end{align}\] and, \[\begin{align} \widehat{\tilde{F}}^{\text{SGD}}(w_{n,m})-\widehat{\tilde{F}}^{\text{SGD}}(\widehat{w}_*)&\geq \frac{\eta}{64000}\sqrt{n}-\frac{\eta\epsilon}{4n^3} \\&\geq \frac{\eta}{64000}\sqrt{n}-\frac{\eta}{4n^3} \\&\geq \frac{\eta}{128000}\sqrt{n}. \end{align}\] ◻
Now we can finally prove 2.
proof of 2. We know that \(T=n\) and \(\eta\leq \frac{1}{5\sqrt{T}}\). First, by 6, we know that for Unprojected \(SGD\) and \(d_1=712n^2\log n+2n^2\), there exist a distribution \(\mathcal{D}^{\text{SGD}}\) over a probability space \(Z\), a constant \(C_1\) and a loss function \(\tilde{f}^{\text{SGD}}:\R^{d_1}\times Z\to \R\) such that, with probability of at least \(\frac{1}{2}\), \[\widehat{\tilde{F}}^{\text{SGD}}(w_{T,m})-\widehat{\tilde{F}}^{\text{SGD}}(\widehat{w}_*)\geq C_1\eta\sqrt{T.}\] Second, by 35, we know that for Unprojected \(SGD\) and \(d_2=\max(25\eta^2T^2,1)\), there exist a constant \(C_2\) and a deterministic loss function \(\tilde{f}^{\text{OPT}}:\R^{d_2}\to \R\) such that \[\tilde{f}^{\text{OPT}}(w_{T,m})-\tilde{f}^{\text{OPT}}(\widehat{w}_*)\geq C_2\min\left(1,\frac{1}{\eta T}\right)\] Now, let \(C=\frac{1}{2}\min \left(C_1, C_2\right)\). If \(\eta\geq T^{-\frac{3}{4}}\), then, \(\eta\sqrt{T}\geq \min(1,\frac{1}{\eta T})\), and we get, \[\widehat{\tilde{F}}^{\text{SGD}}(w_{T,m})-\widehat{\tilde{F}}^{\text{SGD}}(\widehat{w}_*)\geq C\left(\eta\sqrt{T} +\min\left(1,\frac{1}{\eta T}\right)\right)\geq C\left( \min\left(1,\eta\sqrt{T}+\frac{1}{\eta T}\right)\right).\] Otherwise, we get that, \[\tilde{f}^{\text{OPT}}(w_{T,m})-\tilde{f}^{\text{OPT}}(\widehat{w}_*)\geq C\left(\eta\sqrt{T} +\min\left(1,\frac{1}{\eta T}\right)\right)\geq C\left( \min\left(1,\eta\sqrt{T}+\frac{1}{\eta T}\right)\right).\] Since in both cases, by 35 6, \(w_t\in \mathbb{B}^{d}\) for every \(t\in[T]\), the theorem is applicable also for Projected SGD. ◻
of 1. Let \(r=2^{\frac{-d'}{178}}\). For every \(1\leq i\leq r\) and \(1\leq j\leq d'\) we define the random variable \(u_i^j\) be a random variable to be \(\frac{1}{\sqrt{d'}}\) with probability \(\frac{1}{2}\) and \(-\frac{1}{\sqrt{d'}}\) with probability \(\frac{1}{2}\). Then, for every \(1\leq i\leq r\), we define the vector \(u_i\) which its \(j\)th entry is \(u_i^j\) and look at the set \(U=\{u_1,u_2,...u_{r}\}\). This set will hold the required property with positive probability. First, for every \(i\neq k\), \(\langle u_i,u_k\rangle\) are sums of \(d\) random variables that taking values in \([-\frac{1}{d'},\frac{1}{d'}]\) with \(\E\langle u_i,u_k\rangle=0\). Then by Hoeffding’s inequality, \[\begin{align} Pr(|\langle u_i,u_k\rangle|\geq \frac{1}{8})&\leq 2e^{\frac{-2\left(\frac{1}{8}\right)^2}{d'\cdot \frac{4}{d'^2}}}=2e^{-\frac{d'}{128}} \end{align}\] Then, by union bound on the \(\binom{r}{2}\) pairs of vectors in \(U\), \[\begin{align} Pr(\exists i,k \;|\langle u_i,u_k\rangle|\geq \frac{1}{8})&\leq 2e^{-\frac{d'}{128}}\cdot \binom{r}{2}< 2e^{-\frac{d'}{128}}\cdot \frac{1}{2}r^2\leq 1. \end{align}\] ◻
Lemma 17. Let \(n, d \geq 1\) and a set \(U \subseteq \mathbb{B}^{d}\). Let \(P(U)\) be the power set of \(U\). Then, there exist a set \(\Psi\subseteq \R^{2n^2}\), a number \(0<\epsilon<\frac{1}{n}\) and two mappings \(\phi:P(U) \times [n^2]\to \R^{2n^2}\), \(\alpha:\R^{2n^2}\to U\) such that,
For every \(j\in[n^2]\) and \(V\subseteq U\), it holds \(\|\phi\left(V,j\right)\|\leq 1\);
For every \(\psi\in\Psi\), it holds \(\|\psi\|\leq 1\);
Let \(V_1,\ldots,V_n\) be arbitrary subsets of \(U\). If \(j_1,\ldots,j_n\) hold that \(j_i\neq j_k\) for \(i\neq k\), \(\psi^*=\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i)\) is that,
\[\abr[2]{ \psi^*, \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) } > \frac{7}{8n} ;\]
For every \(\psi\in \Psi\), \(\psi\neq \psi^*\): \[\abr[2]{ \psi^*, \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) } \geq \abr[2]{ \psi, \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) } + \epsilon ;\]
If \(\bigcup_{i=1}^nV_i\neq U\), then it holds that \(\alpha(\psi^*)=v_{i^*} \in U\setminus\bigcup_{i=1}^{n}V_{i}\) for \(i^* = \min\cbr{ i:v_i \in U\setminus\bigcup_{i=1}^nV_i }\).
Proof. First, we consider an arbitrary enumeration of \(P(U)=\{V^1,...V^{|P(U)|}\}\) and define \(g:P(U)\to \R^2\), \(g(V^i)= \left(\sin\left(\frac{2\pi i}{|P(U)|}\right),\cos\left(\frac{2\pi i}{|P(U)|}\right)\right)\). Now, we refer to a vector \(a\in \R^{2n^2}\) as a concatenation of \(n^2\) vectors in \(\R^2\), \({a}^{(1)},...,{a}^{(n^2)}\). Then, we define \(\delta=1-\cos\left(\frac{2\pi}{|P(U)|}\right)\), \(\epsilon=\frac{\delta}{n^2}\) and \[{\phi(V,j)}^{(i)}= \left\{ \begin{array}{cc} g(V) & i=j \\ 0 & \text{otherwise} \end{array} \right.\] As a result, for every \(V^i,j\) it holds that \[\begin{align} \|\phi(V^i,j)\|=\|g(V^i)\|=\sqrt{\sin\left(\frac{2\pi i}{|P(U)|}\right)^2+\cos\left(\frac{2\pi i}{|P(U)|}\right)^2}=1 \end{align}\] Moreover, if \(j_1\neq j_2\), \[\begin{align} \langle \phi(V^i,j_1),\phi(V^i,j_2)\rangle =0, \end{align}\] and if \(i>k\), \[\begin{align} \langle \phi(V^i,j),\phi(V^k,j)\rangle=&\langle g(V^i), g(V^k)\rangle \\&=\sin\left(\frac{2\pi i}{|P(U)|}\right)\sin\left(\frac{2\pi k}{|P(U)|}\right) + \cos\left(\frac{2\pi i}{|P(U)|}\right)\cos\left(\frac{2\pi k}{|P(U)|}\right) \\&=\cos\left(\frac{2\pi (i-k)}{|P(U)|}\right) \\&\leq \cos\left(\frac{2\pi}{|P(U)|}\right)\\&=1-\delta \end{align}\] We notice that \(0<\delta< 1\). Now, we consider an arbitrary enumeration of \(U=\{v_1,...v_{|U|}\}\), and define the following set \(\Psi\subseteq \R^{2n^2}\) and the following two mappings \(\sigma: R^{2n^2}\to P(U), \alpha: R^{2n^2}\to U\), \[\Psi = \{ \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i): \forall i\; V_i\;\subseteq U,\;j_i\in [n^2] \text{ and } i\neq l \implies j_i\neq j_\ell\}\] Note that, for every \(\psi \in \Psi\), \[\|\psi\|=\|\frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\|\leq \frac{1}{n}\sum_{i=1}^n \|\phi(V_i,j_i)\|=1.\] Then, for every \(a\in \R^{2n^2}\) and \(j\in[n^2]\), we denote the index \(q(a,j)\in [|P(U)|]\) as \[q(a,j)=\argmax_{r}\langle g(V_r), {a}^{(j)}\rangle,\] and define the following mapping \(\sigma:\R^{2n^2}\to P(U)\), \[\sigma(a)=\bigcup_{j=1,{a}^{(j)}\neq 0}^{n^2}V_{q(a,j)}.\] Moreover, for every \(a\in \R^{2n^2}\), we denote the index \(p(a)\in [|U|]\) as \[p(a)=\argmin_{i}\{i:v_i \in U\setminus\sigma(a)\},\] and define the following mapping \(\alpha:\R^{2n^2}\to U\), \[\alpha(a)=\left\{\begin{array}{cc} v_{|U|} & \sigma(a)=U \\ v_{p(a)} & \sigma(a)\neq U \end{array}\right..\]
Now, Let \(V_1,\ldots, V_n\subseteq U\) and \(j_1,...j_n\) that are sampled uniformly from \([n^2]\), We prove the last part of the lemma under the condition that \(j_i\neq j_k\) for \(i\neq k\). \(\psi^*=\frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\) holds \[\begin{align} \langle \psi^*, \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\rangle&= \langle \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i), \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\rangle \\&= \frac{1}{n^2}\sum_{i=1}^n\langle \phi(V_i,j_i),\phi(V_i,j_i)\rangle \\&= \frac{1}{n} \\& > \frac{7}{8n} \end{align}\] For \(\psi=\frac{1}{n}\sum_{l=1}^n \phi(V'_l,j'_l)\) such that \(\psi\neq \psi^*\), there are at most \(n\) pairs \(i, l\) such that \(\langle \phi(V'_i,j'_i),\phi(V'_l,j'_l)\rangle\neq 0\). thus, there exists a pair \((V'_r,j'_r)\) that \((V'_r,j'_r)\notin \{(V_i,j_i) : i\in [n]\}\). and for every \(i\), \(\langle \phi(V_i,j_i),\phi(V'_l,j'_l)\rangle\leq 1-\delta\). As a result, \[\begin{align} \langle \psi, \frac{1}{n}\sum_{l=1}^n \phi(V_i,j_i)\rangle&= \langle \frac{1}{n}\sum_{i=1}^n \phi(V'_l,j'_l), \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\rangle \\&=\frac{1}{n^2}\sum_{i=1}^n\sum_{l=1}^n\langle \phi(V_i,j_i),\phi(V'_l,j'_l)\rangle \\&\leq \frac{1}{n^2}\left( 1-\delta+\sum_{i=1,i\neq r}^n 1\right) \\&\leq \frac{1}{n^2}(1-\delta+n-1)\\&= \frac{1}{n}-\frac{\delta}{n^2} \\&= \langle \psi^*, \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\rangle-\epsilon \end{align}\] Furthermore, since if all \(j_i\) are distinct, for every \(i\) it holds that, \({\frac{1}{n}\sum_{i=1}^n\phi=(V_i,i)}^{(j_i)}=\frac{1}{n}g(V_i)\), thus, \[\begin{align} q\left(\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i),j_i\right)&=\argmax_{r}\langle g(V_r), {\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i)}^{(j_i)}\rangle \\&=\argmax_{r}\langle g(V_r), \frac{1}{n}g(V_i)\rangle \\&=i, \end{align}\] and we get, \[\begin{align} \sigma (\psi^*)&=\sigma \left(\frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\right)\\ &=\bigcup_{j=1,{\frac{1}{n}\sum_{i=1}^n\phi(V_l,j_i)}^{(j)}\neq 0}^{n^2}V_{q\left(\frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i),j\right)} \\&=\bigcup_{i=1}^{n}V_{q\left(\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i),j_i\right)} _{i=1}^n\}} \\&=\bigcup_{i=1}^{n}V_{i} \end{align}\] Finally, assuming that \(\bigcup_{i=1}^nV_i\neq U\), \[\alpha(\psi^*)= v_{p(a)} \in U\setminus\bigcup_{i=1}^{n}V_{i}.\] ◻
of 2. We prove that \(\ell_{1},\ell_{2}\) and \(\ell_{4}\) are convex and \(1\)-Lipschitz and \(\ell_{3}\) is convex and \(1 2\)-Lipschitz.
First, by 1 17 for every \(u\in U\) and \(V\in P(U)\), \(j\in[n^2]\), it holds that \(\|u\|=1\), \(\|\phi(V,j)\|=1\). Then, \(\ell_{2}\) is a \(1\)-Lipschitz linear function, and \(\ell_{4}\) is a maximum over \(1\)-Lipschitz linear functions, thus, both functions are convex and \(1\)-Lipschitz. Moreover, for every possible \(\psi\in \Psi\) \[\|\psi\|=\|\frac{1}{n}\sum_{l=1}^n\phi(V_l)\|\leq \frac{1}{n}\sum_{l=1}^n\|\phi(V_l)\|=1.\] thus, \(\ell_{3}\) is a maximum over \(2\)-Lipschitz linear functions, thus, it is convex and \(2\)-Lipschitz. Now, for \(\ell_{1}\), for every set \(V\subseteq U\), let \(\alpha_V(w)\in \R^{T-1}\) to be the vector which its \(k\)’th coordinate is \({\alpha_V(w)}^{(k)}=\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{w}^{(k+1)}\rangle \right)\) and prove convexity and \(1\)-Lipshitzness. For establishing convexity, observe \[\begin{align} &\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{(\lambda x + (1-\lambda) y)}^{(k)}\rangle \right)^2} \\&= \sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \left(\lambda \langle u,{x}^{(k)}\rangle +(1-\lambda)\langle u,{ y}^{(k)}\rangle\right) \right)^2} \\&\leq \sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \left(\lambda \langle u,{x}^{(k)}\rangle\right) +\max_{u\in V}\left((1-\lambda)\langle u,{ y}^{(k)}\rangle\right) \right)^2}\\&\leq \sqrt{\sum_{k=2}^T \left( \lambda\max\left(\frac{3\eta}{32}, \max_{u\in V} \left( \langle u,{x}^{(k)}\rangle\right)\right) +(1-\lambda)\max\left(\frac{3\eta}{32},\max_{u\in V}\langle u,{ y}^{(k)}\rangle\right) \right)^2} \\& =\|\lambda \alpha_V(x) +(1-\lambda)\alpha_V(y)\|_2 \\& \leq \lambda\|\alpha_V(x)\|_2 +(1-\lambda)\alpha_V(y)\|_2\\& = \lambda \sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{x}^{(k)}\rangle \right)^2}+(1-\lambda)\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{y}^{(k)}\rangle \right)^2}. \end{align}\] For \(1\)-Lipschitzness, for every \(w\in \R^d\) and sub-gradient \(g(w,V)\in \partial \ell_1(w,V)\), there exists a sub gradient \(h(w,V)\in \partial\left(\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{w}^{(k)}\rangle \right)^2\right)\) such that \[\begin{align} \|g(w,V)\|= \frac{\|h(w,V)\|}{2\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{w}^{(k)}\rangle \right)^2}} =\frac{\|h(w,V)\|}{2\sqrt{\sum_{k=2}^T{{\alpha_V(w)}^{(k)}}^{2}}}. \end{align}\] Moreover, for every \(k\) and sub gradient \(b_{k,V}(w)\in \partial \left( {\alpha_V(w)}^{(k)}\right)\) we denote \(r_{k,V}(w)\in R^d\) the vector with \({r_{k,V}(w)}^{(k)}=b_{k,V}(w)\) and for \(j\neq k\), \({r_{k,V}(w)}^{(j)}=0\). Then, for every sub gradient \(h(w,V)\in \partial\left(\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{w}^{(k)}\rangle \right)^2\right)\), there exists \(T-1\) such vectors \(r_{k,V}(w)\in R^d\) (\(2\leq k\leq T\)) such that, \[\begin{align} h(w,V)=2 \sum_{k=2}^{T} r_{k,V}(w){\alpha_V(w)}^{(k)} \end{align}\] As a result, by the fact that every sub gradient of \(b_{k,V}(w)\in \partial \left( {\alpha_V(w)}^{(k)}\right)\) is either 0 or \(\lambda_1 u_1 +\lambda_2 u_2+\ldots+\lambda_p u_p\) for \(\sum_{i}\lambda_i\leq 1\), such that for all every \(j,k\), \(u_j\in U\) and \({\alpha_V(w)}^{(k)}=\langle u_j,\vecpart{w}^{k}\rangle\), combining by the facts that for distinct \(k,k'\), \(r_{k,V},r_{k',V}\) are orthogonal, it holds, for \(u_j^2,\ldots u_j^{T}\in U\) such that for every \(k\), \({\alpha_V(w)}^{(k)}=\langle u_j^k,{w}^{(k)}\rangle\), \[\begin{align} \|h(w,V)\|&=\|2 \sum_{k=2}^{T} r_{k,V}(w){\alpha_V(w)}^{(k)}\rangle\| \\&=\|2 \sum_{k=2,b_{k,V}}^{T} r_{k,V}(w){\alpha_V(w)}^{(k)}\rangle\| \\&= 2\|\sum_{k=2}^{T} r_{k,V} \langle u_j^k,{w}^{(k)}\rangle\|. \end{align}\] Now, we denote \(c_j^k(w)\in R^d\) the vector with \({c_j^k(w)}^{(k)}=u_j^k\) and for \(j\neq k\), \({c_j^k(w)}^{(j)}=0\), and, \[\begin{align} \|h(w,V)\|&=2\|\sum_{k=2}^{T} r_{k,V} \langle c_j^k,w\rangle\| \\&\leq 2\sqrt{\langle \sum_{k=2}^{T} r_{k,V} \langle c_j^k,w\rangle, \sum_{l=2}^{T} r_{l,V} \langle c_j^l,w\rangle\rangle} \\&= 2\sqrt{\sum_{k=2}^{T}\|r_{k,V}\|^2 \langle c_j^k ,w\rangle^2} \\&\leq 2\sqrt{\sum_{k=2}^{T}\langle u_j^k ,{w}^{(k)}\rangle^2} \\&=2\sqrt{\sum_{k=2}^T{{\alpha_V(w)}^{(k)}}^{2}}. \end{align}\] The lemma follows. ◻
In this section we describe the dynamics of GD when applied on \(\widehat{F}\) for training set \(S\) that is sampled from a distribution \(\mathcal{D}\). We begin with showing that the good event \(\cE\) (10 ) occurs with a constant probability.
of 3. By the fact that every \(V_i\) and \(j_i\) are independent, it is enough to show that \[\Pr\left(\bigcup_{i=1}^nV_i\neq U_{d '}\right)\geq\frac{1}{2},\]and,\[\Pr\left(\text{for every k\neq l, j_k\neq j_l}\right)\geq \frac{1}{3}.\] For the former, for every \(u\in U_{d'}\), since \(V_i\) are sampled independently and every vector \(u\in U_{d'}\) is in every \(V_i\) with probability \(\frac{1}{2}\), \[\begin{align} \Pr\left(u \in\bigcup_{i=1}^nV_i \right)&= 1-\Pr\left(u \notin\bigcup_{i=1}^nV_i \right)=1-2^{-n}, \end{align}\] thus, since by 1, \(|U_{d'}|\geq \frac{d'}{178}=n\) , it holds that, \[\begin{align} \Pr\left(\bigcup_{i=1}^nV_i =U_{d'} \right) &= \Pr\left(\forall u\in U_{d'} \;u \in\bigcup_{i=1}^nV_i \right) \\ &= \left(1-2^{-n}\right)^{|U_{d'}|} \\&\leq \left(1-2^{-n}\right)^{2^\frac{d'}{178}} \\&= \left(1-2^{-n}\right)^{2^n} \\ &\leq \frac{1}{e} \\&<\frac{1}{2} . \end{align}\] We conclude, \[\Pr\left(\bigcup_{i=1}^nV_i\neq U_{d'}\right)\geq \frac{1}{2} .\] For the latter, since all \(j_i\)s are sampled independently, for a single pair \(k\neq l\), it holds that \[\Pr(j_k\neq j_l)=1-\frac{1}{n^2}\] As a result, \[\Pr\left(\text{for every k\neq l, j_k\neq j_l}\right)=\left(1-\frac{1}{n^2}\right)^{\frac{n(n-1)}{2}}\geq \left(1-\frac{1}{n^2}\right)^\frac{n^2}{2}\geq \frac{1}{\sqrt{2e}}\geq \frac{1}{e}. \qedhere\] ◻
From now on, we analyze the dynamics of the GD conditioned on \(\cE\) (10 ). We begin with several lemmas.
of 5. For the first part, we know that, for every \(2\leq k\leq T\), \({w}^{(k)}=c\eta u_0\) for \(c\leq \frac{1}{2}\). In addition, by the facts that \(u_0\in U\setminus \bigcup_{i=1}^n V_i\) and that for every \(u\neq v\in U\), it holds that \(\langle u,v\rangle\leq \frac{1}{8}\), we get for every \(i\), \(\max_{u\in V_i}\langle u_0,u\rangle\leq \frac{1}{8}\), thus, for every \(i\) and \(k\geq 2\), \[\begin{align} \max_{u\in V_i} u{w}^{(k)}=\max_{u\in V_i}\langle u,c\eta u_{0}\rangle \leq\frac{1}{8}\cdot c\eta\leq\frac{\eta}{16}. \end{align}\]
For the second part, for every sub-gradient \(g(w,V_i)\in \partial \ell_1(w,V_i)\), there exists a sub gradient \(h(w,V_i)\in \partial\left(\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u{w}^{(k)}\rangle \right)^2\right)\) such that \[\begin{align} g(w,V_i)= \frac{h(w,V_i)}{2\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u{w}^{(k)}\rangle \right)^2}} . \end{align}\] Then, since for every \(k\), it holds that \(\max_{u\in U} \langle {w}^{(k)}, u_0 \rangle\leq \frac{\eta}{16}\), every such sub-gradient \(h(w,V_i)\) is zero, \(\nabla \ell_{1}(w,V_i)=0\). ◻
of 6. First, for the first part, by 17, the fact that for every \(\psi\), \(\|\alpha(\psi)\|\leq 1\), and by \(\|{w}^{(1)}\|\leq \eta\), for every \(\psi\in \Psi\), \(\psi^*=\frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i})\) holds, \[\begin{align} \langle{w}^{({{0}})}, \psi^*\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi^*), {w}^{(1)}\rangle &\geq \langle\frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_{i}), \psi^*\rangle - \frac{\eta \epsilon}{4} \\&\geq \eta\langle\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_{i}), \psi^*\rangle - \frac{\eta \epsilon}{4} \\&\geq \eta\langle\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_{i}), \psi\rangle +\eta\epsilon -\frac{\eta \epsilon}{4} } \\&= \eta\langle\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_{i}), \psi\rangle +\frac{\eta\epsilon}{2}+\frac{\eta \epsilon}{4} \\&> \langle{w}^{({{0}})}, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w}^{(1)}\rangle + \frac{\eta\epsilon}{4}, \end{align}\] thus, \[\begin{align} \arg\max_{\psi\in \Psi} \left(\langle{w}^{({{0}})}, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w}^{(1)}\rangle\right)=\psi^*=\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_{i}). \end{align}\] For the second part, by the fact that \(\epsilon<\frac{1}{n}\) and 17, \[\begin{align} \langle{w}^{({{0}})}, \psi^*\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi^*), {w}^{(1)}\rangle \geq \frac{7\eta}{8n}-\frac{\eta}{4n} > \frac{\eta}{2n}+\frac{\eta}{16n}=\delta_1+\frac{\eta}{16n}. \end{align}\] Now, by \(\cE\), for \(u_0=\alpha(\psi^*)\), which is the \(u\) with the minimal index in \(U\setminus\bigcup_{i=1}^n V_i\), \[\begin{align} \alpha(\psi^*)=u_0\in U\setminus\bigcup_{i=1}^n V_i. \end{align}\] As a result, by the fact that the maximum is attained uniquely at \(\psi^*\), we derive that, \[\begin{align} {\nabla \ell_{3}(w)}^{(k)}=\begin{cases} \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i}) &\quad k={0}\\ -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] ◻
of 7. We show that the maximum is attained uniquely at \(k=m\) and \(u=u_0\). For \(k=1\) and every \(u\in U\), \[\begin{align} \frac{3}{8}\langle u,{w_t}^{(1)}\rangle-\frac{1}{2}\langle u,{w_t}^{(2)}\rangle=\frac{3}{8}\langle u,c\eta u_0\rangle-\frac{1}{2}\langle u,\frac{\eta}{8}u_0\rangle\leq \frac{9\eta}{512}+\frac{\eta}{128}=\frac{13\eta}{512}. \end{align}\] Moreover, for every \(2\leq k\leq m-2\) and every \(u\in U\), \[\begin{align} \frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle u,{w}^{(k+1)}\rangle=\frac{3}{8}\langle u,\frac{\eta}{8}u_{0}\rangle-\frac{1}{2}\langle u,\frac{\eta}{8}u_{0}\rangle\leq \frac{3\eta}{64}+\frac{\eta}{128}=\frac{7\eta}{128}. \end{align}\] For \(k= m-1\) and every \(u\in U\), \[\begin{align} \frac{3}{8}\langle u,{w}^{(m-1)}\rangle-\frac{1}{2}\langle u,{w}^{(m)}\rangle=\frac{3}{8}\langle u,\frac{\eta}{8}u_{0}\rangle-\frac{1}{2}\langle u,\frac{\eta}{2}u_{0}\rangle\leq \frac{3\eta}{64}+\frac{\eta}{32}=\frac{5\eta}{64}. \end{align}\] For \(k=m\) and \(u=u_{0}\), \[\begin{align} \frac{3}{8}\langle u,{w}^{(m)}\rangle-\frac{1}{2}\langle u,{w}^{(m+1)}\rangle=\frac{3}{8}\langle u_0,\frac{\eta}{2}u_{0}\rangle-\frac{1}{2}\langle u_0,0\rangle= \frac{3\eta}{16}. \end{align}\] For \(k=m\) and \(u\neq u_0\), \[\begin{align} \frac{3}{8}\langle u,{w}^{(m)}\rangle-\frac{1}{2}\langle u',{w}^{(m+1)}\rangle=\frac{3}{8}\langle u,\frac{\eta}{2}u_{0}\rangle-\frac{1}{2}\langle u',0\rangle\leq \frac{3\eta}{128}. \end{align}\] For every \(m+1\leq k< T-1\) and every \(u\in U\), \[\begin{align} \frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle u',{w}^{(k+1)}\rangle=0. \end{align}\] Moreover, since \(T\geq 4,\eta<1,\epsilon<1\), \(\delta_1\leq \frac{3\eta}{1024}\), and \[\frac{3}{8}\langle u,{w}^{(m)}\rangle-\frac{1}{2}\langle u,{w}^{(m+1)}\rangle=\frac{3\eta}{16}>\delta_2+\frac{\eta}{64}.\] We derive that, \[\begin{align} {\nabla \ell_4(w)}^{(k)}= \begin{cases} \frac{3}{8}u_0 &\quad k=m\\ -\frac{1}{2}u_0 &\quad k=m+1\\ 0 & \text{otherwise} .\end{cases} \end{align}\] ◻
Lemma 18. Under the conditions of 3, if \(\cE\) occurs and \(w_t\) is the iterate of Unprojected GD on \(\widehat{F}\), with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), then, for \(t=2\) it holds that, \[\begin{align} {w_2}^{(k)}=\begin{cases} \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0}\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
Proof. For \(t=1\), \(w_1=0\). By 5 we know that for every \(i\), \(\nabla\ell_{1}(w_1,V_i)=0\). Moreover, by the fact that \(\delta_1,\delta_2>0\) the maximum in \(\ell_3\) and \(\ell_4\) is attained in \(\delta_1\) and \(\delta_2\), respectively, thus we get that \[\nabla\ell_{3}(w_1)=\nabla\ell_{4}(w)=0\] As a result, \[\begin{align} {\nabla \widehat{F}(w_1)}^{(k)}=\frac{1}{n}\sum_{i=1}^n{\nabla \ell_{2}(w_1,(V_i,j_i))}^{(k)}=\begin{cases} -\frac{1}{n}\sum_{i=1}^n(V_i,j_{i}) &\quad k={0}\\ 0 &\quad \text{otherwise}, \end{cases} \end{align}\] and, \[\begin{align} {w_2}^{(k)}=\begin{cases} \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0}\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] ◻
Lemma 19. Under the conditions of 3, if \(\cE\) occurs and \(w_t\) is the iterate Unprojected GD on \(\widehat{F}\), with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), then, for \(t=3\) it holds that, \[\begin{align} {w_3}^{(k)}= \begin{cases} \frac{\eta}{4}\frac{\epsilon}{T^2}u_0&\quad k=1\\ 0 &\quad 2\leq k\leq T\\ \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0} ,\end{cases} \end{align}\]where \(u_0\in U \setminus \bigcup_{i=1}^n V_i\).
Proof. By 18, \({w_2}^{(1)},...{w_2}^{(T)}=0\), thus, by 5, we know that for every \(i\), \(\nabla \ell_{1}(w_1,V_i)=0\). Moreover, by the fact that \(\delta_2>0\), we get that \(\nabla \ell_{4}(w_2)=0\). For \(\ell_{3}(w_2)\), by 6, using the fact that \({w_2}^{(1)}=0\) and \({w_{2}}^{({{0}})}=\frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i)\), we get that \[\begin{align} {\nabla \ell_{3}(w_2)}^{(k)}=\begin{cases} \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i}) &\quad k={0}\\ -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
For \(\ell_{2}(w_2)\), for every \(i\), the gradient is \[\begin{align} {\nabla \ell_{2}(w_2,(V_i,j_i))}^{(k)}=\begin{cases} -\phi(V_i,j_{i}) &\quad k={0}\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
Combining all together, we conclude that, for \(u_0\in U\setminus \bigcup_{i=1}^{n}V_{i}\), it holds that, \[\begin{align} {\nabla \widehat{F}(w_2)}^{(k)}= \begin{cases} -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ 0 &\quad 2\leq k\leq T \\ 0 &\quad k={0} ,\end{cases} \end{align}\] and \[\begin{align} {w_3}^{(k)}= \begin{cases} \frac{\eta}{4}\frac{\epsilon}{T^2}u_0&\quad k=1\\ 0 &\quad 2\leq k\leq T\\ \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0} .\end{cases} \end{align}\] ◻
Lemma 20. Under the conditions of 3, if \(\cE\) occurs and \(w_t\) is the iterate Unprojected GD on \(\widehat{F}\), with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), then, for \(t=4\) it holds that, \[\begin{align} {w_4}^{(k)}= \begin{cases} -\frac{3\eta}{8}u_0+\frac{\eta}{2}\frac{\epsilon}{T^2}u_0&\quad k=1\\ \frac{\eta}{2}u_0 &\quad k=2\\ 0 &\quad 3\leq k\leq T \\ \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0} ,\end{cases} \end{align}\] where \(u_0\in U\setminus \bigcup_{i=1}^n V_i\).
Proof. We start with \(\ell_{1},\ell_{2},\ell_{3}\). For \(\ell_1\), by 19, for every \(2\leq k\leq T\), \({w_3}^{(k)}=0\), thus, by 5, we know that for every \(i\), \(\nabla\ell_{1}(w_1,V_i)=0\). For \(\ell_2\), we know that, for every \(i\), \[\begin{align} {\nabla \ell_{2}(w_3,(V_i,j_i))}^{(k)}=\begin{cases} - \phi(V_i,j_{i}) &\quad k={0}\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] For \(\ell_{3}\), by 6, using the fact that \({w_3}^{(1)}=c\eta u_0\) for \(|c|\leq1\) and \({w_{3}}^{({{0}})}=\frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i)\), we get that, \[\begin{align} {\nabla \ell_{3}(w_3)}^{(k)}=\begin{cases} \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i}) &\quad k={0}\\ -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
Now, for \(\ell_{4}\), we show that the maximum is attained uniquely in \(k=1\) and \(u=u_0\): For \(k\neq 1\), for every \(u\in U\) \[\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle u,{w_3}^{(k+1)}\rangle=0.\] For \(k=1\) and \(u\neq u_0\), \[\begin{align} \frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle u,{w_3}^{(k+1)}\rangle&=\frac{3}{8}\langle u,{w_3}^{(1)}\rangle-\frac{1}{2}\langle u,{w_3}^{(2)}\rangle\\&=\frac{3}{8}\langle u,\frac{\eta}{4}\frac{\epsilon}{T^2}u_0\rangle \\&\leq \frac{3\eta}{256}\frac{\epsilon}{T^2} \end{align}\] For \(k=1\) and \(u= u_0\), \[\begin{align} \frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle u,{w_3}^{(k+1)}\rangle&=\frac{3}{8}\langle u_0,{w_3}^{(1)}\rangle-\frac{1}{2}\langle u_0,{w_3}^{(2)}\rangle\\&=\frac{3}{8}\langle u_0,\frac{\eta}{4}\frac{\epsilon}{T^2}u_0\rangle \\&= \frac{3\eta}{32}\frac{\epsilon}{T^2}\\&>\delta_2 \end{align}\] We derive that, \[\begin{align} {\nabla \ell_4(w_3)}^{(k)}= \begin{cases} \frac{3}{8}u_0 &\quad k=1\\ -\frac{1}{2}u_0 &\quad k=2\\ 0 &\quad 3\leq k\leq T \\ 0 &\quad k={0} .\end{cases} \end{align}\] Combining all together, we get that, \[\begin{align} {\nabla \widehat{F}(w_3)}^{(k)}= \begin{cases} \frac{3}{8}u_0 -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ -\frac{1}{2}u_0 &\quad k=2\\ 0 &\quad 3\leq k\leq T \\ 0 &\quad k={0} ,\end{cases} \end{align}\] and \[\begin{align} {w_4}^{(k)}= \begin{cases} -\frac{3\eta}{8}u_0+\frac{\eta}{2}\frac{\epsilon}{T^2}u_0&\quad k=1\\ \frac{\eta}{2}u_0 &\quad k=2\\ 0 &\quad 3\leq s\leq T \\ \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0} ,\end{cases} \end{align}\] where \(u_0\in U\setminus \bigcup_{i=1}^n V_i\). ◻
Lemma 21. Under the conditions of 3, if \(\cE\) occurs and \(w_t\) is the iterate Unprojected GD on \(\widehat{F}\), with step size \(\eta\leq\frac{1}{\sqrt{T}}\) and \(w_1=0\), then, for \(t=5\) it holds that, \[\begin{align} {w_{5}}^{(k)}=\begin{cases} -\frac{3}{8}\eta u_{0}+ \frac{3\eta}{4}\frac{\epsilon}{T^2}u_0 & k=1\\ \frac{1}{8}\eta u_{0} &\quad k=2 \\ \frac{1}{2}\eta u_{0} &\quad k=3 \\ 0 &\quad 4\leq s\leq T \\ \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) & k={0}, \end{cases} \end{align}\] where \(u_0\in U \setminus \bigcup_{i=1}^n V_i\).
Proof. We begin with \(\ell_{1},\ell_{2},\ell_{3}\). Note that, by 20, for every \(2\leq k\leq T\), \({w_4}^{(k)}=c\eta u_0\) for \(c\leq\frac{1}{2}\), thus, by 5, for every \(i\), \(\nabla \ell_{1}(w_4, V_i)=0\). For \(\ell_2\), we know that, for every \(i\), \[\begin{align} {\nabla \ell_{2}(w_4,(V_i,j_i))}^{(k)}=\begin{cases} - \phi(V_i,j_{i}) &\quad k={0}\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\] For \(\ell_{3}\), by 6, using 20, where we showed that \({w_4}^{(1)}=c\eta u_0\) for \(|c|\leq1\) and \({w_{4}}^{({{0}})}=\frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i)\), we get that, \[\begin{align} {\nabla \ell_{3}(w_4)}^{(k)}=\begin{cases} \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_{i}) &\quad k={0}\\ -\frac{1}{4}\frac{\epsilon}{T^2}u_0 &\quad k=1\\ 0 &\quad \text{otherwise}. \end{cases} \end{align}\]
It is left to calculate \(\nabla \ell_{4}(w_4)\). We show that the maximum is attained uniquely at \(k=2\) and \(u=u_0\). First, \[\begin{align} \frac{3}{8}\langle u,\frac{\eta}{2}\frac{\epsilon}{T^2} u_0\rangle= \frac{3\eta}{16}\frac{\epsilon}{T^2}\langle u,u_0\rangle \leq \frac{3\eta}{16T^2}, \end{align}\] thus, since \(T\geq 4\), \[\begin{align} \frac{3}{8}\langle u,{w_4}^{(1)}\rangle-\frac{1}{2}\langle u,{w_4}^{(2)}\rangle=\frac{3}{8}\langle u,-\frac{3\eta}{8}u_0+\frac{\eta}{2}\frac{\epsilon}{T^2}u_0\rangle-\frac{1}{2}\langle u,\frac{\eta}{2}u_0\rangle\leq \frac{9\eta}{512}+\frac{\eta}{32}+\frac{9\eta}{256}=\frac{43\eta}{512}<\frac{3\eta}{16}. \end{align}\] For \(k=2\) and \(u=u_{0}\), \[\begin{align} \frac{3}{8}\langle u,{w_4}^{(2)}\rangle-\frac{1}{2}\langle u,{w_4}^{(3)}\rangle=\frac{3}{8}\langle u_0,\frac{\eta}{2}u_{0}\rangle-\frac{1}{2}\langle u_0,0\rangle= \frac{3\eta}{16}(> \delta_2). \end{align}\] For \(k=2\) and \(u\neq u_{t-2}\), \[\begin{align} \frac{3}{8}\langle u,{w_4}^{(2)}\rangle-\frac{1}{2}\langle u',{w_3}^{(3)}\rangle=\frac{3}{8}\langle u,\frac{\eta}{2}u_{0}\rangle-\frac{1}{2}\langle u,0\rangle\leq \frac{3\eta}{128}. \end{align}\] For every \(3\leq k\leq T-1\), \[\begin{align} \frac{3}{8}\langle u,{w_4}^{(k)}\rangle-\frac{1}{2}\langle u',{w_4}^{(k+1)}\rangle=0. \end{align}\] We derive that, \[\begin{align} {\nabla \ell_4(w_4)}^{(k)}= \begin{cases} \frac{3}{8}u_0 &\quad k=2\\ -\frac{1}{2}u_0 &\quad k=3\\ 0 &\quad 3\leq k\leq T \\ 0 &\quad k={0} .\end{cases} \end{align}\] Combining all together, we get that, \[\begin{align} {\nabla \widehat{F}(w_4)}^{(k)}=\begin{cases} -\frac{1}{4}\frac{\epsilon}{T^2} u_{0} & k=1\\ \frac{3}{8} u_{0} &\quad k=2 \\ -\frac{1}{2} u_{0} &\quad k=3 \\ 0 &\quad 4\leq k\leq T \\ 0 & k={0} \end{cases} \end{align}\] and \[\begin{align} {w_{5}}^{(k)}=\begin{cases} -\frac{3}{8}\eta u_{0}+ \frac{3\eta}{4}\frac{\epsilon}{T^2}u_0 & k=1\\ \frac{1}{8}\eta u_{0} &\quad k=2 \\ \frac{1}{2}\eta u_{0} &\quad k=3 \\ 0 &\quad 4\leq s\leq T \\ \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) & k={0}, \end{cases} \end{align}\] where \(u_0\in U \setminus \bigcup_{i=1}^n V_i\). ◻
Lemma 22. Assume the conditions of 3, and consider the iterates of unprojected GD on \(\widehat{F}\), with step size \(\eta \leq \ifrac{1}{\sqrt{T}}\) initialized at \(w_1=0\). Under the event \(\cE\), we have for all \(t\in[T]\) that \[\|w_t\|\leq1.\]
Proof. If \(\cE\) holds, by 18 19 20 4, we know that for every \(t\geq 2\), \(\|{w_t}^{(1)}\|\leq \frac{\eta}{2}\), \(\|{w_t}^{(t-1)}\|\leq \frac{\eta}{2}\) and for every \(k\in\{2,\ldots,t-2\}\), \(\|{w_t}^{(t-1)}\|\leq \frac{\eta}{8}\). As a result, \[\begin{align} \norm{w_t}^2 &\leq \sum_{i=1}^d w_t[i]^2 \\&\leq \sum_{k=0}^T \|{w_t}^{(k)}\|^{2} \\&< 2\cdot \left(\frac{\eta}{2}\right)^{2}+ (T-3)\left(\frac{\eta}{8}\right)^{2}+\norm[2]{ \frac{\eta}{n}\sum_{i=1}^n\phi(V_i,j_i) }^2 \\&\leq \frac{\eta^2}{2} + \frac{\eta^2(T-3)}{64}+\eta^2 \\&\leq \frac{1}{64}+\frac{3}{2T} {\sqrt{T}}} \\&\leq 1 \end{align}\] ◻
of 3. By 3, with probability of at least \(\frac{1}{6}\), \(\cE\) occurs and by 4, it holds for every \(2\leq k\leq T-3\) that, \[\begin{align} \label{suff95exp} {w_{T,m}}^{(k)}=\frac{1}{m}\sum_{i=1}^m{w_{T-i+1}}^{(k)}&=\begin{cases} \frac{\eta}{8}u_0 & k\leq T-m-2\\ \frac{1}{m}\left(\frac{\eta}{2}+\frac{\eta}{8}(T-k-2)\right)u_0 & k\geq T-m-1 \end{cases} \\&=\begin{cases} \frac{\eta}{8} u_0& k\leq T-m-2\\ \frac{\eta(T-k+2)}{8m}u_0 & k\geq T-m-1 \end{cases} \notag \end{align}\tag{15}\] Then, we denote \(\mathbb{\alpha}_V\in \R^{T-4}\) the vector which its \(k\)th entry is \(\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k+1)}\rangle \right)\). By the fact that every vector \(u\in U\) is in \(V\) with probability \(\frac{1}{2}\), the following holds, \[\begin{align} \E_V\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right)^2}&\geq \E_V\sqrt{\sum_{k=2}^{T-3}\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right)^2} \\&= \E_V\sqrt{\sum_{k=1}^{T-4}\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k+1)}\rangle \right)^2} \\&=\E_V \|\alpha_V\| \\&\geq \|\E_V \alpha_V\| \\&=\sqrt{\sum_{k=2}^{T-3 }\left(\E_V \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right) \right)^2} \end{align}\] Then, by 15 , \[\begin{align} &\E_V\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right)^2}\\&\geq \sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right) \right)^2+\sum_{k=T-m-1}^{T-3 }\left(\E_V \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right) \right)^2} \\&\geq \sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,\frac{\eta}{8}u_0\rangle \right) \right)^2+\sum_{k=T-m-1}^{T-3 }\left(\E_V \max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,\frac{\eta(T-k+2)}{8m}u_0\rangle \right) \right)^2} \\&= \frac{\eta}{8}\sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3}{4}, \max_{u\in V} \langle u,u_0\rangle \right) \right)^2+\sum_{k=T-m-1}^{T-3 }\left(\E_V \max\left(\frac{3}{4}, \frac{T-k+2}{m} \max_{u\in V} \langle u,u_0\rangle \right) \right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3}{4}, \max_{u\in V} \langle u,u_0\rangle \right) \right)^2+\sum_{k=T-m-1}^{T-3 }\left(\E_V \max\left(\frac{3}{4}, \frac{T-k+2}{T} \max_{u\in V} \langle u,u_0\rangle \right) \right)^2} \\&= \frac{\eta}{8}\sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3}{4}, \max_{u\in V} \langle u,u_0\rangle \right) \right)^2+\sum_{k=1}^{m-1 }\left(\E_V \max\left(\frac{3}{4}, \frac{k+4}{T} \max_{u\in V} \langle u,u_0\rangle \right) \right)^2} \end{align}\] Now, treating each of the term separately, with probability \(\frac{1}{2}\) on \(V\), \(\max_{u\in V} \langle u,u_0\rangle\leq \frac{1}{8}\) (otherwise it is \(1\)), thus, \[\begin{align} \E_V \max\left(\frac{3}{4}, \max_{u\in V} \langle u,u_0\rangle \right)=\frac{1}{2}\cdot \frac{3}{4} + \frac{1}{2}\cdot 1=\frac{7}{8} \end{align}\] Moreover, if \(k\leq \frac{3T}{4}-4\) \[\begin{align} \E_V \max\left(\frac{3}{4}, \frac{k+4}{T}\max_{u\in V} \langle u,u_0\rangle \right)=\frac{3}{4}, \end{align}\] otherwise, \[\begin{align} \E_V \max\left(\frac{3}{4}, \frac{k+4}{T}\max_{u\in V} \langle u,u_0\rangle \right)&\geq\frac{1}{2}\max\left(\frac{3}{4}, \frac{k+4}{T}\right)+ \frac{1}{2}\cdot \frac{3}{4} \\&\geq \frac{3}{8}+ \frac{k+4}{2T} \end{align}\] Then, we get, if \(m\geq T-3\), (note that it implies \(l-1 \geq \frac{3T}{4}-4\)), \[\begin{align} &\E_V\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right)^2}\\&\geq \frac{\eta}{8}\sqrt{\sum_{k=1}^{m-1 }\left(\E_V \max\left(\frac{3}{4}, \frac{k+4}{T} \max_{u\in V} \langle u,u_0\rangle \right) \right)^2} \\&\geq\frac{\eta}{8}\sqrt{\sum_{k:1\leq k\leq \frac{3T}{4}-4}\frac{9}{16} +\sum_{k:\frac{3T}{4}-4< k\leq m-1}\left( \frac{3}{8}+ \frac{k+4}{2T}\right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k:1\leq k\leq \frac{3T}{4}-4}\frac{9}{16} +\sum_{k:\frac{3T}{4}< k\leq T}\left( \frac{3}{8}+ \frac{k}{2T}\right)^2} \\&\geq \frac{\eta}{8}\sqrt{\frac{27T-144}{64} +\sum_{k:\frac{3T}{4}< k\leq T}\left( \frac{9}{64}+ \frac{3k}{8T}\right)} \\&\geq \frac{\eta}{8}\sqrt{\frac{27T-144}{64} +\left( \frac{9T}{256}+ \frac{3}{8T}\sum_{k:\frac{3T}{4}< k\leq T}k \right)} \\&\geq \frac{\eta}{8}\sqrt{\frac{27T-144}{64} +\left( \frac{9T}{256}+ \frac{3T^2}{16T}-\frac{3(\frac{3T}{4}+1)^2}{16T} \right)} {2}\leq\sum_{i=1}^ni^2\leq \frac{(i+1)^2}{2}} \\&= \frac{\eta}{8}\sqrt{\frac{27T-144}{64} +\left( \frac{9T}{256}+\frac{3T}{16}-\frac{27T}{256}-\frac{3}{16T}-\frac{9}{32} \right)} \\&= \frac{\eta}{8}\sqrt{\frac{148T}{256}-\frac{45}{32} -\frac{3}{16T} } \\&\geq \frac{\eta}{8}\sqrt{\frac{147T}{256}}{32}+\frac{3}{16T}\leq \frac{T}{256}} \\&\geq \frac{3\eta}{32}\cdot \frac{101\sqrt{T}}{100}. \end{align}\] Otherwise, if \(m< T-4\), by similar arguments, \[\begin{align} &\E_V\sqrt{\sum_{k=2}^T\max\left(\frac{3\eta}{32}, \max_{u\in V} \langle u,{w_{T,m}}^{(k)}\rangle \right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k=2}^{T-m-2}\left(\E_V \max\left(\frac{3}{4}, \max_{u\in V} \langle u,u_0\rangle \right) \right)^2+\sum_{k=T-m-1}^{T-3 }\left(\E_V \max\left(\frac{3}{4}, \frac{T-k+2}{T} \max_{u\in V} \langle u,u_0\rangle \right) \right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k=2}^{T-m-2}\left(\frac{7}{8}\right)^2+\sum_{k:1\leq k\leq \frac{3T}{4}-4}\frac{9}{16} +\sum_{k:\frac{T}{2}< k\leq m+3}\left( \frac{3}{8}+ \frac{k}{2T}\right)^2} \\&= \frac{\eta}{8}\sqrt{\sum_{k=m+4}^{T}\left(\frac{7}{8}\right)^2+\sum_{k:1\leq k\leq \frac{3T}{4}-4}\frac{9}{16} +\sum_{k:\frac{T}{2}< k\leq m+3}\left( \frac{3}{8}+ \frac{k}{2T}\right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k:1\leq k\leq \frac{3T}{4}-4}\frac{9}{16} +\sum_{k:\frac{3T}{4}< k\leq T}\left( \frac{3}{8}+ \frac{k}{2T}\right)^2} {8}+\frac{k}{2T}\leq \frac{7}{8}} \\&\geq \frac{3\eta}{32}\cdot \frac{101\sqrt{T}}{100}. \end{align}\] Moreover, we notice that for every \(t\), \(\ell_2(w_t)\geq-\|{w_{t}}^{({{0}})}\|\geq -\eta\), \(\ell_3(w_t)\geq \delta_1\) and \(\ell_4(w_t)\geq \delta_2\), thus, it holds that, \[\begin{align} F(w_{T,l})\geq \frac{303\eta}{3200}\sqrt{T}+\delta_1+\delta_2-\eta &\geq \eta\left(\frac{303}{3200}\sqrt{T}-1\right) \end{align}\] and \[\begin{align} F(w_*)&\leq \frac{3\eta}{32}\sqrt{T}+\eta \end{align}\] Then, with probability of at least \(\frac{1}{6}\), \[\begin{align} F(w_{T,l})-F(w_*) &\geq \eta (\frac{303}{3200}\sqrt{T}-2-\frac{3}{32}\sqrt{T}) \\&\geq \eta (\frac{303}{3200}\sqrt{T}-\frac{302}{3200}\sqrt{T}) {3200}\sqrt{T}} \\&= \frac{\eta}{3200}\sqrt{T}. \end{align}\] ◻
Lemma 23. Let \(n\), a set \(U\in \R^d\). Let \(P(U)\) be the power set of U. Then, there exist sets \(\{\Psi_1,...\Psi_n\}\subseteq \R^{2n}\), a number \(0<\epsilon<\frac{1}{n}\) and two mappings \(\phi:P(U) \times [n]\to \R^{2n}\), \(\alpha:\R^{2n}\to U\) such that,
For every \(j\in[n]\) and \(V\subseteq U\), \(\|\phi\left(V,j\right)\|\leq 1\).
For every \(k\), \(\psi\in\Psi_k\), \(\|\alpha(\psi)\|\leq 1,\|\psi\|\leq 1\).
Let \(V_1,\ldots,V_k\subseteq U\). Then, for every \(k\), \(\psi^*_k=\frac{1}{n}\sum_{i=1}^k\phi(V_i,i)\) holds,
For every \(\psi\in \Psi_k\), \(\psi\neq \psi^*_k\): \[\langle \psi^*_k, \frac{1}{n}\sum_{i=1}^k\phi(V_i,i)\rangle \geq \langle \psi, \frac{1}{n}\sum_{i=1}^k\phi(V_i,i)\rangle + \epsilon ;\]
If \(\bigcap_{i=1}^kV_i\neq \emptyset\) and \(m=\argmin_{i}\{i:v_i \in \bigcap_{i=1}^kV_i\)}, then \(\alpha(\psi^*)=v_m\in \bigcap_{i=1}^kV_i\).
of 23. The construction is similar to 17. First, we consider an arbitrary enumeration of \(P(U)=\{V^1,...V^{|P(U)|}\}\) and define \(g:P(U)\to \R^2\), \(g(V^i)= \left(\sin\left(\frac{2\pi i}{|P(U)|}\right),\cos\left(\frac{2\pi i}{|P(U)|}\right)\right)\). Here, we refer to a vector \(a\in \R^{2n}\) as a concatenation of \(n\) vectors in \(\R^2\), \({a}^{(1)},...,{a}^{(n)}\). Then, we define \(\delta=1-\cos\left(\frac{2\pi}{|P(U)|}\right)\), \(\epsilon=\frac{\delta}{n^2}\) and \[{\phi(V,j)}^{(i)}= \left\{ \begin{array}{cc} g(V) & i=j \\ 0 & \text{otherwise} \end{array} \right.\] As a result, for every \(V_i,j\) it holds that \[\begin{align} \|\phi(V^i,j)\|=\|g(V^i)\|=\sqrt{\sin\left(\frac{2\pi i}{|P(U)|}\right)^2+\cos\left(\frac{2\pi i}{|P(U)|}\right)^2}=1 \end{align}\] Moreover, if \(j_1\neq j_2\), \[\begin{align} \langle \phi(V^i,j_1),\phi(V^i,j_2)\rangle =0, \end{align}\] and if \(i>k\), \[\begin{align} \langle \phi(V^i,j),\phi(V^k,j)\rangle=&\langle g(V^i), g(V^k)\rangle \\&=\sin\left(\frac{2\pi i}{|P(U)|}\right)\sin\left(\frac{2\pi k}{|P(U)|}\right) + \cos\left(\frac{2\pi i}{|P(U)|}\right)\cos\left(\frac{2\pi k}{|P(U)|}\right) \\&=\cos\left(\frac{2\pi (i-k)}{|P(U)|}\right) \\&\leq \cos\left(\frac{2\pi}{|P(U)|}\right)\\&=1-\delta \end{align}\] We notice that \(0<\delta< 1\). Now, we consider an arbitrary enumeration of \(U=\{v_1,...v_{|U|}\}\), and define the following sets \(\Psi_1,\ldots\Psi_n\subseteq \R^{2n}\) and the following two mappings \(\sigma: R^{2n}\to P(U), \alpha: R^{2n}\to U\), \[\Psi_k = \{ \frac{1}{n}\sum_{i=1}^k \phi(V_i,i): \forall i\; V_i\;\subseteq U\}\] Note that, for every \(\psi \in \Psi\), \[\|\psi\|=\|\frac{1}{n}\sum_{i=1}^k \phi(V_i,j_i)\|\leq \frac{1}{n}\sum_{i=1}^k \|\phi(V_i,j_i)\|\leq 1.\]
Then, for every \(a\in \R^{2n}\) and \(j\in[n]\), we denote the index \(q(a,j)\in [|P(U)|]\) as \[q(a,j)=\argmax_{r}\langle g(V_r), {a}^{(j)}\rangle,\] and define the following mapping \(\sigma:\R^{2n}\to P(U)\), \[\sigma(a)=\bigcap_{j=1,{a}^{(j)}\neq 0}^{n}V_{q(a,j)}.\] Moreover, for every \(a\in \R^{2n}\), we denote the index \(p(a)\in [|U|]\) as \[p(a)=\argmin_{i}\{i:v_i \in \sigma(a)\},\] and define the following mapping \(\alpha:\R^{2n^2}\to U\), \[\alpha(a)=\left\{\begin{array}{cc} v_{|U|} & \sigma(a)=\emptyset \\ v_{p(a)} & \sigma(a)\neq \emptyset \end{array}\right..\] Note that for every \(a\in \R^{2n}\), \(\alpha(a)\in U\), thus, \(\|\alpha(a)\|\leq 1\).
Now, Let \(V_1,\ldots, V_n\subseteq U\), \(k\in[n]\) and \(\psi^*_k=\frac{1}{n}\sum_{i=1}^k \phi(V_i,i)\). Then, \[\begin{align} \langle \psi^*, \frac{1}{n}\sum_{i=1}^k \phi(V_i,i)\rangle&= \langle \frac{1}{n}\sum_{i=1}^k \phi(V_i,i), \frac{1}{n}\sum_{i=1}^k \phi(V_i,i)\rangle \\&= \frac{1}{n^2}\sum_{i=1}^k\langle \phi(V_i,i),\phi(V_i,i)\rangle \\&= \frac{k}{n^2} \end{align}\] For \(\psi=\frac{1}{n}\sum_{i=1}^k \phi(V'_i,i)\) such that \(\psi\neq \psi^*\), there exists a index \(r\) such that \(V'_r\neq V_r\) ,thus, \[\begin{align} \langle \psi, \frac{1}{n}\sum_{l=1}^k \phi(V_i,i)\rangle&= \langle \frac{1}{n}\sum_{i=1}^k \phi(V'_i,i), \frac{1}{n}\sum_{i=1}^k \phi(V_i,i)\rangle \\&=\frac{1}{n^2}\sum_{i=1}^k\langle \phi(V_i,i),\phi(V'_i,i)\rangle \\&\leq \frac{1}{n^2}\left(1-\delta+\sum_{i=1,i\neq r}^k 1 \right) \\&\leq \frac{1}{n^2}(1-\delta+k-1)\\&= \frac{k}{n^2}-\frac{\delta}{n^2} \\&= \langle \psi^*_k, \frac{1}{n}\sum_{i=1}^n \phi(V_i,j_i)\rangle-\epsilon \end{align}\] Furthermore, it holds that, \({\frac{1}{n}\sum_{i=1}^n\phi(V_i,i)}^{(i)}=\frac{1}{n}g(V_i)\), thus, \[\begin{align} q\left(\frac{1}{n}\sum_{i=1}^k\phi(V_i,i),i\right)&=\argmax_{r}\langle g(V_r), {\frac{1}{n}\sum_{i=1}^k\phi(V_i,i)}^{(i)}\rangle \\&=\argmax_{r}\langle g(V_r), \frac{1}{n}g(V_i)\rangle \\&=i, \end{align}\] thus, we get, \[\begin{align} \sigma (\psi^*)&=\sigma \left(\frac{1}{n}\sum_{i=1}^k\phi(V_i,i)\right)\\ &=\bigcap_{j=1,{\frac{1}{n}\sum_{i=1}^k\phi(V_i,i)}^{(j)}\neq 0}^{n}V_{q({\frac{1}{n}\sum_{i=1}^k\phi(V_i,i)}^{(j)},j)} \\&=\bigcap_{j=1}^{k}V_{q(\frac{1}{n}\sum_{i=1}^k\phi(V_i,i),j)}\\&=\bigcap_{i=1}^{k}V_{i} \end{align}\] Then, assuming that \(\bigcap_{i=1}^kV_i\neq \emptyset\), and let and \(m=\argmin_{i}\{i:v_i \in \bigcap_{i=1}^kV_i\)}, \(p(a)=m\) and, \[\alpha(\psi^*)= v_{m} \in \bigcap_{i=1}^{k}V_{i}.\] ◻
of 8. First, \(\ell^{\text{SGD}}_1\) is convex and \(1\)-Lipschitz by the fact that \(\ell^{\text{SGD}}_1=\ell_1\) and 2. Moreover, by 23, \(\ell^{\text{SGD}}_2\) is a maximum over \(1\)-Lipschitz linear functions, thus, \(\ell^{\text{SGD}}_2\) is convex and \(1\)-Lipschitz. Finally, \(\ell^{\text{SGD}}_3\) is a summation of two \(1\)-Lipschitz linear functions, thus, \(\ell^{\text{SGD}}_3\) is convex and \(2\)-Lipschitz. Combining all together, we get the lemma. ◻
In this section we describe the dynamics of SGD. We begin with showing that the good event \(\cE'\) (12 ) occurs with a constant probability.
of 9. First, by union bound, \[\begin{align} \Pr\left(\forall t\in[n] \;P_t\neq \emptyset \text{ and } J_t \in S_t \right)\geq\frac{1}{2}&=1- Pr\left(\exists t \;P_t= \emptyset \text{ or } J_t \notin S_t \right) \\&\geq 1- \sum_{t=1}^n Pr\left(P_t= \emptyset \text{ or } \left(P_t\neq \emptyset \text{ and }J_t \notin S_t\right) \right) \\&\geq 1- \sum_{t=1}^n \Pr\left(P_t= \emptyset\right) -\sum_{t=1}^n\Pr\left(P_t\neq \emptyset \text{ and }J_t \notin S_t\right) \\&= 1- \sum_{t=1}^n\Pr\left(P_t= \emptyset\right) -\sum_{t=1}^n\Pr\left(P_t\neq \emptyset\right)\Pr\left(J_t \notin S_t | P_t\neq \emptyset\right). \end{align}\] Now, for every \(v_l\in U\), \[\begin{align} \Pr(v_l \notin \bigcap_{i=1}^{t-1} V_i)= 1- \Pr(v_l \notin \bigcap_{i=1}^{t-1} V_i)=1-\delta^{t-1}, \end{align}\] and, \[\begin{align} \Pr\left(v_l \notin S_t \right)=1- (1-\delta)^{n-t+1}\leq 1-(1-\delta)^n. \end{align}\] Then, \[\begin{align} \Pr\left(P_t= \emptyset\right)&=\Pr\left(\bigcap_{i=1}^t V_i =\emptyset\right) \\&= \Pr(\forall v_l\in U \;w\notin \bigcap_{i=1}^t V_i) \\&= (1-\delta^{t-1})^{|U|} \\&\leq (1-\delta^n)^{|U|}. \end{align}\] Moreover, by the fact that for every \(t\), \(P_t\) is independent of \(V_{t+1},...V_n\), \[\begin{align} Pr\left(P_t\neq \emptyset\right)\Pr\left(J_t \notin S_t | P_t\neq \emptyset\right)&= \sum_{l:v_l\in U} \Pr\left(P_t\neq \emptyset\right)\Pr\left(v_l \notin S_t | P_t\neq \emptyset\right)\Pr(J_t=v_l) \\&= \sum_{l:v_l\in U} \Pr\left(P_t\neq \emptyset\right)\Pr\left(v_l \notin S_t \right)\Pr(J_t=v_l) \\&\leq 1- (1-\delta)^n \end{align}\] Combining all of the above, we get that, \[\begin{align} &\Pr(\forall t\in[n] \;P_t\neq \emptyset \text{ and } J_t \in S_t)\\&= 1- \sum_{t=1}^n \Pr\left(P_t= \emptyset\right) -\sum_{t=1}^n\Pr\left(P_t\neq \emptyset\right)\Pr\left(J_t \notin S_t | P_t\neq \emptyset\right) \\&\geq 1- n (1-\delta^n)^{|U|}- n\left(1- (1-\delta)^n\right). \end{align}\] For \(\delta=\frac{1}{4n^2}\), by the fact that \(|U|\geq 2^{\frac{d'}{178}}=2^{4n\log(n)}=n^{4n}\), \[|U|\delta^{n}\geq n^{4n}n^{-2n}4^{-n}\geq n^{2n}4^{-n}\geq \log(4n)\] \[\begin{align} \Pr\left(\forall t\in[n] \;P_t\neq \emptyset \text{ and } J_t \in S_t \right)\geq\frac{1}{2} &\geq 1- n (1-\delta^\frac{n}{500})^{|U|}- n\left(1- (1-\delta)^n\right) \\&\geq 1- n e^{-|U|\delta^\frac{n}{500}}- n\left(1- (1-n\delta)\right) \\&\geq 1- n e^{-\log(4n)}- n^2\delta \\&\geq 1- \frac{1}{4} -\frac{1}{4} \\&= \frac{1}{2} . \end{align}\] ◻
of 11. First, by the fact that for every \(t\leq k\leq T\), \({w}^{(k)}=0\), for every such \(k\), \[\max_{u\in V_t} \langle u,{w}^{(k)}\rangle=0<\frac{3\eta}{32},\] For \(2\leq k\leq t-1\), \({w}^{(k)}=c\eta u_k\), where \(c\leq \frac{1}{2}\) and every \(u_k\in \bigcap_{i=k}^T\overline{V_i}\subseteq \overline{V_{t}}\), thus, \[\max_{u\in V_t} \langle u,{w}^{(k)}\rangle\leq\frac{\eta}{2}\cdot \frac{1}{8}<\frac{3\eta}{32}.\] We derive that \(\nabla \ell^{\text{SGD}}_1(w_t,V_t)= 0\). ◻
of 12. First, we show that the maximum of \(\ell^{\text{SGD}}_2(w,V)\) is attained with \(k=m\) and \(u=u_m\). For \(k\geq m+1\), for every \(u\in U\) and \(\psi\in \Psi_k\), \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle=0 . \end{align}\] For \(k=1\), for every \(u\in U\) and \(\psi\in \Psi_1\), by 23, we know that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), and \(\alpha(\psi)\in U\), thus, \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle \\&=\frac{3c}{8}\langle u_1,u\rangle -\frac{\eta}{16}\langle u_2,\alpha(\psi)\rangle + \langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle - 0+ 0 \\&\leq \frac{9\eta}{512} +\frac{\eta}{128} +\frac{\eta}{4n} \\& < \frac{\eta}{8}. \end{align}\] For \(2\leq k\leq m-2\), for every \(u\in U\) and \(\psi\in \Psi_k\), by 23, we know that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), and \(\alpha(\psi)\in U\), thus, \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle \\&=\frac{3}{64}\langle u_k,u\rangle -\frac{\eta}{16}\langle u_{k+1},\alpha(\psi)\rangle +0 - 0+ 0 \\&\leq \frac{3\eta}{64} +\frac{\eta}{16} \\& < \frac{\eta}{8} . \end{align}\] For \(k= m-1\), for every \(u\in U\) and \(\psi\in \Psi_{k}\), by 23, we know that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), and \(\alpha(\psi)\in U\), thus, \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle \\&=\frac{3}{64}\langle u_k,u\rangle -\frac{\eta}{4}\langle u_{k+1},\alpha(\psi)\rangle +0 - \langle {w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+ \langle {w}^{( {0},k+1)},\frac{1}{4n^2}\phi(V,m)\rangle \\&\leq \frac{3\eta}{64}+\frac{\eta}{32}+\frac{1}{16n^2}+\frac{1}{16n^3} \\& < \frac{\eta}{8} . \end{align}\]
For \(k=m\), \(u\neq u_{m}\) and every \(\psi\in \Psi_{m}\), by 23, we know that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), and \(\alpha(\psi)\in U\), thus, \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle\\&=\frac{3}{8}\langle u,{w}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w}^{({0},k)}\rangle \\&=\frac{3}{8}\langle u,\frac{\eta}{2}u_{m}\rangle+\langle \frac{1}{4n}\psi,{w}^{({0}, k)} \rangle \\&\leq \frac{3\eta}{128}+\frac{\eta}{16n^2}\\&<\frac{\eta}{32} . \end{align}\] For \(k=m\), \(u=u_{m}\) and every \(\psi\in \Psi_{m}\), by 23, we know that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), and \(\alpha(\psi)\in U\), thus, \[\begin{align} &\frac{3}{8}\langle u,{w}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle \\&=\frac{3}{8}\langle u,{w_t}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_t}^{({0},k)}\rangle\\&=\frac{3}{8}\langle u,\frac{\eta}{2}u_{m}\rangle+\langle \frac{1}{4n}\psi,{w_t}^{({0},k)}\rangle \\&\geq \frac{3\eta}{16}-\frac{\eta}{16n^2}\\&>\frac{5\eta}{32} \\&>\delta_1. \end{align}\]
Second, we show that when \(k=m\) and \(u=u_m\), the maximum among \(\psi\in \Psi_{m}\) is attained uniquely in \(\psi^*_{m}=\frac{1}{n}\sum_{t=1}^{m}\phi(V_t,t)\). For any \(\psi\in \Psi_m\), with \(\psi\neq \psi^*_{m}\), by 23, for \(k=m\), \(u=u_m\), \[\begin{align} &\frac{3}{8}\langle u,{w}^{(m)}\rangle-\frac{1}{2}\langle \alpha(\psi^*_{m}),{w}^{(m+1)}\rangle +\langle{w}^{( {0},m)},\frac{1}{4n}\psi^*_{m}\rangle -\langle{w}^{( {0},m+1)},\frac{1}{4n}\psi^*_{m}\rangle+\langle {w}^{({0},m+1)},-\frac{1}{4n^2}\phi(V,m+1)\rangle\\&=\frac{3}{8}\langle u,{w}^{(m)}\rangle+\langle \frac{1}{4n}\psi^*_{m},{w}^{({0},m)}\rangle \\&=\frac{3\eta}{16}+\frac{\eta}{16n^2}\langle \psi^*_{m},\frac{1}{n}\sum_{t=1}^{m}\phi(V_t,t)\rangle \\&\geq \frac{3\eta}{16}+\frac{\eta}{16n^2}\langle \psi,\frac{1}{n}\sum_{t=1}^{m}\phi(V_t,t)\rangle +\frac{\eta\epsilon}{16n^2}\\&= \frac{3}{8}\langle u,{w}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w}^{({0},m)}\rangle +\frac{\eta\epsilon}{16n^2} \\&=\frac{3}{8}\langle u,{w}^{(m)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w}^{(m+1)}\rangle +\langle{w}^{( {0},m)},\frac{1}{4n}\psi\rangle -\langle{w}^{( {0},m+1)},\frac{1}{4n}\psi\rangle+\langle {w}^{({0},m+1)},-\frac{1}{4n^2}\phi(V,m+1)\rangle+\frac{\eta\epsilon}{16n^2} \end{align}\] We derive that, \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w,V)}^{(k)}= \begin{cases} \frac{3}{8} u_{m} &\quad k=m \\ -\frac{1}{2} \alpha(\psi_{m}^*) &\quad k=m+1 \\ 0 &\quad k\notin \{m,m+1\} \end{cases} \end{align}\] \[\begin{align} {\nabla \ell^{\text{SGD}}_2(w,V)}^{({0}, k)}= \begin{cases} \frac{1}{4n^2}\sum_{t=1}^{m}\phi(V_t,t)&\quad k= m \\ -\frac{1}{4n^2}\sum_{t=1}^{m}\phi(V_t,t)-\frac{1}{4n^2}\phi(V,m+1)&\quad k= m+1 \\ 0&\quad k\notin \{m,m+1\}. \end{cases} \end{align}\] ◻
Lemma 24. Under the conditions of 4, if \(\cE'\) occurs and \(w_t\) is the iterate of Unprojected SGD with step size \(\eta\leq\frac{1}{\sqrt{n}}\) and \(w_1=0\), \[\begin{align} {w_2}^{(k)}=\begin{cases} \frac{\eta}{n^3}u_1 &\quad k=1 \\ 0 &\quad k\geq 2 \end{cases}, \end{align}\] and, \[\begin{align} {w_2}^{(0,k)}=\begin{cases} \frac{\eta}{4n^2}\phi(V_1,1) &\quad k=1 \\ 0 &\quad k\neq 1. \end{cases} \end{align}\]
Proof. \(w_1=0\), thus, for every \(k\), \[\max_{u\in V_1} \langle u,{w_1}^{(k)}\rangle=0<\frac{3\eta}{32},\] and we derive that \(\nabla \ell^{\text{SGD}}_1(w_1,V_1)= 0\). By the same argument, \(\nabla \ell^{\text{SGD}}_2(w_1,V_1)= 0\) (where the maximum is attained uniquely in \(\delta_2\)). Moreover, \(\ell^{\text{SGD}}_3\) is a linear function, then, we get that, \[\begin{align} {\nabla \ell^{\text{SGD}}_3(w_1,V_1)}^{(k)}=\begin{cases} -\frac{1}{n^3}u_1 &\quad k=1 \\ 0 &\quad k\geq 2 \end{cases}, \end{align}\] and, \[\begin{align} {\nabla \ell^{\text{SGD}}_3(w_1,V_1)}^{(0,k)}=\begin{cases} -\frac{1}{4n^2}\phi(V_1,1) &\quad k=1 \\ 0 &\quad k\neq 1, \end{cases} \end{align}\] and the lemma follows. ◻
Lemma 25. Under the conditions of 4, if \(\cE'\) occurs and \(w_t\) is the iterate of Unprojected SGD with step size \(\eta\leq\frac{1}{\sqrt{n}}\) and \(w_1=0\), \[\begin{align} {w_3}^{(k)}= \begin{cases} \frac{2\eta}{n^3}u_1-\frac{3\eta}{8}u_{1} &\quad k=1\\ \frac{\eta}{2} u_{2} &\quad k=2 \\ 0 &\quad 3\leq k\leq n \end{cases} \end{align}\] \[\begin{align} {w_3}^{(0,k)}= \begin{cases} \frac{\eta}{4n^2}\phi(V_2,1) &\quad k=1 \\ \frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2)&\quad k=2 \\ 0&\quad k\geq 3. \end{cases} \end{align}\] where \(u_1 \in U\), and \(u_{2}\) holds \(u_{2}\in P_2\cap S_2\).
Proof. First, by the fact that for every \(2\leq k\leq T\), \({w_2}^{(k)}=0\), for every such \(k\), \[\max_{u\in V_2} \langle u,{w_2}^{(k)}\rangle=0<\frac{3\eta}{32},\] and we derive that \(\nabla \ell^{\text{SGD}}_1(w_2,V_2)= 0\).
Moreover, \(\ell^{\text{SGD}}_3\) is a linear function, thus, \[\begin{align} {\ell^{\text{SGD}}_3(w_2,V_2)}^{(k)}=\begin{cases} \frac{\eta}{n^3}u_1 &\quad k=1 \\ 0 &\quad k\geq 2 \end{cases}, \end{align}\] and, \[\begin{align} {\ell^{\text{SGD}}_3(w_2,V_2)}^{(k)}=\begin{cases} \frac{\eta}{4n^2}\phi(V_2,1) &\quad k=1 \\ 0 &\quad k\neq 1. \end{cases} \end{align}\] For \(\ell^{\text{SGD}}_2(w_2,V_2)\), we get by the fact that for every \(k\geq 1\), \({w_2}^{(k+1)}={w_2}^{({0},k+1)}=0\), \[\begin{align} \ell^{\text{SGD}}_2(w_2,V_2)=\max\left(\delta_2,\max_{ k\in[n-1],u\in U,\psi\in \Psi_k}\left(\frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_2}^{({0},k)}\rangle\right)\right) \end{align}\] As a first step, we show that the the maximum is attained with \(k=1\) and \(u=u_1\), For \(k\neq 1\), for every \(u\in U\) and \(\psi\in \Psi_k\),\[\frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_2}^{({0},k)}\rangle=0.\] For \(k=1\), \(u\neq u_1\) and every \(\psi\in \Psi_1\), by the fact that \(\|\psi\|,\|\phi(V_1,1)\|\leq 1\), \[\frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_2}^{({0},k)}\rangle\leq \frac{3\eta}{64n^3}+\frac{\eta}{16n^3}=\frac{7\eta}{64n^3}<\frac{3\eta}{16n^3}.\] For \(k=1\), \(u=u_1\) and every \(\psi\in \Psi_1\), by the fact that \(\|\psi\|,\|\phi(V_1,1)\|\leq 1\), \[\frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n^2}\psi,{w_2}^{({0},k)}\rangle\geq\frac{3\eta}{8n^3}-\frac{\eta}{16n^3} > \frac{3\eta}{16n^3}>\delta_1.\]
As a second step we show that the maximum among \(\psi\in \Psi_1\) is attained uniquely in \(\psi^*_1=\frac{1}{n}\phi(V_1,1)\). For any \(\psi\in \Psi_1\), with \(\psi\neq \psi^*_1\). By 23, for \(k=1\), \(u=u_1\), \[\begin{align} \frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n}\psi^*_1,{w_2}^{({0},k)}\rangle&=\frac{3\eta}{8n^3}+\langle \frac{1}{4n}\psi^*_1,\frac{\eta}{4n^2}\phi(V_1,1)\rangle \\&=\frac{3\eta}{8n^3}+\frac{\eta}{16n^2}\langle \psi^*_1,\frac{1}{n}\phi(V_1,1)\rangle \\&\geq \frac{3\eta}{8n^3}+\frac{\eta}{16n^2}\langle \psi,\frac{1}{n}\phi(V_1,1)\rangle+\frac{\eta\epsilon}{16n^2} \\&= \frac{3}{8}\langle u,{w_2}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_2}^{({0},k)}\rangle +\frac{\eta\epsilon}{16n^2} \end{align}\] We got that the maximum is uniquely attained at \(k=1, u=u_1, \psi=\frac{1}{n}\phi(V_1,1)\). Now, by 23, for \(j=\argmin_{i}\{i:v_i \in V_1\}\), we get that \[\begin{align} \alpha(\psi)=v_{j}\in V_1. \end{align}\] We notice that \(V_1=P_2\) and thus \(\alpha(\psi)=J_2\). Then, by \(\cE'\), \(\alpha(\psi)\) also holds \(\alpha(\psi)\in S_{2}\). Combining the above together, we get, for \(u_2=\alpha(\psi)\in P_2\cap S_2\), \[\begin{align} {\nabla f(w_2,V_2)}^{(k)}= \begin{cases} \frac{3}{8}u_{1} - \frac{1}{n^3}u_1&\quad k=1\\ -\frac{1}{2} u_{2} &\quad k=2 \\ 0 &\quad k\geq 3 \end{cases} \end{align}\] and, \[\begin{align} {\nabla f(w_2,V_2)}^{(0,k)}= \begin{cases}\frac{1}{4n^2}\phi(V_1,1)-\frac{1}{4n^2}\phi(V_2,1) &\quad k= 1 \\ -\frac{1}{4n^2}\phi(V_1,1) -\frac{1}{4n^2}\phi(V_2,2)&\quad k= 2 \\ 0&\quad k\geq 3, \end{cases} \end{align}\] and the lemma follows. ◻
Lemma 26. Under the conditions of 4, if \(\cE'\) occurs and \(w_t\) is the iterate of Unprojected SGD with step size \(\eta\leq\frac{1}{\sqrt{n}}\) and \(w_1=0\), \[\begin{align} {w_4}^{(k)}= \begin{cases} \frac{3\eta}{n^3}u_1-\frac{3\eta}{8}u_{1} &\quad k=1\\ \frac{\eta}{8} u_{2} &\quad k=2 \\ \frac{\eta}{2} u_{3} &\quad k=3 \\ 0 &\quad k\geq 4 \end{cases}, \end{align}\] and, \[\begin{align} {w_4}^{(0,k)}= \begin{cases} \frac{\eta}{4n^2}\phi(V_2,1)+\frac{\eta}{4n^2}\phi(V_3,1) &\quad k=1 \\ \frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2)+\frac{\eta}{4n^2}\phi(V_3,3)&\quad k=3 \\ 0&\quad k\notin \{1,3\} \end{cases} . \end{align}\]
**Proof.* First, we notice that by 25, it holds that \({w_3}^{(2)}=c\eta u_2\) for \(c\leq \frac{1}{2}\) and \(u_2\) holds \(u_2\in V_1\cap \bigcap_{i=2}^{n}\overline{V_i}\), and for every \(3\leq k\leq T\), \({w_t}^{(k)}=0\). Then, by 11, we have that \(\nabla\ell^{\text{SGD}}_1(w_3,V_3)=0.\) Moreover, \(\ell^{\text{SGD}}_3\) is a linear function, thus, \[\begin{align} {\ell^{\text{SGD}}_3(w_3,V_3)}^{(k)}=\begin{cases} \frac{\eta}{n^3}u_1 &\quad k=1 \\ 0 &\quad k\geq 2 \end{cases}, \end{align}\] and, \[\begin{align} {\ell^{\text{SGD}}_3(w_3,V_3)}^{(k)}=\begin{cases} \frac{\eta}{4n^2}\phi(V_3,1) &\quad k=1 \\ 0 &\quad k\neq 1. \end{cases} \end{align}\] For \(\ell^{\text{SGD}}_2(w_3,V_3)\), we first show that the the maximum is attained with \(k=2\) and \(u=u_2\). For \(k\geq 3\), for every \(u\in U\) and \(\psi\in \Psi_k\), \[\begin{align} &\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w_3}^{(k+1)}\rangle +\langle{w_3}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle=0 . \end{align}\] For \(k=1\), for every \(u\in U\) and \(\psi\in \Psi_1\), by the fact that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), \[\begin{align} &\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w_3}^{(k+1)}\rangle +\langle{w}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle \\&=\frac{3}{8}(\frac{2\eta}{n^3}-\frac{3\eta}{8})\langle u_1,u\rangle -\frac{\eta}{4}\langle u_2,\alpha(\psi)\rangle + \langle \frac{1}{4n^2}\phi(V_2,1),\psi\rangle - \langle \frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2), \psi\rangle \\&+\langle \frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2),\frac{1}{4n^2}\phi(V_3,2)\rangle \\&\leq \frac{9\eta}{512} +\frac{\eta}{32} +\frac{\eta}{4n^2}+\frac{\eta}{2n^2} +\frac{\eta}{8n^4} \\& < \frac{29\eta}{256} \\& < \frac{\eta}{8} . \end{align}\] For \(k=2\), \(u\neq u_2\) and every \(\psi\in \Psi_2\), , by the fact that for every \(\psi,V,j\), \(\|\psi\|,\|\phi(V,j)\|\leq 1\), \[\begin{align} &\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w_3}^{(k+1)}\rangle +\langle{w_3}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle\\&=\frac{3}{8}\langle u,{w_3}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_3}^{({0},k)}\rangle \\&=\frac{3}{8}\langle u,\frac{\eta}{2}u_2\rangle+\langle \frac{1}{4n}\psi,\frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2)\rangle \\&\leq \frac{3\eta}{128}+\frac{\eta}{8n^3}\\&<\frac{\eta}{32} . \end{align}\] For \(k=2\), \(u=u_2\) and every \(\psi\in \Psi_2\), by the fact that \(\|\psi\|,\|\phi(V_1,1)\|\leq 1\), \[\begin{align} &\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w_3}^{(k+1)}\rangle +\langle{w_3}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle\\&=\frac{3}{8}\langle u,{w_3}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_3}^{({0},k)}\rangle \\&=\frac{3}{8}\langle u,\frac{\eta}{2}u_2\rangle+\langle \frac{1}{4n}\psi,\frac{\eta}{4n^2}\phi(V_1,1) +\frac{\eta}{4n^2}\phi(V_2,2)\rangle \\&\geq \frac{3\eta}{16}-\frac{\eta}{8n^3}\\&>\frac{5\eta}{32} \\&>\delta_1. \end{align}\] Second, we show that the maximum among \(\psi\in \Psi_2\) is attained uniquely in \(\psi^*_2=\frac{1}{n}\phi(V_1,1)+\frac{1}{n}\phi(V_2,2)\). For any \(\psi\in \Psi_2\), with \(\psi\neq \psi^*_2\), by 23, for \(k=2\), \(u=u_2\), \[\begin{align} &\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi^*_2),{w_3}^{(k+1)}\rangle +\langle{w_3}^{( {0},k)},\frac{1}{4n}\psi^*_2\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi^*_2\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle\\&=\frac{3}{8}\langle u,{w_3}^{(k)}\rangle+\langle \frac{1}{4n}\psi^*_2,{w_3}^{({0},k)}\rangle\\&=\frac{3\eta}{16}+\langle \frac{1}{4n}\psi^*_2,\frac{\eta}{4n^2}\phi(V_1,1)+\frac{\eta}{4n^2}\phi(V_2,2)\rangle \\&=\frac{3\eta}{16}+\frac{\eta}{16n^2}\langle \psi^*_2,\frac{1}{n}\phi(V_1,1)+\frac{1}{n}\phi(V_2,2)\rangle \\&\geq \frac{3\eta}{16}+\frac{\eta}{16n^2}\langle \psi,\frac{1}{n}\phi(V_1,1)+\frac{1}{n}\phi(V_2,2)\rangle+\frac{\eta\epsilon}{16n^2} \\&= \frac{3}{8}\langle u,{w_3}^{(k)}\rangle+\langle \frac{1}{4n}\psi,{w_3}^{({0},k)}\rangle +\frac{\eta\epsilon}{16n^2} \\&=\frac{3}{8}\langle u,{w_3}^{(k)}\rangle-\frac{1}{2}\langle \alpha(\psi),{w_3}^{(k+1)}\rangle +\langle{w_3}^{( {0},k)},\frac{1}{4n}\psi\rangle -\langle{w_3}^{( {0},k+1)},\frac{1}{4n}\psi\rangle+\langle {w_3}^{({0},k+1)},-\frac{1}{4n^2}\phi(V,k+1)\rangle+\frac{\eta\epsilon}{16n^2} \end{align}\] We got that the maximum is uniquely attained at \(k=2, u=u_2, \psi=\psi^*_2\). Now, by 23, for \(j=\argmin_{i}\{i:v_i \in V_1\cap V_2\}\), we get that \[\begin{align} \alpha(\psi)=v_{j}\in V_1\cap V_2. \end{align}\] We notice that \(V_1\cap V_2=P_3\) and thus \(\alpha(\psi)=J_3\). Then, by \(\cE'\), \(\alpha(\psi)\) also holds \(\alpha(\psi)\in S_{3}\). Combining the above together, we get, for \(u_1 \in U\), \(u_2\in P_2\cap S_2\) and \(u_3=\alpha(\psi_2^*)\in P_3\cap S_3\), \[\begin{align} \nabla f(w_3,V_3)= \begin{cases} - \frac{1}{n^3}u_1&\quad s=1\\ \frac{3}{8} u_{2} &\quad s=2 \\ -\frac{1}{2} u_{3} &\quad s=3 \\ 0 &\quad 4\leq s\leq n \\ -\frac{1}{4n^2}\phi(V_3,1) &\quad s= {0},1 \\ \frac{1}{4n^2}\phi(V_1,1)+\frac{1}{4n^2}\phi(V_2,2)&\quad s= {0},2 \\ -\frac{1}{4n^2}\phi(V_1,1) -\frac{1}{4n^2}\phi(V_2,2)-\frac{1}{4n^2}\phi(V_3,3)&\quad s= {0},3 \\ 0&\quad s={0}, k\text{ for } k\geq 3, \end{cases} \end{align}\] and the lemma follows. ◻*
**of 4.* We show that the theorem holds if the event \(\cE'\) occurs. First, we prove that for every \(t\), \(\|w_t\|\leq 1\). By 10, \[\begin{align} \|w_t\|&\leq \sqrt{\sum_{i=1}^d w_t[i]^2} \\&\leq \sqrt{\sum_{k=1}^n \|{w_t}^{(k)}\|^{2}+\sum_{l=1}^n \|{w_t}^{({0},l)}\|^{2}} \\&< \sqrt{2\cdot \left(\frac{\eta}{2}\right)^{2}+ (n-2)\left(\frac{\eta}{8}\right)^{2}+2\cdot \left(\frac{\eta}{4n}\right)^2} \\&\leq \sqrt{\left(\frac{\eta^2}{2}\right)+ \frac{\eta^2(n-2)}{64}+2\eta^2} \\&\leq \sqrt{\frac{1}{64}+\frac{5}{2n}}{\sqrt{n}}} \\&\leq 1 \end{align}\] Now, denote \(\mathbb{\alpha}_V\in \R^{n-3}\) the vector which its \(k\)th entry is \(\max\left(\frac{\eta}{16}, \max_{u\in V_i} \langle u,(n-k+2)\frac{\eta}{8}u_{k+1}\rangle \right)\). For \(\overline{w}_n=w_{n,n}\), and any \(2\leq s\leq n-2\), \[\begin{align} {\overline{w}_{n}}^{(s)}=\frac{\eta}{2n}u_s + (n-s-1)\frac{\eta}{8n}u_s= (n-s+3)\frac{\eta}{8n}u_s. \end{align}\] Then, \[\begin{align} &\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{\overline{w}_n}^{(k)}\rangle \right)^2}\geq \frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^{n-2}\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{\overline{w}_n}^{(k)}\rangle \right)^2} \\&=\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^{n-2}\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,(n-k+3)\frac{\eta}{8n}u_k\rangle \right)^2} \\&=\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=1}^{n-3}\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,(n-k+2)\frac{\eta}{8n}u_{k+1}\rangle \right)^2} \\&=\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=1}^{n-3}\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,(n-k+2)\frac{\eta}{8n}u_{k+1}\rangle \right)^2} \\&=\frac{1}{n}\sum_{i=1}^n\|\alpha_{V_{i}}\| \\&\geq \|\frac{1}{n}\sum_{i=1}^n\alpha_{{V_i}}\| \\&=\sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,(n-k+3)\frac{\eta}{8n}u_{k}\rangle \right)\right)^2} \\&=\frac{\eta}{8}\sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+3}{n}u_{k}\rangle \right)\right)^2} \\&=\frac{\eta}{8}\sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+2}{n}u_{k}\rangle \right)\right)^2} \end{align}\] Now, by the fact that if \(\cE'\) holds, by 10, for \(2\leq k\leq n-2\), \(u_k\in P_k=\bigcap_{i=1}^{k-1}V_k\), \[\begin{align} &\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{\overline{w}_n}^{(k)}\rangle \right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^{k-1}\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+2}{n}u_{k}\rangle \right)+\frac{1}{n}\sum_{i=k}^{n}\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+2}{n}u_{k}\rangle \right)\right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{k=2}^{n-2}\left(\frac{3(n-k+1)}{4n}+\frac{k-1}{n}\max\left(\frac{3}{4}, \frac{n-k+2}{n}\right)\right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{2\leq k\leq \frac{n}{4}-2}\left(\frac{3(n-k+1)}{4n}+\frac{(k-1)(n-k+1)}{n^2}\right)^2+\sum_{\frac{n}{4}-3<k\leq n-2}\left(\frac{3(n-k+1)}{4n}+\frac{3(k-1)}{4n}\right)^2} \\&= \frac{\eta}{8}\sqrt{\sum_{2\leq k\leq \frac{n}{4}-2}\left(\frac{(n-k+1)(3n+4(k-1))}{4n^2}\right)^2+\frac{27n}{64}} \\&= \frac{\eta}{8}\sqrt{\sum_{1\leq k\leq \frac{n}{4}-3}\left(\frac{(n-k)(3n+4k)}{4n^2}\right)^2+\frac{27n}{64}} \\&\geq \frac{\eta}{8}\sqrt{\sum_{1\leq k\leq \frac{n}{4}-3}\left(\frac{3}{4}+\frac{k}{4n}-\frac{k^2}{n^2}\right)^2+\frac{27n}{64}} \end{align}\] Now, the fact that for \(\frac{n}{8}\leq k\leq \frac{n}{4}\), \(\frac{k}{4n}\leq \frac{k^2}{n^2}\) and for \(k\leq \frac{n}{8}\), \(\frac{k}{8n}\leq \frac{k^2}{n^2}\), \[\begin{align} &\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{\overline{w}_n}^{(k)}\rangle \right)^2} \\&\geq \frac{\eta}{8}\sqrt{\sum_{1\leq k\leq \frac{n}{8}}\left(\frac{3}{4}+\frac{k}{8n}\right)^2+\frac{9n}{128}-\frac{27}{16}+\frac{27n}{64}} \\&\geq \frac{\eta}{8}\sqrt{\frac{9n}{128}+\frac{3}{64n}\sum_{k=1}^{\lfloor{\frac{n}{8}\rfloor}}k+\frac{9n}{128}-\frac{27}{16}+\frac{27n}{64}} \\&\geq \frac{\eta}{8}\sqrt{\frac{1}{2}\left(\frac{n}{8}-1\right)^2-\frac{27}{16}+\frac{36n}{64}} \\&\geq \frac{\eta}{8}\sqrt{\frac{n}{512}-\frac{27}{16}+\frac{36n}{64}}\\&\geq \frac{\eta}{8}\sqrt{\frac{577n}{1024}}\\&\geq\frac{3\eta}{32}\cdot \frac{2001}{2000} \end{align}\]*
Now, for \(m<n\) and \(2\leq k\leq n-2\), \[\begin{align} {w_{n,m}}^{(k)}&= \begin{cases} \frac{\eta}{8} u_{k}&\quad k\leq n-m-1\\ \frac{1}{m}\left(\frac{\eta}{2} u_{k} + (n-k-1)\frac{\eta}{8} u_{s}\right)&\quad k\geq n-m \end{cases} \\&= \begin{cases} \frac{\eta}{8} u_{k}&\quad k\leq n-m-1\\ \frac{\eta(n-k+3)}{8m}u_s&\quad k \geq n-m. \end{cases} \end{align}\] Then, by similar arguments, it holds that, \[\begin{align} &\frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{w_{n,m}}^{(k)}\rangle \right)^2}\geq \frac{1}{n}\sum_{i=1}^n\sqrt{\sum_{k=2}^{n-2}\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{w_{n,m}}^{(k)}\rangle \right)^2} \\&\geq \sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3\eta}{32}, \max_{u\in V_i} \langle u,{w_{n,m}}^{(k)}\rangle \right)\right)^2} \\&=\frac{\eta}{8}\sqrt{\sum_{k=2}^{n-m-1}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,u_{k}\rangle \right)\right)^2+\sum_{k=n-m}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+3}{m}u_{k}\rangle \right)\right)^2} \\&\geq\frac{\eta}{8}\sqrt{\sum_{k=2}^{n-m-1}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,u_{k}\rangle \right)\right)^2+\sum_{k=n-m}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+2}{n}u_{k}\rangle \right)\right)^2} \\&\geq\frac{\eta}{8}\sqrt{\sum_{k=2}^{n-2}\left(\frac{1}{n}\sum_{i=1}^n\max\left(\frac{3}{4}, \max_{u\in V_i} \langle u,\frac{n-k+2}{n}u_{k}\rangle \right)\right)^2}{n}\leq 1} \\&\geq \frac{3\eta}{32}\cdot \frac{2001}{2000} } \end{align}\]
As a result, we notice that for every \(t\), \(\ell^{\text{SGD}}_2(w_t)\geq -\frac{1}{4n^2}-\frac{1}{n^3}\) and \(\ell_2(w_t)\geq \delta_1\) thus, it holds that, \[\begin{align} \widehat{F}(w_{n,m})&\geq \frac{3\eta\sqrt{n}}{32}\cdot \frac{2001}{2000} -\frac{1}{4n^2}-\frac{1}{n^3}+\delta_1 \\&\geq \frac{3\eta\sqrt{n}}{32}\cdot \frac{2001}{2000}-\frac{\eta}{2n^2} \\&\geq \frac{3\eta\sqrt{n}}{32}\cdot \frac{2001}{2000}-\frac{\eta\sqrt{n} }{80000} \\&\geq \frac{3\eta\sqrt{n}}{32}\cdot \left(\frac{2001}{2000}-\frac{1}{4000}\right) \\&\geq \frac{3\eta\sqrt{n}}{32}\cdot \frac{4001}{4000} \end{align}\] and \[\begin{align} \widehat{F}(\widehat{w}_*)&\leq \widehat{F}(0)\leq \frac{3\eta}{32}\sqrt{n} \end{align}\] Then, if \(\cE'\) holds \[\begin{align} \widehat{F}(w_{n,m})-\widehat{F}(\widehat{w}_*)&\geq \frac{3\eta\sqrt{n}}{32}\cdot \frac{2001}{2000}-\frac{3\eta}{32}\sqrt{n} \\&=\frac{\eta\sqrt{n}}{64000} \end{align}\] ◻
The proof of 5 appears in 6.1. Here we prove some auxiliary lemmas that are used for the proof.
of 13. First, differentiability can be derived immediately from 27. Second, for \(5\)-Lipschitzness, for every \((V,j)\in Z\), we define \(\tilde{f}_{V,j}:\R^d\to\R\) as \(\tilde{f}_{V,j}(w)\eqq\tilde{f}(w,(V,j))\). By the \(5\)-Lipschitzness of \(f\) with respect to its first argument and Jensen Inequality, for every \(x,y\in \R^d\), it holds that \[\begin{align} |\tilde{f}_{V,j}(x)-\tilde{f}_{V,j}(y)|&=\left|\E_{v\in\delta B}\left(f_{V,j}(y+v)\right)-\E_{v\in\delta B}\left(f_{V,j}(w+v)\right)\right| \\&=\left|\E_{v\in\delta B}\left(f_{V,j}(x+v)-f_{V,j}(y+v)\right)\right| \\&\leq \E_{v\in\delta B}\left|\left(f_{V,j}(x+v)-f_{V,j}(y+v)\right)\right| \\&\leq 5|x-y|. \end{align}\] Third, for convexity, by the convexity of \(f\) for every \(x,y\in \R^d\) and \(\alpha\in[0,1]\), \[\begin{align} \tilde{f}_{V,j}\left(\alpha x + (1-\alpha )y\right)&= \E_{v\in\delta B}\left(f_{V,j}(\alpha x + (1-\alpha )y+v)\right) \\&= \E_{v\in\delta B}\left(f_{V,j}(\alpha (x+v) + (1-\alpha )(y+v))\right) \\&\leq \E_{v\in\delta B}\left(\alpha f_{V,j}(x+v) + (1-\alpha )f_{V,j}(y+v))\right) \\&= \alpha \E_{v\in\delta B}\left(f_{V,j}(x+v)\right) + (1-\alpha )\left(\E_{v\in\delta B}f_{V,j}(y+v)\right) \\&=\alpha \tilde{f}_{V,j}(x) +(1-\alpha) \tilde{f}_{V,j}(y). \end{align}\] ◻
Lemma 27. (Lemma 1 in [23]) Let \(d\) and \(\delta>0\), \(\mathbb{B}\) be the \(d\)-dimensional unit ball and \(\mathbb{S}\) be the \(d\)-dimensional unit sphere. Moreover, let \(\mathcal{D}_{\mathbb{B}}\) and \(\mathcal{D}_{\mathbb{S}}\) be the uniform distributions on \(\mathbb{B},\mathbb{S}\) respectively. If \(\tilde{f}(x)=\E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[f(x+\delta v)\right]\), then, \[\nabla \tilde{f}(x)=\frac{d}{\delta}\E_{a\sim\mathcal{D}_{\mathbb{S}}}\left[f(x+\delta a)a\right]\]
Lemma 28. (e.g., [24]) Let \(d\). Let \(\mathbb{S}\) be the \(d\)-dimensional unit sphere and \(\mathcal{D}_{\mathbb{S}}\) the uniform distributions on \(\mathbb{S}\). Moreover, we define random variables \(Y_1,\ldots,Y_d\in \R\),\(X_1,\ldots,X_d\in \R\) and \(Y\in R^d\) such that \(X_i\sim N(0,1)\) (where \(N(0,1)\) is the normal univariate distribution with expectation 0 and variance \(1\)), \(Y_i=\frac{x_i}{\sqrt{\sum_{i=1}^d}X_i^2}\) and \(Y=(Y_1,\ldots,Y_d)\). Then, \(Y\sim \mathcal{D}_{\mathbb{S}}\).
Lemma 29. Let \(d\). Let \(\mathbb{B}\) be the \(d\)-dimensional unit ball and \(\mathcal{D}_{\mathbb{B}}\) the uniform distributions on \(\mathbb{B}\). Let \(\zeta_1>\zeta_2>0\), a function \(g:\R\to\R\) and \(a_{1},...a_{l}\in\mathbb{B}\). Moreover, let \(h:\mathbb{B}\to R\), \(h(x)=g\left(\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,x\rangle\right)\) and \(x_0\in \mathbb{B}\) such that \(\max_{1\leq r\leq l} \langle a_r,x_0\rangle \leq \zeta_2\). We define \(\tilde{h}(x)\eqq \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x+\delta v)\right]\). Then, for any \(0<\delta<\zeta_1-\zeta_2\), \[\begin{align} &\nabla\tilde{h}(x_0)=0, \\&\tilde{h}(x_0)=g(\zeta_1). \end{align}\]
Proof. First, for every \(r\) and \(v\in\mathbb{B}\), by Cauchy-Schwartz Inequality, \[\langle a_r,x_0+\delta v\rangle=\langle a_r,x_0\rangle+\langle a_r,\delta v\rangle\leq \zeta_2+\delta<\zeta_1\] Then, \[\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,x_0+\delta v\rangle)=\zeta_1,\] and \[h(x_0+\delta v)=g(\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,x_0+\delta v\rangle)=g(\zeta_1).\] As a result, \[\begin{align} \tilde{h}(x_0)&= \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x_0+\delta v)\right]= g(\zeta_1) \end{align}\] and by 27, \[\begin{align} \nabla \tilde{h}(x_0)&= \frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[h(x_0+\delta v)v\right]\\&= \frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[g\left(\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,x_0+\delta v\rangle\right)v\right] \\&=\frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[g(\zeta_1)v\right] \\&=\frac{d}{\delta}g(\zeta_1)\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[v\right] \\&=0 \end{align}\] ◻
Lemma 30. Let \(d\) and \(K\). Let \(\mathbb{B}\) be the \(dK\)-dimensional unit ball and \(\mathcal{D}_{\mathbb{B}}\) the uniform distributions on \(\mathbb{B}\). Let \(\zeta_1>\zeta_2>0\) and \(a_{1},...a_{l}\in\mathbb{B}^{d}\). Moreover, let \(g:\mathbb{B}^{d}\to R\), \(g(x)=\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,x\rangle)\) and \(h:\mathbb{B} \to \R\), \(h(x)=\sqrt{\sum_{k=1}^{K} g({x}^{(k)})^2}\). Let \(x_0\in \mathbb{B}\) such that for every \(k\), \(\max_{1\leq r\leq l} \langle a_r,{x_0}^{(k)}\rangle \leq \zeta_2\). We define \(\tilde{h}(x)\eqq \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x+\delta v)\right]\). Then, for any \(0<\delta<\zeta_1-\zeta_2\), \[\begin{align} &\nabla\tilde{h}(x_0)=0, \\&\tilde{h}(x_0)=\zeta_1\sqrt{K}. \end{align}\]
Proof. First, for every \(k,r\) and \(u\in\mathbb{B}^{d}\), by Cauchy-Schwartz Inequality, \[\langle a_r,{x_0}^{(k)}+\delta u\rangle=\langle a_r,{x_0}^{(k)}\rangle+\langle a_r,\delta u\rangle\leq \zeta_2+\delta<\zeta_1\] Then, \[g({x_0}^{(k)}+\delta u)=\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,{x_0}^{(k)}+\delta u\rangle)=\zeta_1,\] and for every \(v\in \mathbb{B}\),\[h(x_0+\delta v)=\sqrt{\sum_{k=1}^Kg(\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,{x_0}^{(k)}+\delta {v}^{(k)}\rangle)}=\zeta_1\sqrt{K}.\] As a result, \[\begin{align} \tilde{h}(x_0)&= \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x_0+\delta v)\right]= \zeta_1\sqrt{K}. \end{align}\] Now, by 27, \[\begin{align} \nabla \tilde{h}(x_0)&= \frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[h(x_0+\delta v)v\right]\\&= \frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[\left(\sqrt{\sum_{k=1}^{K}\left(\max (\zeta_1, \max_{1\leq r\leq l}\langle a_r,{x_0}^{(k)}+\delta {v}^{(k)}\rangle\right)^2}\right)\cdot v\right] \\&=\frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[\zeta_1\sqrt{K}v\right] \\&=\frac{d}{\delta}\zeta_1\sqrt{K}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[v\right] \\&=0. \end{align}\] ◻
Lemma 31. Let \(d\). Let \(\mathbb{B}\) be the \(d\)-dimensional unit ball and \(\mathcal{D}_{\mathbb{B}}\) the uniform distributions on \(\mathbb{B}\). Let \(\zeta_1>\zeta_2,\zeta_3>0\) and vectors \(a_{1},...a_{l}\in B_G^d(0)\). Moreover, let \(h:\mathbb{B}\to \R\), \(h(x)= \max\left(\zeta_3,\max_{1\leq r\leq l}\langle a_r,x\rangle\right)\) and \(x_0\in \mathbb{B}, r_{0}\in[l]\) such that \(\langle a_{r_{0}},x_0\rangle=\zeta_1\) and \(\max_{1\leq r\leq l, r\neq r_{0}}\langle a_{r},x_0\rangle\leq \zeta_2\). We define \(\tilde{h}(x)\eqq \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x+\delta v)\right]\). Then, for any \(0<\delta<\frac{1}{2G}\left(\zeta_1-\max\left(\zeta_2,\zeta_3\right)\right)\), \[\begin{align} &\tilde{h}(x_0)=\langle a_{r_{0}},x_0\rangle \\&\nabla\tilde{h}(x_0)=a_{r_{0}} \end{align}\]
Proof. First, by Cauchy-Schwartz Inequality, \[\begin{align} \max\left(\zeta_3,\max_{r\neq r_0}\langle a_r,x_0+\delta v\rangle\right)&\leq\max\left(\zeta_3,\max_{r\neq r_0}\langle a_r,x_0\rangle+\max_{r\neq r_0}\langle\delta v,a_r\rangle\right)\\&\leq \max\left(\zeta_3,\zeta_2+G\delta\right) \\&\leq \max\left(\zeta_3,\zeta_2\right)+G\delta\\&<\frac{1}{2}(\zeta_1+\max\left(\zeta_3,\zeta_2)\right), \end{align}\] and for \(r_0\), \[\langle a_{r_{0}},x_0+\delta v\rangle=\langle a_{r_{0}},x_0\rangle+\langle\delta v,a_{r_{0}}\rangle\geq \zeta_1-G\delta>\frac{1}{2}\left(\zeta_1+\max\left(\zeta_2,\zeta_3\right)\right).\] We derive that for every \(v\in \mathbb{B}\), \[h(x_0+\delta v)=\max\left(\zeta_3,\max_{1\leq r\leq l}\langle a_r,x+\delta v\rangle\right))=\langle a_{r_{0}},x+\delta v\rangle.\] and that the maximum is attained in \(r_0\). Then, \[\begin{align} \tilde{h}(x_0)&= \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[h(x_0+\delta v)\right]\\&= \E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[\langle a_{r_{0}},x_0+\delta v\rangle\right] \\&=\langle a_{r_{0}},x_0+\delta \E_{v\sim\mathcal{D}_{\mathbb{B}}}v\rangle \\&=\langle a_{r_{0}},x_0\rangle \end{align}\] and by 27, \[\begin{align} \nabla\tilde{h}(x_0)&= \frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[\max\left(\zeta_3,\left(\max_{1\leq r\leq l}\langle a_r,x_0+\delta v\rangle\right)\right)v\right] \\&=\frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[\left(\langle a_{r_{0}},x_0+\delta v\rangle\right)v\right] \\&=\langle a_{r_{0}},x_0\rangle\frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[v\right]+\frac{d}{\delta}\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[\langle a_{r_{0}},\delta v\rangle v\right] \\&=0+d a_{r_{0}}^T\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[ v v^T\right] \\&=d a_{r_{0}}^T\E_{v\sim\mathcal{D}_{\mathbb{S}}}\left[ v v^T\right]. \end{align}\] Now, we define random variables \(Y_1,\ldots,Y_d\in \R\),\(X_1,\ldots,X_d\in \R\) and \(Y\in R^d\) such that \(X_i\sim N(0,1)\) (where \(N(0,1)\) is the normal univariate distribution with expectation 0 and variance \(1\)), \(Y_i=\frac{x_i}{\sqrt{\sum_{i=1}^d}X_i^2}\). By 28, we get, for the standard basis vectors \(e_1\ldots e_d\), \[\begin{align} \nabla\tilde{h}(x)&=d a_{r_{0}}^T\E_{Y_1,\ldots,Y_d}\left[\sum_{i=1}^d Y_i^2e_ie_i^T\right] \\&=d a_{r_{0}}^T\sum_{i=1}^d \E_{Y_i}\left[Y_i^2\right] e_ie_i^T \\&=d a_{r_{0}}^T\sum_{i=1}^d \E_{X_i}\left[\frac{X_i^2}{\sum_{l=1}^d X_l^2}\right] e_ie_i^T \\&=d a_{r_{0}}^T\sum_{i=1}^d \frac{1}{d}e_ie_i^T \\&=a_{r_{0}} \end{align}\] ◻
of 14. We assume that \(\cE\) (10 ) holds and show 14 under this event. We prove the claim by induction on \(t\). For \(t=1\), it is trivial. Now, we assume that \(w_t=\tilde{w}_t\).
For \(\ell_1\), in every \(t\), by the proofs of 18 19 20 21 and 4, it can be observed that for every \(i\in[n]\), \(k\geq 2\), \(\max_{t}\max_{u \in V_i}\langle u,{w_t}^{(k)}\rangle\leq \frac{\eta}{16}\), thus, in every iteration the term that gets the maximal value is \(\frac{3\eta}{32}\). Then, by 30 and the hypothesis of the induction, for every \(i\), \[\begin{align} \nabla \tilde{\ell}_1(\tilde{w}_t,V_i)&=\nabla\tilde{\ell}_1(w_{t},V_i) =0 =\nabla \ell_1(w_{t},V_i). \end{align}\]
For \(\tilde{\ell}_2\) and every \(w\in \R^d\), \(V\subseteq U\) and \(j\in[n^2]\), by linearity of expectation, \[\begin{align} \tilde{\ell}_2(w,(V,j))&=\E_{v\in\delta B}\left(\langle {w}^{({{0}})}+{v}^{({{0}})},-\phi(V,j)\rangle\right) \\&=\ell_2(w,(V,j))+\left(\langle \E_{v\in\delta B}{v}^{({{0}})},-\phi(V,j)\rangle\right) \\&=\ell_2(w,(V,j)) \end{align}\] Then, we derive that for every \(w\) and \(i\), \(\nabla\tilde{\ell}_2(w,(V_i,j_i))=\nabla\ell_2(w,(V_i,j_i))\).
For \(\tilde{\ell}_3\), which is a \(2\)-Lipschitz linear function, for \(t=1\), by the proof of 18, the term that gets the maximal value is \(\delta_1\). Moreover, it can be observed that for such \(t\), and every \(\psi\in\Psi\), \[\max_{\psi\in \Psi} \left(\langle{w}^{({{0}})}_1, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w_1}^{(1)}\rangle \right)=0.\] Then, we can apply 29, and get by the hypothesis of the induction, \[\begin{align} \nabla \tilde{\ell}_3(\tilde{w}_1)&=\nabla\tilde{\ell}_3(w_{1}) =0 =\nabla \ell_3(w_{1}). \end{align}\] If \(t\geq 2\), it can be observed that \[\begin{align} \ell_3(w_{t})&=\max\left(\delta_2,\max_{\psi\in \Psi} \left(\langle{w}^{({{0}})}_t, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w_t}^{(1)}\rangle \right)\right)\\&=\max_{\psi\in \Psi} \left(\langle{w}^{({{0}})}_t, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w_t}^{(1)}\rangle \right) \end{align}\] Then, by the proofs of 19 20 21 and 4, the maximal value of \(\langle{w}^{({{0}})}, \psi\rangle - \frac{1}{4}\frac{\epsilon}{T^2}\langle \alpha(\psi), {w}^{(1)}\rangle\) is attained in \(\psi=\psi^*\) and the difference from the second maximal possible value of this term is at most \(\frac{\epsilon}{2T^2}\). As a result, using the fact that this maximum is also larger than \(\delta_2\) by at least \(\frac{\eta}{8n}\) (which is also larger than \(\delta\)), we can apply 31 and get by the hypothesis of the induction that, \[\begin{align} {\nabla \tilde{\ell}_3(\tilde{w}_t)}^{(k)}&={\nabla\tilde{\ell}_3(w_{t})}^{(k)} \\&=\begin{cases} \frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) &\quad k={0}\\ -\frac{\epsilon}{4T^2}\alpha(\frac{1}{n}\sum_{i=1}^n\phi(V_i,j_i) )&\quad k=1\\ 0 &\quad \text{otherwise} \end{cases} \\&={\nabla \ell_3(w_{t})}^{(k)}. \end{align}\]
For \(\tilde{\ell}_4\), for \(t\in \{1,2\}\), by the proofs of 18 19, the term that gets the maximal value is \(\delta_2\). Moreover, it can be observed that for every such \(t\), and every \(k\in[T-1\)] and \(u\in U\), \[\frac{3}{8}\langle u,{w_t}^{(k)}\rangle-\frac{1}{2}\langle u,{w_t}^{(k+1)}\rangle=0.\] Then, we can apply 29, and get by the hypothesis of the induction, \[\begin{align} \nabla \tilde{\ell}_4(\tilde{w}_t)&=\nabla\tilde{\ell}_4(w_{t}) =0 =\nabla \ell_4(w_{t}). \end{align}\] For \(t=3\), it can be observed by the proof of 20 that, \[\begin{align} \ell_4(w_{t})&=\max\left(\delta_2,\max_{k\in [T-1], u \in U}\left(\frac{3}{8}\langle u,{w_t}^{(k)}\rangle-\frac{1}{2}\langle u,{w_t}^{(k+1)}\rangle\right)\right)\\&=\max_{k\in [T-1], u \in U}\left(\frac{3}{8}\langle u,{w_t}^{(k)}\rangle-\frac{1}{2}\langle u,{w_t}^{(k+1)}\rangle\right) \end{align}\] Moreover, the maximal value is \(\frac{3\eta\epsilon}{32T^2}\) and is attained in \(k_0=1,u=u_0=\alpha(\psi^*)\). The second maximal possible value of this term is \(\delta_2=\frac{3\eta\epsilon}{64T^2}\), then, by the fact that \(\delta<\frac{3\eta\epsilon}{32T^2}-\frac{3\eta\epsilon}{64T^2}=\frac{3\eta\epsilon}{64T^2}\), we can apply 31 and get by the hypothesis of the induction that \[\begin{align} {\nabla \tilde{\ell}_4(\tilde{w}_t)}^{(k)}&={\nabla\tilde{\ell}_4(w_{t})}^{(k)} \\&=\begin{cases} \frac{3}{8}u_0 &\quad k=1\\ -\frac{1}{2}u_0 &\quad k=2\\ 0 &\quad \text{otherwise} \end{cases} \\&={\nabla \ell_4(w_{t})}^{(k)}. \end{align}\] For \(t\geq 4\), it can be observed by the proofs of 4 21 that, \[\begin{align} \ell_4(w_{t})&=\max\left(\delta_2,\max_{k\in [T-1], u \in U}\left(\frac{3}{8}\langle u,{w_t}^{(k)}\rangle-\frac{1}{2}\langle u,{w_t}^{(k+1)}\rangle\right)\right)\\&=\max_{k\in [T-1], u \in U}\left(\frac{3}{8}\langle u,{w_t}^{(k)}\rangle-\frac{1}{2}\langle u,{w_t}^{(k+1)}\rangle\right) \end{align}\] Moreover, the maximal value is \(\frac{3\eta}{16}\) and is attained in \(k_0=t-2,u=u_0=\alpha(\psi^*)\). The second maximal possible value of this term is smaller then \(\frac{5\eta}{64}\), then we can apply again 31 and get by the hypothesis of the induction that \[\begin{align} {\nabla \tilde{\ell}_4(\tilde{w}_t)}^{(k)}&={\nabla\tilde{\ell}_4(w_{t})}^{(k)} \\&=\begin{cases} \frac{3}{8}u_0 &\quad k=t-2\\ -\frac{1}{2}u_0 &\quad k=t-1\\ 0 &\quad \text{otherwise} \end{cases} \\&={\nabla \ell_4(w_{t})}^{(k)}. \end{align}\]
In conclusion, we proved that \(\nabla \widehat{F}(w_t)=\nabla \widehat{\tilde{F}}(\tilde{w}_t)\), thus, by the hypothesis of the induction, \[w_{t+1} = w_t - \nabla \widehat{F}(w_t)=\tilde{w}_t - \nabla \widehat{\tilde{F}}(\tilde{w}_t)=\tilde{w}_{t+1}\] ◻
Lemma 32. Let \(d\) and \(\delta>0\). Let \(f:\R^d\to \R\) be a \(G\)-Lipschitz function. Let \(\mathbb{B}\) be the \(d\)-dimensional unit ball. Moreover, let \(\mathcal{D}_{\mathbb{B}}\) be the uniform distributions on \(\mathbb{B}\). If \(\tilde{f}(x)=\E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[f(x+\delta v)\right]\), then for every \(x\), \[|\tilde{f}(x)-f(x)|\leq G\delta\]
Proof. By the fact that \(f\) is \(G\)-Lipschitz, \[\begin{align} |\tilde{f}(x)-f(x)|&= |\E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[f(x+\delta v)\right]-f(x)|\\&\leq |\E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[f(x)\right]+G\delta\E_{v\sim\mathcal{D}_{\mathbb{B}}}+\left[\|v\|\right]-f(x)| \\&=G\delta\E_{v\sim\mathcal{D}_{\mathbb{B}}}\left[\|v\|\right] \\&\leq G\delta \end{align}\] ◻
of 15. First, differentiability can be derived immediately from 27. Second, for \(4\)-Lipschitzness, for every \(V\in Z\), we define \(\tilde{f}^{\text{SGD}}_{V}:\R^d\to\R\) as \(\tilde{f}^{\text{SGD}}_{V}(w)\eqq\tilde{f}^{\text{SGD}}(w,V)\). By the \(5\)-Lipschitzness of \(f^{\text{SGD}}\) with respect to its first argument and Jensen Inequality, for every \(x,y\in \R^d\), it holds that \[\begin{align} |\tilde{f}^{\text{SGD}}_{V}(x)-\tilde{f}^{\text{SGD}}_{V}(y)|&=\left|\E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(y+v)\right)-\E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(w+v)\right)\right| \\&=\left|\E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(x+v)-f^{\text{SGD}}_{V}(y+v)\right)\right| \\&\leq \E_{v\in\delta B}\left|\left(f^{\text{SGD}}_{V}(x+v)-f^{\text{SGD}}_{V}(y+v)\right)\right| \\&\leq 4|x-y|. \end{align}\] Third, for convexity, by the convexity of \(f^{\text{SGD}}\) for every \(x,y\in \R^d\) and \(\alpha\in[0,1]\), \[\begin{align} \tilde{f}^{\text{SGD}}_{V}\left(\alpha x + (1-\alpha )y\right)&= \E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(\alpha x + (1-\alpha )y+v)\right) \\&= \E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(\alpha (x+v) + (1-\alpha )(y+v))\right) \\&\leq \E_{v\in\delta B}\left(\alpha f^{\text{SGD}}_{V}(x+v) + (1-\alpha )f_{V}(y+v))\right) \\&= \alpha \E_{v\in\delta B}\left(f^{\text{SGD}}_{V}(x+v)\right) + (1-\alpha )\left(\E_{v\in\delta B}f^{\text{SGD}}_{V}(y+v)\right) \\&=\alpha \tilde{f}^{\text{SGD}}_{V}(x) +(1-\alpha) \tilde{f}^{\text{SGD}}_{V,j}(y). \end{align}\] ◻
of 16. We assume that \(\cE'\) (12 ) holds and prove 16 under this event. We prove the claim by induction on \(t\). For \(t=1\), it is trivial. Now, we assume that \(w_t=\tilde{w_t}\). First, for \(\tilde{\ell}^{\text{SGD}}_3\) and every \(w\) and \(V\), by linearity of expectation, \[\begin{align} \tilde{\ell}^{\text{SGD}}_3(w,V)&=\E_{v\in\delta B}\left(\langle {w}^{({0},1)}+{v}^{({0},1)},-\frac{1}{4n^2}\phi(V,1)\rangle -\langle \frac{1}{n^3} u_1, {w}^{(1)}+{v}^{(1)}\rangle\right)\\&=\ell^{\text{SGD}}_3(w,V)+\left(\langle \E_{v\in\delta B}{v}^{({0},1)},-\frac{1}{4n^2}\phi(V,1)\rangle -\langle \frac{1}{n^3} u_1, \E_{v\in\delta B}{v}^{(1)}\rangle\right) \\&=\ell^{\text{SGD}}_3(w,V) \end{align}\] Then, we derive that for every \(w\), \(\nabla\tilde{\ell}^{\text{SGD}}_3(w,V)=\nabla\ell^{\text{SGD}}_3(w,V)\). Now, for \(r\in\{1,2\}\) we show that in each term \(\tilde{\ell}^{\text{SGD}}_r(w_t,V_t)\), the argument that gives the maximum value is the same as \(\ell^{\text{SGD}}_r(w_t,V_t)\).
For \(\tilde{\ell}^{\text{SGD}}_1(w_t,V_t)\), in every \(t\), by the proofs of 24, 25 and 10, the maximal value is \(\frac{3\eta}{32}\). Moreover, it can be observed that for every \(k\geq 2\), \(\max_{t}\max_{u \in V_t}\langle u,{w_t^\text{SGD}}^{(k)}\rangle\leq \frac{\eta}{16}\). Then, by 30, and the hypothesis of the induction, \[\begin{align} \nabla \tilde{\ell}^{\text{SGD}}_1(\tilde{w_{t}},V_{t})&=\nabla\tilde{\ell}^{\text{SGD}}_1(w_{t},V_{t}) =0 =\nabla \ell^{\text{SGD}}_1(w_{t},V_t). \end{align}\] Now, for \(\tilde{\ell}^{\text{SGD}}_2\), for \(t=1\), \(\nabla \ell^{\text{SGD}}_2(w_1,V_1)= 0\) and the maximum is attained uniquely in \(\delta_1=\frac{\eta}{8n^3}\) (the second maximal value is zero). Then, we can apply 29 and by the hypothesis of the induction, it follows that, \[\begin{align} \nabla \tilde{\ell}^{\text{SGD}}_2(\tilde{w_{1}},V_1)&=\nabla\tilde{\ell}^{\text{SGD}}_2(w_{1},V_1) =0 =\nabla \ell^{\text{SGD}}_2(w_{1},V_1). \end{align}\] For every \(t\geq 2\), the maximum is attained uniquely in the linear term of \(k=t-1\),\(u=u_{t-1}\) and \(\psi=\psi^*_{t-1}\) such that the difference between the maximal value the second largest value is larger than \(\frac{\eta\epsilon}{16n^2}\). Then, we can apply 31 and by the hypothesis of the induction, it follows that, \[\begin{align} \nabla \tilde{\ell}^{\text{SGD}}_2(\tilde{w_{t}},V_t)&=\nabla\tilde{\ell}^{\text{SGD}}_2(w_{t},V_t) =\nabla \ell^{\text{SGD}}_t(w_{t},V_t). \end{align}\] In conclusion, we proved that \(\nabla \tilde{f}^{\text{SGD}}(\tilde{w_{t}},V_t)=\nabla f^{\text{SGD}}(w_{t},V_t)\), thus, by the hypothesis of the induction, \[w_{t+1}= w_t- \nabla f^{\text{SGD}}(w_{t},V_t)=\tilde{w}_t - \nabla \tilde{f}^{\text{SGD}}(\tilde{w}_{t},V_t)=\tilde{w}_{t+1}.\] ◻
In this section, we prove the \(\Omega\left(\min\left(1,\frac{1}{\eta T}\right)\right)\) lower bound. Since our hard construction for getting this bound involves a deterministic loss function, GD is equivalent to SGD. For clarity, we refer in our proof to the performance of GD, however, the same result is applicable also for SGD with \(T=n\) iterations.
For \(d=\max(25\eta^2T^2,1)\), we define the hard loss function \(f^{\text{OPT}}:\R^d\to\R\), as follows, \[\begin{align} \label{loss95function95small95eta} f^{\text{OPT}}(w)=\max \left(0, \max_{i\in[d]} \{\frac{1}{\sqrt{d}}-w[i]-\frac{\eta i}{4d}\}\right). \end{align}\tag{16}\] For this loss function, we prove the following lemma,
Lemma 33. Assume \(n,T>0,\eta\leq \frac{1}{5\sqrt{T}}\). Consider the loss function \(f^{\text{OPT}}\) that is defined in 16 for \(d=\max(25\eta^2T^2,1)\). Then, for Unprojected GD (cf. 1 with \(W=\R^d\)) on \(f^{\text{OPT}}\), initialized at \(w_1=0\) with step size \(\eta\), we have,
The iterates of GD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,T\);
For all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has: \[f^{\text{OPT}}(w_{T,m}) - f^{\text{OPT}}(w_*) = \Omega\br[3]{\min\left(1,\frac{1}{\eta T}\right)} .\]
We start by proving a lemma that characterizes the dynamics of the algorithm.
Lemma 34. Assume the conditions of 33, and consider the iterate of Unprojected GD on \(f^{\text{OPT}}\), initialized at \(w_1=0\) with step size \(\eta\leq \frac{1}{5{\sqrt{T}}}\) Let \(w_t\) be the iterate of Then, it holds that,
For every \(i\in[d]\) and for every \(t\in[T]\), \[w_t[i]\leq \frac{1}{2\sqrt{d}}\]
For every \(t\in [T]\), there exists an index \(j_t\in[d]\) such that \(k\neq j_t\), \[\frac{1}{\sqrt{d}}-w_t[j_t]-\frac{\eta j}{4d}>\frac{1}{\sqrt{d}}-w_t[k]-\frac{\eta k}{4d}+\frac{\eta}{8d}.\]
For every \(t\in [T]\), \(j_t\) also holds \[\frac{1}{\sqrt{d}}-w_t[j_t]-\frac{\eta j_t}{4d}>\frac{\eta}{8d}.\]
Proof. We prove by induction on \(t\). For \(t=1\), \(w_t=0\), thus, \[w_1[i]=0\leq \frac{1}{2\sqrt{d}}.\] Moreover, the maximizer is \(j_1=1\). Then, we notice that for both \(d=1\) and \(d=25\eta^2T^2\), \(\eta \leq\frac{1}{5\sqrt{T}}\implies\eta\leq \frac{1}{5\sqrt{d}}\). Then, it holds that, \[\begin{align} \frac{1}{\sqrt{d}}-w_1[j_1]-\frac{\eta j_1}{4d}&\geq \frac{1}{\sqrt{d}}-w_1[j_1]-\frac{\eta}{4}\\&\geq \frac{19}{20\sqrt{d}} \\&>\frac{\eta}{8d}, \end{align}\] and, for every \(k\neq j_1\), \[\begin{align} \frac{1}{\sqrt{d}}-w_1[j_1]-\frac{\eta j_1}{4d}&= \frac{1}{\sqrt{d}}-w_1[k]-\frac{\eta k}{4d}+\frac{\eta (k-j_1)}{4d} \\&\geq \frac{1}{\sqrt{d}}-w_1[k]-\frac{\eta k}{4d}+\frac{\eta}{4d} \\&>\frac{1}{\sqrt{d}}-w_1[k]-\frac{\eta k}{4d}+\frac{\eta}{8d} . \end{align}\]
In the step of the induction we assume that the lemma holds for every \(s\leq t\) and prove it for \(s=t+1\). By the hypothesis of the induction, we know that for every iteration \(s\leq t\), \(\|w_t\|_2\leq \frac{1}{2}\), as a result, we know that the projections does not affect the dynamics of the algorithm until the iteration \(t\). Moreover, we know that for every iteration \(s\leq t\) there exists an index \(j_s\in[d]\) such that the term that achieve the maximum value in \(w_s\) is \(\frac{1}{\sqrt{d}}-w_s[j_s]-\frac{\eta j}{4d}\). This maximum is attained uniquely in \(j_s\) by margin that is strictly larger than \(\frac{\eta}{8d}\). As a result, we derive that, for every \(s\leq t\), \(\nabla f (w_s)=-e_{j_{s}}\). Now, for every index \(m\in[d]\), we define, \[n_t^m=|\{s\leq t : m=\arg\max_{i\in[d]} \{\frac{1}{\sqrt{d}}-w_s[i]-\frac{\eta i}{4d}\}\}|.\] We get that, for every \(i\) it holds that, \[w_{t+1}[i]=\eta n_t^i.\] Then, \[\begin{align} \|w_{t+1}\|_1=\sum_{i} \eta n_t^i\leq \eta t, \end{align}\] and ,thus, there exists a entry \(k\in [d]\) with \(w_{t+1}[k]\leq\frac{\eta t}{d}\). Now, we prove the first part of the lemma using this observation and the step of the induction. For every \(i\neq j_t\), \[w_{t+1}[i]=w_{t}[i]\leq \frac{1}{2\sqrt{d}}.\] Otherwise, we know that, by the definition of \(j_t\) \[\begin{align} \frac{1}{\sqrt{d}}-w_{t}[i]-\frac{\eta i}{4d}>\frac{1}{\sqrt{d}}-w_t[k]-\frac{\eta k}{4d}+\frac{\eta}{8d}, \end{align}\] \[\begin{align} w_{t}[i]&<w_t[k]+\frac{\eta (k-i)}{4d}-\frac{\eta}{8d} \\&\leq\frac{\eta t}{d}+\frac{\eta}{4} \\&\leq\frac{1}{25\sqrt{d}}+\frac{1}{20\sqrt{d}} \end{align}\] and, \[\begin{align} w_{t+1}[i] &\leq w_{t}[i]+\eta \\&\leq \frac{1}{25\sqrt{d}}+\frac{1}{20\sqrt{d}} +\frac{1}{5\sqrt{d}} \\&\leq\frac{1}{2\sqrt{d}}, \end{align}\] where we again used the fact that \(\eta\leq \frac{1}{5\sqrt{T}}\) implies \(\eta\leq\frac{1}{5\sqrt{d}}\) for both \(d=1\) and \(d=25\eta^2T^2\).
For the second part of the lemma, we define \(J_t\subseteq [d]\), \(J_t=\argmin_{j}\{n_t^j\}\) and \(j_{t+1}=\min \{j\in J_t\}\) and show that \(j_{t+1}\) holds the required. We know, for every \(j\neq i\in[d]\), \[\begin{align} w_{t+1}[i]-w_{t+1}[j]=\eta(n_t^i-n_t^j). \end{align}\] For \(k\neq j_{t+1}\) with \(n_t^k > n_t^{j_{t+1}}\), \[\begin{align} \frac{1}{\sqrt{d}}-w_{t+1}[j_{t+1}]-\frac{\eta j_{t+1}}{4d}&\leq \frac{1}{\sqrt{d}}-w_{t+1}[k]-\eta-\frac{\eta j_{t+1}}{4d} \\& = \frac{1}{\sqrt{d}}-w_{t+1}[k]-\eta- \frac{\eta k}{4d}+\frac{\eta(k-j_{t+1})}{4d} \\& \leq \frac{1}{\sqrt{d}}-w_{t+1}[k]-\eta- \frac{\eta k}{4d}+\frac{\eta}{4} \\& < \frac{1}{\sqrt{d}}-w_{t+1}[k]- \frac{\eta k}{4d}-\frac{\eta}{2}. \end{align}\] in contradiction to the fact that \(j_{t+1}\) gets the maximal value. For \(k\neq j_{t+1}\) with \(n_t^k > n_t^{j_{t+1}}\), it holds that \(w_{t+1}[j_{t+1}]\leq w_{t+1}[k]-\eta\), and, \[\begin{align} \frac{1}{\sqrt{d}}-w_{t+1}[j_{t+1}]-\frac{\eta j_{t+1}}{4d}&\geq \frac{1}{\sqrt{d}}-w_{t+1}[k]+\eta-\frac{\eta j_{t+1}}{4d} \\& = \frac{1}{\sqrt{d}}-w_{t+1}[k]+\eta- \frac{\eta k}{4d}+\frac{\eta(k-j_{t+1})}{4d} \\& \geq \frac{1}{\sqrt{d}}-w_{t+1}[k]+\eta- \frac{\eta k}{4d}-\frac{\eta}{4} \\& > \frac{1}{\sqrt{d}}-w_{t+1}[k]- \frac{\eta k}{4d}+\frac{\eta}{8d}, \end{align}\] as required. For the third part of the lemma, we know that for every \(i\in [d]\), \[\begin{align} \frac{1}{\sqrt{d}}-w_{t+1}[i]-\frac{\eta i}{4d} &\geq \frac{1}{2\sqrt{d}}-\frac{\eta }{4} \\&= \frac{9}{20\sqrt{d}} \\&>\frac{\eta}{8d}. \end{align}\] ◻
Now we can prove 33.
of 33. The first part of the theorem is an immediate corollary from 34. Moreover, by applying this lemma again, we know that, for every \(i\in[d]\), \[\begin{align} w_{T,m}[i]\leq \frac{1}{2\sqrt{d}}, \end{align}\] thus, \[\begin{align} f^{\text{OPT}}(w_{T,m})-f^{\text{OPT}}(w_*)&\geq \frac{1}{2\sqrt{d}}-\frac{\eta}{4}-0 \\&\geq \frac{1}{2\sqrt{d}}-\frac{\eta}{20\sqrt{d}} \\&> \frac{1}{4\sqrt{d}} \\&=\min\left(\frac{1}{4}, \frac{1}{20\eta T}\right). \end{align}\] ◻
In this section, we prove the lower bound for a smoothing of \(f^{\text{OPT}}\), defined as \[\begin{align} \label{loss95function95small95eta95diff} \tilde{f}^{\text{OPT}}(w)=\E_{v\in\mathbb{B}^{d}} \max \left(0, \max_{i\in[d]} \{\frac{1}{\sqrt{d}}-w[i]-\delta v[i]-\frac{\eta i}{4d}\}\right), \end{align}\tag{17}\] namely, we prove the following lemma,
Lemma 35. Assume \(n,T>0,\eta\leq \frac{1}{5\sqrt{T}}\). Consider the loss function \(\tilde{f}^{\text{OPT}}\) that is defined in 17 for \(d=\max(25\eta^2T^2,1)\) and \(\delta=\frac{\eta}{16d}\). Then, for Unprojected GD (cf. 1 with \(W=\R^d\)) on \(f^{\text{OPT}}\), initialized at \(w_1=0\) with step size \(\eta\), we have,
The iterates of GD remain within the unit ball, namely \(w_t \in \mathbb{B}^{d}\) for all \(t=1,\ldots,T\);
For all \(m=1,\ldots,T\), the \(m\)-suffix averaged iterate has: \[\tilde{f}^{\text{OPT}}(w_{T,m}) - \tilde{f}^{\text{OPT}}(w_*) = \Omega\br[3]{\min\left(1,\frac{1}{\eta T}\right)} .\]
First, we prove that the smoothing of the loss function does not affect the dynamics of the algorithm, as stated in the following lemma,
Lemma 36. Under the conditions of 35 33, let \(w_t,\tilde{w}_t\) be the iterates of Unprojected GD with step size \(\eta\leq\frac{1}{5\sqrt{T}}\) and \(w_1=0\), on \(f^{\text{OPT}}\) and \(\tilde{f}^{\text{OPT}}\) respectively. Then, for every \(t\in[T]\), it holds that \(w_t=\tilde{w}_t\).
Proof. We proof the lemma by induction on \(t\). For \(t=1\), we know that \(w_1=\tilde{w}_1=0\). Now, we assume that \(w_t=\tilde{w}_t\). By 34, we know that the maximum of the loss function is attained uniquely with the property that the difference between the maximal value and the second maximal value is larger then \(\frac{\eta}{8d}\). As a result, by the facts that \(f\) is \(1\)-Lipschitz and \(\delta=\frac{\eta}{16d}\), we can use 31 for \(\widehat{F}(w_t)\) and get that, \[\nabla \widehat{F}(w_t)=\nabla \widehat{\tilde{F}}(w_t)=\nabla \widehat{\tilde{F}}(\tilde{w}_t).\] It follows by the hypothesis of the induction that, \[w_{t+1} = w_t - \nabla \widehat{F}(w_t)=\tilde{w}_t - \nabla \widehat{\tilde{F}}(\tilde{w}_t)=\tilde{w}_{t+1}.\] ◻
Now we can prove 35.
of 35. Let \(\overline{w_{T,m}}\) be the \(m\)-suffix average of \(GD\) when is applied on \(f^{\text{OPT}}\). Let \(\overline{w_*}=\argmin_w f^{\text{OPT}}(w)\). By 36, we know that, \(w_{T,m}=\overline{w_{T,m}}\). Then, by 33 and 32, \[\begin{align} \frac{1}{4\sqrt{d}}&\leq f^{\text{OPT}}(\overline{w_{T,m}})-f^{\text{OPT}}(\overline{w_*}) \\&=f^{\text{OPT}}(w_{T,m})-f^{\text{OPT}}(\overline{w_*}) \\&\leq \tilde{f}^{\text{OPT}}(w_{T,m})+\delta-\tilde{f}^{\text{OPT}}(\overline{w_*})+\delta \\&\leq \tilde{f}^{\text{OPT}}(w_{T,m})+\delta-\tilde{f}^{\text{OPT}}(w_*)+\delta, \end{align}\] and, \[\begin{align} \tilde{f}^{\text{OPT}}(w_{T,m})-\tilde{f}^{\text{OPT}}(w_*)&\geq \frac{1}{4\sqrt{d}}-\frac{\eta}{8d} \\&\geq \frac{1}{4\sqrt{d}}-\frac{1}{8\sqrt{d}} \\&\geq \frac{1}{8\sqrt{d}} \\&\geq \min(\frac{1}{8},\frac{1}{40\eta T}) . \end{align}\] ◻
Here we refer to GD as performing \(T=n\) iterations with stepsize \(\eta = \Theta(1/\sqrt{n})\), where \(n\) denotes the size of the training set, but our results hold more generally; see below for a more detailed discussion of the various regimes.↩︎
By population error (or test error) we mean the population excess risk, namely the gap in population risk between the returned solution and the optimal solution.↩︎
To see this, let \(r=\max\{2,\alpha+1\}\) and note that for our construction \(d = O(nT+n^2)=O(n^r)\) and \(\epsilon = \Omega(n^{-\ifrac{\alpha}{4}})\); the sample complexity upper bound \(O(d^p/\epsilon^q)\) can be therefore rewritten in terms of \(n\) as \(O(n^{rp + \alpha q/4})\), and since this should asymptotically upper bound the number of samples \(n\), one must have that \(rp + \tfrac14 \alpha q \geq 1\).↩︎
The original construction by [1] satisfied slightly different conditions, which we adjust here for our analysis.↩︎
The summation starts at \(k=2\) due to technical reasons that will become apparent later in this proof sketch.↩︎
One simple approach is to utilize a one-dimensional encoding space to encode every individual training example \(V \in P(U)\) in the least significant bits of \({w_t}^{(0)}\), in a way that guarantees there are no collisions between different possible values of such sets. This allows the subgradient oracle to calculate the specific \(u_0\) from the training set encoded in the least significant bits of \({w_t}^{(0)}\) and return it as a subgradient.↩︎
For this value of \(k\), it holds that \(\max_{u \in U} \cbr{\tfrac{3}{8}\langle u,{w}^{(k)}\rangle - \tfrac{1}{2}\langle u,{w}^{(k+1)}\rangle} = \frac{3}{16}\eta\) (attained at \(u=u_0\)), whereas for other values of \(k\) this quantity is at most \(\approx \frac{1}{8} \cdot \frac{3}{8} \eta + \frac{1}{8} \cdot \left(\frac{1}{2}\right)^2 \eta < \frac{1}{8} \eta\) due to the near-orthogonality of vectors in \(U\). It follows that the subgradient is a vector \(g\) such that \({g}^{(k)}=\frac{3}{8}u_0\), \({g}^{(k+1)}=-\frac{1}{2}u_0\) (and zeros elsewhere).↩︎