Abstract
Optimization in machine learning typically deals with the minimization of empirical objectives defined by training data. The ultimate goal of learning, however, is to minimize the error on future data (test error), for which the training data provides only partial information. In this view, the optimization problems that are practically feasible are based on inexact quantities that are stochastic in nature. In this paper, we show how probabilistic results, specifically gradient concentration, can be combined with results from inexact optimization to derive sharp test error guarantees. By considering unconstrained objectives, we highlight the implicit regularization properties of optimization for learning.
1 Introduction
Optimization plays a key role in modern machine learning, and is typically used to define estimators by minimizing empirical objective functions [1]. These objectives are based on a data fit term, suitably penalized, or constrained, to induce an inductive bias in the learning process [2]. The idea is that the empirical objectives should provide an approximation to the error on future data (the test error) which is the quantity that one wishes to minimize in learning. The quality of such an approximation error is typically deferred to a statistical analysis. In this view, optimization and statistical aspects are tackled separately.
Recently, a new perspective has emerged in machine learning showing that optimization itself can in fact directly be used to search for a solution with small test error. Interestingly, no explicit penalties/constraints are needed, since a bias in the search for a solution is implicitly enforced during the optimization process. This phenomenon has been called implicit regularization and it has been shown to possibly play a role in explaining the learning curves observed in deep learning, see for instance [3, 4] and the references therein. Further, implicit regularization has been advocated as a way to improve the efficiency of learning methods by tackling statistical and optimization aspects at once [5,6,7,8]. As it turns out, implicit regularization is closely related to the notion of iterative regularization with a long history in inverse problems [9].
The basic example of implicit regularization is gradient descent for linear least squares, which is well known to converge to the minimum norm least squares solution [10, 11]. The learning properties of gradient descent for least squares are now quite well understood [11, 12], including the extensions to nonlinear kernelized models [13, 14], stochastic gradients [15,16,17], accelerated methods [18, 19] and distributed approaches [20,21,22]. Much less is known when other norms or loss functions are considered. Implicit regularization biased to more general norms has been considered for example in [23, 24]. Implicit regularization for loss functions other than the square loss has been considered in a limited number of works. There is a vast literature on stochastic gradient techniques, see e.g. [17] and the references therein, but these analyses do not apply when (batch) training error gradients are used, which is the focus in this work. The logistic loss function for classification has recently been considered both for linear and nonlinear models, see for example [25, 26]. Implicit regularization for general convex Lipschitz loss with linear and kernel models have been first considered in [27] for subgradient methods and in [28] for stochastic gradient methods but only with suboptimal rates. Improved rates have been provided in [6] for strongly convex losses and more recently in [29] with a general but complex analysis. A stability based approach, in the sense of [30], is studied in [31].
In this paper, we further push this line of work considering implicit regularization for linear models with convex, Lipschitz and smooth loss functions based on gradient descent. Indeed, for this setting we derive sharp rates considering both the last and the average iterate. Our approach highlights a proof technique which is less common in learning and is directly based on a combination of optimization and statistical results. The usual approach in learning theory is to derive optimization results for empirical objectives and then use statistical arguments to assess to which extent the empirical objectives approximate the test error that one ideally wished to minimize, see e.g. [2]. Instead, we view the empirical gradient iteration as the inexact version of the gradient iteration for the test error. This allows to apply results from inexact optimization, see e.g. [32, 33], and requires using statistical/probabilistic arguments to assess the quality of the gradient approximations (rather than that of the objective functions). For this latter purpose, we utilize recent concentration of measure results for vector valued variables to establish gradient concentration [34]. While the idea of combining inexact optimization and concentration results has been considered before [35], here, we illustrate it in a prominent way to highlight its usefulness. Indeed, we show that this approach leads to sharp results for a specific but important setting and we provide some simple numerical results that illustrate and corroborate our findings. By highlighting the key ideas in the proof techniques, we hope to encourage further results combining statistics and optimization, for example considering other forms of gradient approximation or optimization other than the basic gradient descent.
The remainder of the paper is structured as follows: In Sect. 2, we collect some structural assumptions for our setting. In Sect. 3, we formulate the assumptions we put on the loss function and state and discuss the main results of the paper as well as the novel aspects of our approach. Section 4 presents the more technical aspects of the analysis. In particular, we explain in detail how results from inexact optimization and concentration of measure can be combined to come up with a new proof technique for learning rates. Finally, Sect. 5 illustrates the key features of our theoretical results with numerical experiments.
2 Learning with gradient methods and implicit regularization
Let \( ( {\mathcal {H}}, \Vert \cdot \Vert ) \) be a real, separable Hilbert space and \( {\mathcal {Y}} \) a subset of \( {\mathbb {R}} \). We consider random variables (X, Y) on a probability space \( ( \Omega , {\mathscr {F}}, {\mathbb {P}} ) \) with values in \( {\mathcal {H}} \times {\mathcal {Y}} \) and unknown distribution \( {\mathbb {P}}_{(X, Y)} \). The marginal distribution of X is denoted by \( {\mathbb {P}}_{X} \). Additionally, we make the standard assumption that X is bounded.

(A1)
(Bound): We assume \( \Vert X \Vert \le \kappa \) almost surely for some \( \kappa \in [ 1, \infty ) \).
Based on the observation of n i.i.d. copies \( ( X_{1}, Y_{1} ), \dots ( X_{n}, Y_{n} ) \) of (X, Y) , we want to learn a linear relationship between X and Y expressed as an element \( w \in {\mathcal {H}} \).^{Footnote 1} For an individual observation (X, Y) and the choice \( w \in {\mathcal {H}} \), we suffer the loss \( \ell ( Y, \langle X, w \rangle ) \), where \( \ell : {\mathcal {Y}} \times {\mathbb {R}} \rightarrow [ 0, \infty ) \) is a productmeasurable loss function. Our goal is to find \( w \in {\mathcal {H}} \) such that the population risk \( {\mathcal {L}}: {\mathcal {H}} \rightarrow [ 0, \infty ) \) given by
is small. The observed data represent the training set, while the population risk can be interpreted as an abstraction of the concept of the test error.
In the following, we assume that a minimizer of \( {\mathcal {L}} \) in \( {\mathcal {H}} \) exists.

(A2)
(Min): We assume there exists some \( w_{*} \in {\mathcal {H}} \) such that \( w_{*} \in \text {argmin}_{ w \in {\mathcal {H}} } {\mathcal {L}}(w) \).
Note that the \( \text {argmin} \) is taken only over \( {\mathcal {H}} \) and not over all measurable functions. Under (Min), minimizing the population risk is equivalent to minimizing the excess risk \( {\mathcal {L}}(w)  {\mathcal {L}}( w_{*} ) \ge 0 \).
In this work, we are interested in bounding the excess risk, when our choice of w is based on applying gradient descent (GD) to the empirical risk \( \widehat{ {\mathcal {L}} }: {\mathcal {H}} \rightarrow [ 0, \infty ) \) with
computed from the training data. We consider a basic gradient iteration, which is well defined when the loss function is differentiable in the second argument with a productmeasurable derivative \( \ell ': {\mathcal {Y}} \times {\mathbb {R}} \rightarrow {\mathbb {R}} \).
Definition 1
(Gradient descent algorithm)

1.
Choose \( v_{0} \in {\mathcal {H}} \) and a sequence of step sizes \( ( \gamma _{t} )_{t \ge 0} \).

2.
For \( t = 0, 1, 2, \dots \), define the GDiteration
$$\begin{aligned} v_{t+1} = v_t  \gamma _t \nabla \widehat{ {\mathcal {L}} }( v_t ) = v_t  \frac{\gamma _t}{n} \sum _{j = 1}^n \ell '(Y_j , \langle X_{j}, v_{t} \rangle ) X_j. \end{aligned}$$(3) 
3.
For some \( T \ge 1 \), we consider both the last iterate \( v_{T} \) and the averaged GDiterate \( {\overline{v}}_{T}: = \frac{1}{T} \sum _{t = 1}^{T} v_{t} \).
Here, we focus on batch gradient, so that all training points are used in each iteration. Unlike with stochastic gradient methods, the gradients at different iterations are not conditionally independent. Indeed, the analysis of batch gradient is quite different to that of stochastic gradient and could be a first step towards considering minibatching [17, 35, 36]. In our analysis, we always fix a constant step size \( \gamma _{t} = \gamma > 0 \) for all \( t \ge 0 \) and consider both the average and last iterate. Both choices are common in the optimization literature [1] and have also been studied in the context of learning with least squares [14, 16, 17], see also our extended discussion in Sect. 3.2. In the following, we characterize the learning properties of the gradient iteration in Definition 1 in terms of the corresponding excess risk. In particular, we derive learning bounds matching the best known bounds for estimators obtained minimizing the penalized empirical risk. Next, we show that in the considered setting, learning bounds can be derived by studying suitable bias and variance terms controlled by the iteration number and the step size.
3 Main results and discussion
Before stating and discussing our main results, we introduce and comment on the basic assumptions needed in our analysis. We make the following additional assumptions on the loss function.

(A3)
(Conv): We assume \( \ell : {\mathcal {Y}} \times {\mathbb {R}} \rightarrow [ 0, \infty ) \) is convex in the second argument.

(A4)
(Lip): We assume \( \ell \) to be LLipschitz, i.e. for some \( L > 0 \),
$$\begin{aligned} \ell (y, a)  \ell (y, b) \le L a  b \qquad \text { for all } y \in {\mathcal {Y}}, a, b \in {\mathbb {R}}. \end{aligned}$$(4) 
(A5)
(Smooth): We assume \( \ell \) to be Msmooth, i.e. \( \ell \) is differentiable in the second argument with productmeasurable derivative \( \ell ': {\mathcal {Y}} \times {\mathbb {R}} \rightarrow {\mathbb {R}} \) and for some \( M > 0 \),
$$\begin{aligned} \ell '(y, a)  \ell '(y, b) \le M a  b \qquad \text { for all } y \in {\mathcal {Y}}, a, b \in {\mathbb {R}}. \end{aligned}$$(5)Note that Eq. (5) immediately implies that
$$\begin{aligned} \ell (y, b) \le \ell (y, a) + \ell '(y, a) ( b  a ) + \frac{M}{2} b  a ^{2} \qquad \text { for all } y \in {\mathcal {Y}}, a, b \in {\mathbb {R}}, \end{aligned}$$(6)see e.g. Lemma 3.4 in [37].
For notational convenience, we state the assumptions (Lip) and (Smooth) globally for all \( a, b \in {\mathbb {R}} \). It should be noted, however, that this is not necessary.
Remark 1
(Local formulation of assumptions) In our analysis, we only apply (Lip) and (Smooth) for arguments of the form \( a = \langle v, x \rangle \), where \( \Vert v \Vert \le R \) for \( R = \max \{ 1, 3 \Vert w_{*} \Vert \} \) and \( \Vert x \Vert \le \kappa \) with \( \kappa \) from (Bound). Therefore, all of our results also apply to loss functions which satisfy the above assumptions for all \( a, b \in [  \kappa R, \kappa R ] \) for constants L and M potentially depending on \( \kappa \) and R.
In light of Remark 1, our analysis is applicable to many widely used loss functions, see e.g. Chapter 2 in [38].
Example 1
(Loss functions satisfying the assumptions)

(a)
(Squared loss): If \( {\mathcal {Y}} = [  b, b ] \) for some \( b > 0 \), then checking first and second derivatives yields that the loss \( {\mathcal {Y}} \times [  \kappa R, \kappa R ] \ni ( y, a ) \mapsto ( y  a )^{2} \) is convex, LLipschitz with constant \( L = 2 ( b + \kappa R ) \) and MSmooth with constant \( M = 2 \).

(b)
(Logistic loss for regression): If \( {\mathcal {Y}} = {\mathbb {R}} \), then, analogously, the loss \( {\mathcal {Y}} \times {\mathbb {R}} \ni ( y, a ) \mapsto  \log \Big ( \frac{ 4 e^{y  a} }{ ( 1 + e^{y  a} )^{2} } \Big ) \) is convex, LLipschitz with constant \( L = 1 \) and Msmooth with constant \( M = 1 \).

(c)
(Logistic loss for classification): For classification problems with \( {\mathcal {Y}} = \{  1, 1 \} \), analogously, the loss \( {\mathcal {Y}} \times {\mathbb {R}} \ni ( y, a ) \mapsto \log ( 1 + e^{ y a} ) \) is convex, LLipschitz with constant \( L = 1 \) and MSmooth with constant \( M = 1 / 4 \).

(d)
(Exponential loss): For classification problems with \( {\mathcal {Y}} = \{  1, 1 \} \), analogously, the loss \( {\mathcal {Y}} \times [  \kappa R, \kappa R ] \ni ( y, a ) \mapsto e^{ y a} \) is convex, LLipschitz with constant \( L = e^{\kappa R} \) and Msmooth also with \( M = e^{\kappa R} \).
Under Assumption (Smooth), the empirical risk \( w \mapsto \widehat{ {\mathcal {L}} }(w) \) is differentiable and we have
With Assumptions (Bound) and (Lip), via dominated convergence, the same is true for the population risk \( w \mapsto {\mathcal {L}}(w) \) and we have
Further, our assumptions on the loss directly translate into properties of the risks:

(A3’)
(RConv): Under (Conv), both the population and the empirical risk are convex.

(A4’)
(RLip): Under (Bound) and (Lip), both the population and the empirical risk are Lipschitzcontinuous with constant \( \kappa L \).

(A5’)
(RSmooth): Under (Bound) and (Smooth), the gradient of both the population and the empirical risk is Lipschitzcontinuous with constant \( \kappa ^{2} M \).
The derivation, which is straightforward, is included in Lemma 8 in Appendix A.
3.1 Formulation of main results
A first key result shows that under the above assumptions, we can decompose the excess risk for the averaged GDiterate \( {\overline{v}}_{T} \) as well as for the last iterate \( v_{T} \).
Proposition 1
(Decomposition of the excess risk) Suppose assumptions (Bound), (Conv) and (Smooth) are satisfied. Consider the GDiteration from Definition 1with \(T \in {\mathbb {N}} \) and constant step size \( \gamma \le 1 / ( \kappa ^{2} M ) \) and let \( w \in {\mathcal {H}} \) be arbitrary.

(i)
The risk of the averaged iterate \( {\overline{v}}_{T} \) satisfies
$$\begin{aligned} {\mathcal {L}}( {\overline{v}}_{T} )  {\mathcal {L}}(w)&\le \frac{1}{T} \sum _{t = 1}^{T} {\mathcal {L}}( v_t )  {\mathcal {L}}(w) \\&\le \frac{ \Vert v_{0}  w \Vert ^{2} }{ 2 \gamma T } + \frac{1}{T} \sum _{t = 1}^{T} \langle \nabla {\mathcal {L}}( v_{t  1} )  \nabla \widehat{ {\mathcal {L}} }( v_{t  1} ), v_{t}  w \rangle . \end{aligned}$$ 
(ii)
The risk of the last iterate \( v_{T} \) satisfies
$$\begin{aligned} {\mathcal {L}}( v_{T} )  {\mathcal {L}}(w)&\le \frac{1}{T} \sum _{ t = 1 }^{T} ( {\mathcal {L}}( v_{t} )  {\mathcal {L}}(w) ) \\&+ \sum _{ t = 1 }^{ T  1 } \frac{1}{ t ( t + 1 ) } \sum _{ s = T  t + 1 }^{T} \langle \nabla {\mathcal {L}}( v_{ s  1 } )  \nabla \widehat{ {\mathcal {L}} }( v_{ s  1 } ), v_{s}  v_{ T  t } \rangle . \end{aligned}$$
The proof of Proposition 1 can be found in Appendix A. The above decomposition is derived using ideas from inexact optimization, in particular results studying inexact gradients, see e.g. [32, 33]. Indeed, our descent procedure can be regarded as one in which the population gradients are perturbed by the gradient noise terms
We further develop this discussion in Sect. 4.1.
Note that the results above apply to any \( w \in {\mathcal {H}} \). Later, we will of course set \( w = w_{*} \) from Assumption (Min). With this choice, Proposition 1 provides decompositions of the excess risk into a deterministic bias part
which can be seen as an optimization error, and a stochastic variance part, which is an average of the terms
Note that Proposition 1 (i) can be applied to the first sum on the righthand side in (ii). In order to control the bias part, it is sufficient to choose \( \gamma T \) large enough. Controlling the variance part is more subtle and requires some care. By CauchySchwarz inequality,
A similar estimate holds for the terms \( \langle  e_{ s  1 }, v_{s}  v_{ T  t } \rangle \), \( s = T  t + 1, \dots T \). This shows that in order to upper bound the excess risk of the gradient iteration, it is sufficient to solve two problems:

1.
Bound the gradient noise terms \( e_{ t  1 } = \nabla \widehat{ {\mathcal {L}} }( v_{ t  1 } )  \nabla {\mathcal {L}} ( v_{ t  1 } ) \) in norm;

2.
Bound the gradient path \( ( v_{t} )_{ t \ge 0 } \) in a ball around \( w_{*} \).
Starting from this observation, in Proposition 5, we state a general gradient concentration result which, for fixed \( R > 0 \), allows to derive
with high probability in \( \delta \) when n is sufficiently large. If we could prove that the gradient path \( ( v_{t} )_{ t \ge 0 } \) stays bounded, this would allow to control the gradient noise terms. Interestingly, the result in Eq. (13) itself is enough to directly derive a bound for the gradient path. In Proposition 7, we show how gradient concentration can be used to inductively prove that with high probability, \( \Vert v_{t}  w_{*} \Vert \) stays bounded by \( R = \max \{ 1, 3 \Vert w_{*} \Vert \} \) for \( t \le T \) sufficiently large. Importantly, gradient concentration thereby allows to control the generalization error of the excess risk and the deviation of the gradient path at the same time. This makes this proof technique particularly appealing comparative to other approaches in the literature, see the discussion in Sects. 3.2 and 4. Taken together, the arguments above are sufficient to prove sharp rates for the excess risk.
Theorem 2
(Excess Risk) Suppose Assumptions (Bound), (Conv), (Lip), (Smooth) and (Min) are satisfied. Let \( v_{0} = 0 \), \( T \ge 3 \) and choose a constant step size \( \gamma \le \min \{ 1 / ( \kappa ^{2} M ), 1 \} \) in the GDiteration from Definition 1. Then, for any \( \delta \in ( 0, 1 ] \), such that
the average iterate \( {\overline{v}}_{T} \) and the last iterate \( v_{T} \) satisfy with probability at least \( 1  \delta \) that
In particular, setting \( \gamma T = \sqrt{n} / ( 90 \kappa ^{2} ( 1 + \kappa L ) ( M + L ) \sqrt{\log (4 / \delta )} ) \) yields
The proof of Theorem 2 is in Appendix A. To the best of our knowledge, it is not known if the above given rate of convergence is minimax optimal as there are no lower bounds so far in the literature for our set of assumptions on the class of loss functions. We emphasize, however, that the above bound for averaged GD with constant stepsize matches the minimax optimal rate for the least squares loss, see [14].
The gradient concentration inequality allows to derive an explicit estimate for the variance part. As expected, the latter improves as the number of samples increases, but interestingly it stays bounded, provided that \(\gamma T\) is not too large, see Eq. (14). Optimizing the choice of \(\gamma T\) leads to the final excess risk bound. The estimate is sharp in the sense that it matches the best available bounds for other estimation schemes based on empirical risk minimization with \( \ell _2\)penalties, see e.g. [2, 38] and the references therein. We note that the average and last iterates have essentially the same performance, up to constants and logarithmic terms.
A number of different choices for the stopping time T and the step size \(\gamma \) are possible, as long as their product stays constant. Assuming that \( \kappa \) from (Bound) is known, the user may choose the step size \( \gamma \) a priori when M from (Smooth) is known, see Example 1 (a), (b), (c). When M depends on the bound \( R = \max \{ 1, 3 \Vert w_{*} \Vert \} \), see Proposition 7, the choice of \( \gamma \) must be adapted to the norm of the minimizer \( w_{*} \), see e.g. Example 1 (d) and the discussion in Remark 1. In this sense, it is indeed the product \( \gamma T \) that plays the role of a regularization parameter, see also the simulations in Sect. 5.
The excess risk bound in the Theorem 2 matches the best bound for least squares, obtained with an ad hoc analysis [11, 12]. The obtained bound improves the results obtained in [27] and matches the rates for SGD in Theorem 4 of [29]. These latter results are more general and allow to derive fast rates. The generality is payed for, however, in terms of a considerably more complex analysis. In particular, our analysis allows to get explicit constants and keep the step size constant. More importantly, the proof we consider follows a different path, highlighting the connection to inexact optimization. We further develop this point of view next.
3.2 Discussion of related work
Comparison to the classical approach. In order to better locate our work in the machine learning and statistical literature, we compare it with the most important related line of research.
We contrast our approach with the one typically used to study learning with gradient descent and general loss functions. We briefly review this latter and more classical approach. The following decomposition is often considered to analyze the excess risk at \( v_{t} \):
see e.g. [2, 39]. The second term in the decomposition can be seen as an optimization error and treated by deterministic results from “exact” optimization. The first and last terms are stochastic and are bounded using probabilistic tools. In particular, the first term, often called generalization error, needs some care. The two more common approaches are based on stability, see e.g. [30, 31], or empirical process theory [38, 40]. The latter is considered in [27, 29]. In this case, the key quantity is the empirical process defined as
Here, a main complication is that the iterates norm/path needs to be bounded, which is a delicate point, as discussed in detail in Sect. 4.2. In our approach, gradient concentration allows to find a sharp bound on the gradient path and at the same time to directly derive an excess risk bound, avoiding the decomposition in (15) and further empirical process bounds.
Inexact optimization and gradient concentration. We are not the first to employ tools from inexact optimization to treat learning problems, see [41] and [6]. A similar decomposition as in Proposition 1 together with a peeling argument instead of gradient concentration is used in [6]. There, the authors derive a bound for a “conditional excess risk”. More specifically, the risk is the conditional expectation, conditioned on the covariates, and is thus still a random quantity. The minimizer considered is the minimizer with respect to this random risk and therefore is a random quantity too. Additionally, their analysis requires strong convexity of the conditional risk with respect to the empirical norm. Our approach allows to overcome these two restrictions.
Also gradient concentration has been considered before, see e.g. [42, 43]. In [42], an analysis is developed under the assumption that minimization of the risk is constrained over a closed, convex and bounded set \( {\mathcal {W}} \subset {\mathbb {R}}^{d} \), which effectively acts as an explicit regularization. During their gradient iteration, a projection step is considered to enforce this constraint. As a consequence, the dimension d and the diameter of \( {\mathcal {W}} \) appear as key quantities that determine the error behavior of their algorithm. The same is essentially true for [43]. In comparison, our analysis is dimension free. More importantly, we do not constrain the minimization problem. Hence, we consider implicit rather than explicit regularization. Also from a technical point of view, this is a key difference. As we discuss in Sect. 4.2, bounding the gradient path is required in the absence of explicit constraints. The main contribution of our paper, as we see it, is to show that the combination of optimization and concentration of measure techniques presented allow to seamlessly control the excess risk and the length of the gradient path at the same time, whereas in other analyses, e.g. [29], these two tasks have to be separated and are much more involved.
Finally, we discuss the results in [35], of which we had not been aware until after having finished this work. This paper also combines inexact optimization and gradient concentration, albeit in a different way. In Theorem G.1., the authors consider stochastic gradient descent for a convex and smooth objective function on \( {\mathbb {R}}^{d} \), notably also on an unbounded domain. For their analysis, they introduce clipped versions of the stochastic gradients. They also borrow a decomposition of the excess risk from inexact optimization, although a different one. In particular, it is not straightforward that their decomposition would also yield results for the last gradient iteration. In a second step, they then use the conditional independence of gradient batches and a Bernsteintype inequality for Martingale differences to derive concentration for several terms involving the gradient noise. In comparison, instead of concentration based on individual batches, we use the full empirical gradients together with a uniform concentration result based on Rademacher complexities of Hilbert space valued function classes, see Sect. 4.2. On the one hand, our setting is more general, since we consider a Hilbert space instead of \( {\mathbb {R}}^{d} \). On the other hand, [35] are notably able to forgo property (RLip), i.e. their gradients can be unbounded. This is the main aspect of their analysis. As a consequence, their result is tailored to this setting and does not contain ours as a special case. With property (RLip), even on \( {\mathbb {R}}^{d} \), our result is much sharper. We avoid an additional \( \log \)factor and, more importantly, we are able to freely choose a large, fixed step size \( \gamma > 0 \). In Theorem G.1. of [35], the step size has to depend both on the number of iterations and the high probability guarantee of the result. Further, our results in Theorem 2 are particularly sharp with explicit constants and one clear regularization parameter \( \gamma T \) that can, in principle, be chosen via sample splitting and early stopping. Conversely, in order to control the unbounded gradients, [35] have to introduce two additional hyperparameters: the gradient clipping threshold \( \lambda \) and the batch size m. In their analysis, both of these have to be chosen in dependence of the true minimizer. Notably, the clipping threshold \( \lambda \) de facto regularizes the problem based on a priori knowledge of the true solution, the same way a bounded domain would. Developing these observations further would be an interesting venue for future research.
Last iterate vs. averaged iterates convergence. We compare our results to other high probability bounds for gradient descent. High probability bounds for both last iterate and (tail)averaged gradient descent with constant stepsize for least squares regression in Hilbert spaces are well established. Indeed, the former follows from [14, 44] as gradient descent belongs to the broader class of spectral regularization methods. This is well known in the context of inverse problems, see e.g. [10]. As observed in [17], also average gradient descent can be cast and analyzed in the spectral filtering framework. Average and last iterates can be seen to share essentially the same excess risk bound. The proof, however, is heavily tailored to least squares. Compared to these results, for smooth losses, we establish a high probability bound of order \( {\mathcal {O}}(1/\gamma T)\) for uniform averaging and \( {\mathcal {O}}(\log (T)/\gamma T)\) for last iterate GD, for any n sufficiently large, with constant stepsize, worsened only by a factor \(\log (T)\). We note that it was shown in [45] that the \(\log (T)\) factor is in fact necessary for Lipschitz functions for last iterate SGD and GD with decaying stepsizes. The authors derive a sharp high probability bound of order \( {\mathcal {O}}(\log (T)/\sqrt{T})\) for last iterate (S)GD, while uniform averaging achieves a faster rate of \( {\mathcal {O}}(1/\sqrt{T})\). Notably, this work even shows the stronger statement: Any convex combination of the last k iterates must incur a \(\log (T/k)\) factor. Finally, we note that [27] derive finite sample bounds for subgradient descent for convex losses considering the last iterate. In this work, early stopping gives a suboptimal rate with decaying stepsize and also an additional logarithmic factor. This vanishes under additional differentiability and smoothness for constant stepsize. We condense an overview about the rates of convergence for different variants of GD under specific assumptions in Tables 1 and 2.
4 From inexact optimization to learning
In this section, we further discuss the important elements of the proof. The alternative error decomposition we presented in Proposition 1 follows from taking the point of view of optimization with inexact gradients [32]. The idea is to consider an ideal GDiteration subject to noise, i.e.
where, the \( ( e_{t} )_{t \ge 0} \) are gradient noise terms. In Eq. (17), very general choices for \( e_{t} \) may be considered. Clearly, in our setting, we have
From this perspective, the empirical GDiteration can be seen as performing gradient descent directly on the population risk, where the gradient is corrupted with noise and convergence has to be balanced out with a control of the stability of the iterates. Next, we see how these ideas can be applied to the learning problem.
4.1 Inexact gradient descent
From the point of view discussed above, it becomes essential to relate both the risk and the norm of a fixed GDiteration to the gradient noise. In the following, we provide two technical Lemmas which do exactly that. Both results could also be formulated for general gradient noise terms \( ( e_{t})_{t \ge 0} \). For the sake of simplicity, however, we opt for the more explicit formulation in terms of the gradients. The proofs are based on entirely deterministic arguments and can be found in Appendix B.
Lemma 3
(Inexact gradient descent: Risk) Suppose assumptions (Bound), (Conv), and (Smooth) are satisfied. Consider the GDiteration from Definition 1with constant step size \( \gamma \le 1 / ( \kappa ^{2} M ) \) and let \( w \in {\mathcal {H}} \). Then, for any \( t \ge 1 \), the risk of the iterate \( v_{t} \) satisfies
Lemma 3 is the key component to obtain the decomposition of the excess risk in Proposition 1 for the averaged GDiteration. This online to batch conversion easily follows by exploiting the convexity of the population risk (RConv).
The next Lemma is crucial in providing a high probability guarantee for the boundedness of the gradient path in Proposition 7, which is necessary to apply gradient concentration to the decomposition of the excess risk in Proposition 1.
Lemma 4
(Inexact gradient descent: Gradient path) Suppose assumptions (Bound), (Conv), (Lip), (Smooth) and (Min) are satisfied and choose a constant step size \( \gamma \le \min \{ 1 / ( \kappa ^{2} M ) , 1 \} \) in Definition 1. Then, for any \( t \ge 0 \), the norm of the GDiterate \( v_{t + 1} \) is recursively bounded by
Assuming that for some fixed \( R > 0 \), \( \Vert v_{s}  w_{*} \Vert \le R \) for all \( s \le t \), Lemma 4 guarantees that
which, in combination with gradient concentration, allows for an inductive bound on \( \Vert v_{t + 1} \Vert \). Summarizing, Lemmas 3 and 4 can be regarded as tools to study our learning problem using gradient concentration directly.
4.2 Gradient concentration
In this section, we discuss how the gradient concentration inequality in Eq. (13) is derived using results from [34]. We use a gradient concentration result which is expressed in terms of the Rademacher complexity of a function class defined by the gradients \( w \mapsto \nabla {\mathcal {L}}(w) \) with
Since the gradients above are elements of the Hilbert space \( {\mathcal {H}} \), the notion of Rademacher complexities has to be stated for Hilbert spacevalued function classes, see [46].
Definition 2
(Rademacher complexities) Let \( ( {\mathcal {H}}, \Vert \cdot \Vert ) \) be a real, separable Hilbert space. Further, let \( {\mathcal {G}} \) be a class of maps \( g: {\mathcal {Z}} \rightarrow {\mathcal {H}} \) and \( Z = ( Z_{1}, \dots , Z_{n} ) \in {\mathcal {Z}}^{n} \) be a vector of i.i.d. random variables. We define the empirical and population Rademacher complexities of \( {\mathcal {G}} \) by
respectively, where \(\varepsilon =(\varepsilon _1 , ..., \varepsilon _n) \in \{1,+1\}^n\) is a vector of i.i.d. Rademacher random variables independent of Z.
In our setting, \( ( Z_{1}, \dots , Z_{n} ) = ( ( X_{1}, Y_{1} ), \dots , ( X_{n}, Y_{n} ) ) \). Fix some \( R > 0 \) and consider the scalar function class
and more importantly, the \( {\mathcal {H}} \)valued, composite function class
Under (Bound) and (Lip), we have
where \( \Vert \cdot \Vert _{\infty } \) denotes the \( \infty \)norm on the underlying probability space \( ( \Omega , {\mathscr {F}}, {\mathbb {P}} ) \). The gradient concentration result can now be formulated in terms of the empirical Rademacher complexity of \( {\mathcal {G}}_{R} \).
Proposition 5
(Gradient concentration) Suppose assumption (Bound) (Lip) and (Smooth) are satisfied and let \( R > 0 \). Then, for any \( \delta > 0 \),
with probability at least \( 1 \delta \), where \( G_R \) is defined in Eq. (24).
The proof of Proposition 5 is stated in Appendix B. To apply Proposition 5, we need to bound \( \widehat{ {\mathcal {R}} }_{n}( {\mathcal {G}}_{R} ) \). This can be done via relating the empirical Rademacher complexity of the composite function class \( {\mathcal {G}}_{R} \) to the complexity of the scalar function class \( {\mathcal {F}}_{R} \).
Lemma 6
(Bounds on the empirical Rademacher complexities) Fix \( R > 0\).

(i)
Under (Bound), we have \( \widehat{ {\mathcal {R}} }( {\mathcal {F}}_{R} ) \le \frac{\kappa R}{\sqrt{n}} \).

(ii)
Under (Bound), (Lip) and (Smooth), we have
$$\begin{aligned} \widehat{ {\mathcal {R}} }( {\mathcal {G}}_{R} ) \le 2 \sqrt{2} \Big ( \frac{ \kappa L }{ \sqrt{n} } + \kappa M \widehat{ {\mathcal {R}} }( {\mathcal {F}}_{R} ) \Big ) \le \frac{ 2 \sqrt{2} ( \kappa L + \kappa ^{2} M R ) }{ \sqrt{n} }. \end{aligned}$$
Note that since the bounds in Lemma 6 do not depend on the sample \( ( X_{1}, Y_{1} ), \dots , ( X_{n}, Y_{n} ) \), they also hold for the population Rademacher complexities. Lemma 6 (i) is a classic result, which we restate for completeness. Lemma 6 (ii) is more involved and requires combining a vectorcontraction inequality from [46] with additional more classical contraction arguments to disentangle the concatenation in the function class \( {\mathcal {G}}_{R} \). The Proof of Lemma 6 is stated in Appendix B. Note that the arguments for both Proposition 5 and Lemma 6 are essentially contained in [34]. Here, we provide a selfcontained derivation for our setting.
Together with Lemma 4, the gradient concentration result provides an immediate high probability guarantee for the gradient path not to diverge too far from the minimizer \( w_{*} \).
Proposition 7
(Bounded gradient path) Suppose assumptions (Bound), (Conv), (Lip), (Smooth) and (Min) are satisfied, set \( v_{0} = 0 \) and choose a constant step size \( \gamma \le \min \{ 1 / ( \kappa ^{2} M ), 1 \} \) in Definition 1. Fix \( \delta \in (0, 1] \) such that
and \( R = \max \{ 1, 3 \Vert w_{*} \Vert \} \). Then, on the gradient concentration event from Proposition 5with probability at least \( 1  \delta \) for the above choice of R, we have
The proof of Proposition 7 is stated in Appendix B. In a learning setting, bounding the gradient path is essential to the analysis of gradient descent based estimation procedures. Either one has to guarantee its boundedness a priori, e.g. by projecting back onto a ball of known radius \( R > 0 \) or making highly restrictive additional assumptions, see [47], or one has to make usually involved arguments to guarantee its boundedness up to a sufficiently large iteration number, see e.g. [6, 29]. Our numerical illustrations in Sect. 5 show that from a practical perspective, such a boundedness result is indeed necessary to control the variance. Additionally, if the boundedness of the gradient path was already controlled by the optimization procedure for arbitrarily large iterations T, then the decomposition in Proposition 1 together with our gradient concentration result in Proposition 5 would guarantee that for \( T \rightarrow \infty \), the deterministic bias part \( \Vert w_{*} \Vert ^{2} / ( 2 \gamma T ) \) vanishes completely, while the stochastic variance part
would remain of order \( \sqrt{\log (4 / \delta ) / n} \) independently of T. This would suggest that for large T, there is no tradeoff between reducing the bias of the estimation method and its variance anymore, which, in that form, should be surprising for learning, see the discussion in [48]. From this perspective, to analyze gradient descent for learning, it seems necessary to establish a result like Proposition 7.
As stated above, several other results rely on bounding the gradient path to obtain bounds on the excess risk. We compare our result in Proposition 7 with the techniques used in [29], that are the most recent in the literature. Under the selfboundedness assumption
the authors relate the stochastic gradient descent iteration \( v_{t} \) to the Tikhonov regularizer \( w_{\lambda } \), whose norm can be controlled, and obtain a uniform bound over \( t = 1, \dots , T \) of the form
with high probability in \( \delta \). Later, the risk quantities in Eq. (28) are related to the approximation error of a kernel space. Inductively, this guarantees that the stochastic gradient path stays sufficiently bounded. For the bound in Eq. (28), the authors in [29] have to choose a decaying sequence of step sizes \( \gamma _{t} \) with \( \sum _{t = 1}^{T} \gamma _{t}^{2} < \infty \). In comparison, the result in Proposition 7 allows for a fixed step size \( \gamma > 0 \). Since sharp rates essentially require that \( \sum _{t = 0}^{T} \gamma _{t} \) is of order \( \sqrt{n} \), we may therefore stop the algorithm earlier. In this regard, our result is slightly sharper. At the same time, the result in [29] is more general. Under a capacity condition, the authors adapt the bound in Eq. (28) to allow for fast rates. However, both the proof of Eq. (28) and its adaptation to the capacity dependent setting are complex and quite technical. In comparison, Proposition 7 is an immediate corollary of Proposition 5. In particular, if under additional assumptions, a sharper concentration result for the gradients is possible, our proof technique would immediately translate this to the bound on the gradient path that is needed to guarantee this sharper rate for the excess risk. Indeed, we think these ideas can be fruitfully developed to get new improved results.
5 Numerics
In this section, we provide empirical illustrations of the effects described in Sects. 3 and 4. In particular, we consider the logistic loss for regression from Example 1 (b) and the exponential loss for classification Example 1 (d). We concentrate on two aspects: The (un)bounded gradient path for the averaged iterates and the interplay between step size and stopping time. Our experiments are conducted on synthetic data with \( d = 100 \) dimensions, generated as follows: We set the covariance matrix \( \Sigma \in {\mathbb {R}}^{ d \times d }\) as a diagonal matrix with entries \( \Sigma _{ j j } = j^{2} \), \( j = 1, \dots , d \) and choose \( w_{*} = \Sigma e \), with \( e = ( 1, \dots , 1 )^{ \top } \in {\mathbb {R}}^{d} \). We generate \( n_{ \text {train} } =1000 \) training data, where the covariates \( X_{j} \) are drawn from a Gaussian distribution with zero mean and covariance \( \Sigma \). For the logistic loss, the labels follow the model
with \( \varepsilon _{ j } \sim N( 0, 5 ) \) i.i.d. For the exponential loss, it is a well known fact that the risk is minimized by half the conditional logodds. Therefore, we choose the labels as independent observations of
such that Assumption (Min) is satisfied. Each experiment is repeated 1000 times and we report the average. The results are presented in Figs. 1 and 2.
Our first experiment illustrates the behavior of the path \( t \mapsto  v_t  w_*  \) for a fixed step size. We report the average path length together with the minimum and maximum path lengths. As Proposition 7 suggests, the path becomes unbounded when the number of iterations grows large.
In a second experiment, we choose a grid of step sizes \( \gamma \) and stopping times T and report the average excess test risk with \(n_{ \text {test} } = \lceil n_{ \text {train} } / 3 \rceil \) test data. Note that the grid of step sizes is chosen differently for the individual loss functions, since larger values of the Lipschitz constant \( M \) of the gradient require smaller step sizes. As Theorem 2 predicts, for fixed \(n_{ \text {train} }\), the performance of averaged GD remains roughly constant as \(\gamma \cdot T\) remains constant.
6 Conclusion
In this paper, we studied implicit/iterative regularization for possibly infinite dimensional, linear models, where the error cost is a convex, differentiable loss function. Our main contribution is a sharp high probability bound on the excess risk of the averaged and last iterate of batch gradient descent. We derive these results combining ideas and results from optimization and statistics. Indeed, we show how it is possible to leverage results from inexact optimization together with concentration inequalities for vector valued functions. The theoretical results are illustrated to see how the step size and the iteration number control the bias and the stability of the solution.
A number of research directions can further be developed. In our study, we favored a simple analysis to illustrate the main ideas, and as a consequence our results are limited to a basic setting. It would be interesting to develop the analysis we presented to get faster learning rates under further assumptions, for example considering capacity conditions or even finite dimensional models. Another possible research direction is to consider less regular loss functions, dropping the differentiability assumption. Along similar lines it would be interesting to consider other forms of implicit bias or non linear models. Finally, other forms of optimization, including stochastic and accelerated methods, could be considered.
Data availibility statement
The source code of the simulation study is available from the authors upon request.
Notes
Note that this includes many settings as special instances. In particular, it includes the standard setting of kernel learning, see Appendix A in [5].
References
Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. Neural Information Processing. The MIT Press, Cambridge (2011)
ShalevShwartz, S., BenDavid, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York (2014)
Gunasekar, S., Lee, J., Soudry, D., Srebro, N.: Characterizing Implicit Bias in Terms of Optimization Geometry. In: International Conference on Machine Learning, pp. 1832–1841. PMLR (2018)
Neyshabur, B.: Implicit Regularization in Deep Learning. arXiv:1709.01953 [stat.ML] (2017)
Rosasco, L., Villa, S.: Learning with incremental iterative regularization. In: Advances in Neural Information Processing Systems, vol. 28. Curran Associates, Inc., Redhook, NY (2015)
Yang, F., Wei, Y., Wainwright, M.J.: Early stopping for kernel boosting algorithms: a general analysis with localized complexities. IEEE Trans. Inf. Theory 65(10), 6685–6703 (2019)
Blanchard, G., Hoffmann, M., Reiß, M.: Early stopping for statistical inverse problems via truncated SVD estimation. Electron. J. Stat. 12(2), 3204–3231 (2018)
Celisse, A., Wahl, M.: Analyzing the discrepancy principle for kernelized spectral filter learning algorithms. J. Mach. Learn. Res. 22(76), 1–59 (2021)
Landweber, L.: An iteration formula for fredholm integral equations of the first kind. Am J Math 73, 615–624 (1951)
Engl, H., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Mathematics and its Applications, vol. 375. Kluwer Academic Publishers, Dordrecht (1996)
Yao, Y., Caponetto, A., Rosasco, L.: On early stopping in gradient descent learning. Constr. Approx. 26, 289–315 (2007)
Raskutti, G., Yu, B., Wainwright, M.J.: Early stopping and nonparametric regression: an optimal datadependent stopping rule. J. Mach. Learn. Res. 15, 335–366 (2014)
Bauer, F., Pereverzev, S., Rosasco, L.: On regularization algorithms in learning theory. J. Complex. 23(1), 52–72 (2007)
Blanchard, G., Mücke, N.: Optimal rates for regularization of statistical inverse learning problems. Found. Comput. Math. 18, 971–1013 (2018)
Dieuleveut, A., Flammarion, N., Bach, F.: Harder, better, faster, stronger convergence rates for leastsquares regression. J. Mach. Learn. Res. 18(1), 3520–3570 (2017)
Dieuleveut, A., Bach, F.: Nonparametric stochastic approximation with large stepsizes. Ann. Stat. 44(4), 1363–1399 (2016)
Mücke, N., Neu, G., Rosasco, L.: Beating SGD Saturation with Tailaveraging and Minibatching. In: Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc., Redhook, NY (2019)
Blanchard, G., Krämer, N.: Convergence rates of kernel conjugate gradient for random design regression. Anal. Appl. 14(06), 763–794 (2016)
Pagliana, N., Rosasco, L.: Implicit Regularization of Accelerated Methods in Hilbert Spaces. In: Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc., Redhook, NY (2019)
Zhang, Y., Duchi, J., Wainwright, M.J.: Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates. J. Mach. Learn. Res. 16(102), 3299–3340 (2015)
Mücke, N., Blanchard, G.: Parallelizing Spectrally Regularized Kernel Algorithms. J. Mach. Learn. Res. 19(1), 1069–1097 (2018)
Richards, D., Rebeschini, P.: Graphdependent implicit regularisation for distributed stochastic subgradient descent. J. Mach. Learn. Res. 21(2020), 34–13444 (2020)
Vaškevičius, T., Kanade, V., Rebeschini, P.: The Statistical Complexity of Early Stopped Mirror Descent. arXiv:2002.00189 [stat.ML] (2020)
Villa, S., Matet, S., Vu, B.C., Rosasco, L.: Don’t relax: early stopping for convex regularization. arXiv:1707.05422 [stat.ML] (2017)
Soudry, D., Hoffer, E., Nacson, M.S., Gunasekar, S., Srebro, N.: The implicit bias of gradient descent on separable data. J. Mach. Learn. Res. 19(1), 2822–2878 (2018)
Ji, Z., Telgarsky, M.: The implicit bias of gradient descent on nonseparable data. In: Conference on learning theory, vol. 99, pp. 1772–1798. PMLR, (2019)
Lin, J., Rosasco, L., Zhou, D.: Iterative regularization for learning with convex loss functions. J. Mach. Learn. Res. 17(1), 2718–2755 (2016)
Lin, J., Camoriano, R., Rosasco, L.: Generalization properties and implicit regularization for multiple passes SGM. In: International Conference on Machine Learning, pp. 2340–2348. PMLR, (2016)
Lei, Y., Hu, T., Tang, K.: Generalization performance of multipass stochastic gradient descent with convex loss functions. J. Mach. Learn. Res. 22(25), 1–41 (2021)
Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499–526 (2002)
Chen, Y., Jin, C., Yu, B.: Stability and convergence tradeoff of iterative optimization algorithms. arXiv:1804.01619 [stat.ML] (2018)
Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10(3), 627–642 (2000)
Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximalgradient methods for convex optimization. In: Advances in Neural Information Processing Systems, vol. 24. Curran Associates, Inc., Redhook, NY (2011)
Foster, D.J., Sekhari, A., Sridharan, K.: Uniform convergence of gradients for nonconvex learning and optimization. In: Advances in Neural Information Processing Systems, vol. 31. Curran Associates, Inc., Redhook, NY (2018)
Gorbunov, E., Danilova, M., Gasnikov, A.: Stochastic optimization with heavytailed noise via accelerated gradient clipping. In: Advances in Neural Information Processing Systems. Curran Associates, Inc., Redhook, NY (2020)
Lin, J., Rosasco, L.: Optimal rates for multipass stochastic gradient methods. J. Mach. Learn. Res. 18(1), 3375–3421 (2017)
Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3–4), 231–357 (2015)
Steinwart, I., Christmann, A.: Support Vector Machines. Information Science and Statistics. Springer, New York (2008)
Bottou, L., Bousquet, O.: The tradeoffs of large scale learning. In: Optimization for Machine Learning, pp. 351–368. MIT Press (2011)
Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press, Oxford (2013)
Balakrishnan, S., Wainwright, M.J., Yu, B.: Statistical guarantees for the EM algorithm: from population to samplebased analysis. Ann. Stat. 45(1), 77–120 (2017)
Holland, M.J., Ikeda, K.: Efficient learning with robust gradient descent. arXiv:1706.00182 [stat.ML] (2018)
Prasad, A., Suggala, A.S., Balakrishnan, S., Ravikumar, P.: Robust estimation via robust gradient estimation. arXiv:1802.06485 [stat.ML] (2018)
Lin, J., Rudi, A., Rosasco, L., Cevher, V.: Optimal rates for spectral algorithms with leastsquares regression over Hilbert spaces. Appl. Comput. Harmonic Anal. 48(3), 868–890 (2020)
Harvey, N., Liaw, C., Plan, Y., Randhawa, S.: Tight analyses for nonsmooth stochastic gradient descent. In: Conference on Learning Theory, pp. 1579–1613. PMLR (2019)
Maurer, A.: A Vectorcontraction Inequality for Rademacher Complexities. In: Algorithmic Learning Theory, vol. 9925, pp. 3–17. Springer, (2016)
Lei, Y., Tang, K.: Stochastic composite mirror descent: optimal bounds with high probability. In: Advances in Neural Information Processing Systems. Curran Associates, Inc., Redhook, NY (2018)
Derumigny, A., SchmidtHieber, J.: On lower bounds for the biasvariance tradeoff. arXiv:2006.00278 [stat.ML] (2020)
Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463–482 (2002)
Vershynin, R.: Highdimensional Probability. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2018)
Wainwright, M.J.: Highdimensional Statistics: A Nonasymptotic Viewpoint. Cambridge University Press, Cambridge (2019)
Acknowledgements
The authors would like to thank Silvia Villa, Francesco Orabona, Markus Reiß and Martin Wahl for useful discussions. The authors are also grateful for the comments of the two referees that helped to improve the manuscript.
Funding
Open Access funding enabled and organized by Projekt DEAL. The research of B.S. has been partially funded by the Deutsche Forschungsgemeinschaft (DFG) ProjectID 318763901  SFB1294. N.M. acknowledges funding by the Deutsche Forschungsgemeinschaft (DFG) under Excellence Strategy The Berlin Mathematics Research Center MATH+ (EXC2046/1, project ID:390685689). L.R. acknowledges support from the Center for Brains, Minds and Machines (CBMM), funded by NSF STC award CCF1231216. L.R. also acknowledges the financial support of the European Research Council (grant SLING 819789), the AFOSR projects FA95501817009, FA95501710390 and BAAAFRLAFOSR20160007 (European Office of Aerospace Research and Development), and the EU H2020MSCARISE project NoMADS  DLV777826.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethics approval
(Not applicable).
Consent to participate
(Not applicable).
Consent for publication
(Not applicable).
Conflict of interest
The authors have no relevant financial or nonfinancial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Proofs for Sect. 3
Lemma 8
(Properties of the risks)

(i)
Under (Conv), the population risk is convex, i.e., for all \( v, w \in {\mathcal {H}} \), we have
$$\begin{aligned} {\mathcal {L}}(v) \le {\mathcal {L}}(w)  \langle \nabla {\mathcal {L}}(v), w  v \rangle . \end{aligned}$$(A1) 
(ii)
Under (Bound) and (Lip), the population risk is Lipschitzcontinuous with constant \( \kappa L \), i.e., for all \(v, w \in {\mathcal {H}} \), we have
$$\begin{aligned} {\mathcal {L}}( v )  {\mathcal {L}}( w ) \le \kappa L \Vert v  w \Vert \end{aligned}$$(A2) 
(iii)
Under (Bound) and (Smooth), the gradient of the population risk is Lipschitzcontinuous with constant \( \kappa ^{2} M \), i.e., for all \( v, w \in {\mathcal {H}} \), we have
$$\begin{aligned} \Vert \nabla {\mathcal {L}}( v )  \nabla {\mathcal {L}}( w ) \Vert&\le \kappa ^{2} M \Vert v  w \Vert . \end{aligned}$$(A3)Note that this implies that
$$\begin{aligned} {\mathcal {L}}( w )&\le {\mathcal {L}}( v ) + \langle \nabla {\mathcal {L}}( v ), w  v \rangle + \frac{ \kappa ^{2} M }{ 2 } \Vert w  v \Vert ^{2}. \end{aligned}$$(A4)
Moreover, (i), (ii) and (iii) also hold for the empirical risk \( \widehat{ {\mathcal {L}} } \) with the same constants.
Proof

(i)
This follows directly from (Conv) and the linearity of the expectation.

(ii)
For \( v, w \in {\mathcal {H}} \), we have
$$\begin{aligned} {\mathcal {L}}(w)  {\mathcal {L}}(v) &= {\mathbb {E}}_{( X, Y )} [ \ell (Y, \langle X, w \rangle ) ]  {\mathbb {E}}_{( X, Y )} [ \ell (Y, \langle X, v \rangle ) ] \nonumber \\&\le L {\mathbb {E}}_{( X, Y )} [ \Vert X \Vert \Vert w  v \Vert ] \le \kappa L \Vert w  v \Vert , \end{aligned}$$(A5)where the first inequality follows from (Lip) and CauchySchwarz inequality and the second inequality follows from (Bound).

(iii)
For \( v, w \in {\mathcal {H}} \), we have
$$\begin{aligned} \Vert \nabla {\mathcal {L}} (w)  \nabla {\mathcal {L}}(v) \Vert&= \Vert {\mathbb {E}}_{( X, Y )} [ \ell '(Y, \langle X, w \rangle ) X ]  {\mathbb {E}}_{( X, Y )} [ \ell '(Y, \langle X, v \rangle ) X ] \Vert \nonumber \\&\le \kappa {\mathbb {E}}_{( X, Y )} [ \ell '(Y, \langle X, w \rangle ) ]  {\mathbb {E}}_{( X, Y )} [ \ell '(Y, \langle X, v \rangle ) ] \nonumber \\&\le \kappa M {\mathbb {E}}_{( X, Y )} [ \langle X, w  v \rangle ] \le \kappa ^{2} M \Vert w  v \Vert , \end{aligned}$$(A6)where the first and the third inequality follow from (Bound) and CauchySchwarz inequality and the second one follows from (Smooth).
\(\square \)
For the proof of the second part of Proposition 1, we need the following simple Lemma. A different version of this was put forward in a blog post by Francesco Orabona with a reference to the convergence proof of the last iterate of SGD in [27]. Since our version is different and for the sake of completeness, we give a full proof.
Lemma 9
Let \( (q_t)_{ t = 1,...,T } \) be a sequence of real numbers. Then,
Proof
Define
Then, any \( t \le T  1 \) satisfies
which implies
Inductively applying (A9), we obtain
\(\square \)
Proof of Proposition 1
(Decomposition of the excess risk)

(i)
From (RConv) and Lemma 3, we obtain
$$\begin{aligned}&\ \ \ \ \frac{1}{T} \sum _{t = 1}^{T} {\mathcal {L}}(v_{t})  {\mathcal {L}}(w) \nonumber \\&\quad \le \frac{1}{T} \sum _{t = 1}^{T} \frac{\Vert v_{t  1}  w \Vert ^{2}  \Vert v_{t}  w \Vert ^{2}}{2 \gamma } + \frac{1}{T} \sum _{t = 1}^{T} \langle \nabla {\mathcal {L}}( v_{t  1} )  \nabla \widehat{{\mathcal {L}}}( v_{t  1} ), v_{t}  w \rangle \nonumber \\&\quad \le \frac{\Vert v_{0}  w \Vert ^{2}}{2 \gamma T} + \frac{1}{T} \sum _{t = 1}^{T} \langle \nabla {\mathcal {L}}(v_{t  1})  \nabla \widehat{{\mathcal {L}}}(v_{t  1}), v_{t}  w \rangle , \end{aligned}$$(A11)where we have resolved the telescopic sum, to obtain the last inequality.

(ii)
Applying Lemma 9 with \( q_{t} = {\mathcal {L}}( v_{t} )  {\mathcal {L}}(w) \), we find
$$\begin{aligned} {\mathcal {L}}( v_{T} )  {\mathcal {L}}(w)&= \frac{1}{T} \sum _{ t = 1 }^{T} ( {\mathcal {L}}( v_{t} )  {\mathcal {L}}(w) ) \nonumber \\&+ \sum _{ t = 1 }^{ T  1 } \frac{1}{ t ( t + 1 ) } \sum _{ s = T  t + 1 }^{T} ( {\mathcal {L}}( v_{s} )  {\mathcal {L}}( v_{ T  t } ) ). \end{aligned}$$(A12)We aim at bounding the last sum in the above equality. Summing the bound in Lemma 3 from \(Tt+1\) to T yields that for all \( v \in {\mathcal {H}} \),
$$\begin{aligned} \sum _{ s = T  t + 1 }^{T} ( {\mathcal {L}}( v_{s} )  {\mathcal {L}}(v) )&\le \frac{1}{ 2 \gamma } \Vert v_{ T  t }  v \Vert ^{2} \nonumber \\&+ \sum _{ s = T  t + 1 }^{T} \langle \nabla {\mathcal {L}}( v_{ s  1 } )  \nabla \widehat{ {\mathcal {L}} }( v_{ s  1 } ), v_{s}  v \rangle . \end{aligned}$$(A13)Hence, setting \( v = v_{Tt} \) yields
$$\begin{aligned} \sum _{ s = T  t + 1 }^{ T } ( {\mathcal {L}}( v_{ s } )  {\mathcal {L}}( v_{ T  t } ) )&\le \sum _{ s = T  t + 1 }^{ T } \langle \nabla {\mathcal {L}}( v_{ s  1 } )  \nabla \widehat{ {\mathcal {L}} }( v_{ s  1 } ), v_{ s }  v \rangle . \end{aligned}$$(A14)The result follows by plugging the last inequality into (A12).
\(\square \)
Proof of Theorem 2
(Excess risk) We initially consider the case of the averaged GDiterate. By convexity, Proposition 1 and an application of CauchySchwarz inequality, we have
The assumptions of Theorem 2 are chosen exactly as in Proposition 7. Therefore, on the gradient concentration event with probability at least \( 1  \delta \) from Proposition 5 and the choice R as above, we have
where the last inequality is derived in exactly the same way as in the proof of Proposition 7. Plugging this into the inequality in Eq. (A15), we obtain
For the last iterate, we set \( e_{t}: = \nabla \widehat{ {\mathcal {L}} }( v_{t} )  \widehat{ {\mathcal {L}} }( v_{t} ) \), \( t = 1, \dots , T \) to reduce the notation. Proposition 1 with an application of CauchySchwarz yields
Now, by Propositions 5 and 7, if
we find with probability at least \( 1  \delta \) for all \( t = 0, \dots , T \), that
In particular,
for any \( s = T  t + 1, \dots T, t = 1, \dots , T \). Hence, with probability at least \( 1  \delta \),
Finally, since
we arrive at
Plugging in for \( R^{2} \) and simplifying the constant completes the proof. \(\square \)
Appendix B: Proofs for Sect. 4
Proof of Lemma 3
(Inexact gradient descent: Risk) By (RConv) (Eq. (A1)) and (RSmooth) (Eq. (A4)), the population risk is convex and \( \kappa ^{2} M \)smooth. We have
where the last inequality uses the fact that \( \gamma \le 1 / ( \kappa ^{2} M ) \). The statement now follows from
\(\square \)
Proof of Lemma 4
(Inexact gradient descent: Gradient path) For \( v, w \in {\mathcal {H}} \), the smoothness of the risk (RSmooth) (Eq. (A3)) implies that
see e.g. Equation (3.6) in [37]. In particular, since \( \nabla {\mathcal {L}}( w_{*} ) = 0 \), we have
Setting \( e_{s}: = \nabla \widehat{{\mathcal {L}}}( v_{s} )  \nabla {\mathcal {L}}( v_{s} ) \), we obtain that for any \( s \ge 0 \),
We treat the terms \( (\text {I}) \) and \( (\text {II}) \) separately: By Eq. (B27) and our choice of \( \gamma \le 1 / ( \kappa ^{2} M ) \), we have
Further, by (RLip) (Eq. (A2)), CauchySchwarz inequality and the fact that \( \gamma \le 1 \),
Together, Eqs. (B30) and (B31) yield
Summing over s then yields the result. \(\square \)
Proof of Lemma 6
(Bounds on the empirical Rademacher complexities) The first statement of Lemma 6 is a classical result, see e.g. [49].
For the second statement, recall that for any \( w \in {\mathcal {H}} \), we have \( \Vert w \Vert = \sup _{\Vert v \Vert = 1} \langle v, w \rangle \), since \( {\mathcal {H}} \) is assumed to be real. Thus, we may write
In order to bound the righthand side in Eq. (B33), we apply Theorem 2 from [46], which states that for functions \( \psi _{i}: {\mathcal {S}} \rightarrow {\mathbb {R}}, \phi _{i}: {\mathcal {S}} \rightarrow \ell ^{2}, i = 1, \dots , n, \) from a countable set \( {\mathcal {S}} \),
whenever it is satisfied that
Here, the \( ( \varepsilon _{ j, k } ) \) are i.i.d. copies of the \( ( \varepsilon _{ j } ) \).
Adopting the notation from this result, we may restrict the supremum in Eq. (B33) to a countable dense subset \( {\mathcal {S}} \) of \( {\mathcal {F}}_{R} \times \{ v \in {\mathcal {H}}: \Vert v \Vert \le 1 \} \). Note that this is possible, since by (Smooth), we have that \( \ell ' \) is continuous in the second argument. Further, set
Then, for any \( j = 1, \dots , n \), and \( ( f, v ), ( g, w ) \in {\mathcal {S}} \), we use that \( \Vert \ell ' \Vert _{\infty } \le L \) by (Lip), \( \Vert X_{j} \Vert \le \kappa \) by (Bound) and \( \Vert w \Vert \le 1 \) to obtain
where \( \Vert \cdot \Vert _{p, {\mathbb {R}}^{2}} \) denotes the pnorm on \( {\mathbb {R}}^{2} \). Equation (B37) shows that Theorem 2 from [46] is in fact applicable, which yields
We proceed by bounding each term individually. By Jensen’s inequality,
where we have used again that \( \Vert X_{j} \Vert \le \kappa \).
For the second summand, Talagrand’s contraction principle, see e.g. Exercise 6.7.7 in [50], together with the fact that by by (Smooth), \( \ell ' \) is MLipschitz yields the bound
due to the first part of this Lemma. Together, Eqs. (B39) and (B40) yield the result. \(\square \)
Proof of Proposition 5
(Gradient concentration) For \( (x, y) \in {\mathcal {H}} \times {\mathcal {Y}} \), \( f \in {\mathcal {F}} _{R} \) denote
Then \( g_f \in {\mathcal {G}}_R \). For any \( x_{j}, x_{j}' \in {\mathcal {H}} \) and \( y_{j}, y_{j}' \in {\mathbb {R}} \), \( j = 1, \dots , n \), we have
Therefore, McDiarmid’s bounded difference inequality, see e.g. Corollary 2.21 in [51], yields that on an event with probability at least \( 1  \delta \),
The expectation above can now be bounded by the result in Lemma 4 from [34], which states that
on an event with probability at least \( 1  \delta \). A union bound finally yields
on an event of at least probability \( 1  \delta \). \(\square \)
Proof of Proposition 7
(Bounded gradient path) Firstly, note that
Therefore, it suffices to prove that \( \Vert v_{t}  w_{*} \Vert \le 2 R / 3 \) on the gradient concentration event. We proceed via induction over \( t \le T \). For \( t = 0 \), this is trivially satisfied, since \( \Vert v_{1}  w_{*} \Vert = \Vert w_{*} \Vert \le R / 3 \). Now, assume that the result is true for \( s = 0, \dots , t < T \). From Lemma 4, we have
where \( {\mathcal {F}}_{R} \) is defined in Eq. (22).
On the gradient concentration event from Proposition 5, by Lemma 6 (ii), we have the bound
where \( G_{R} \le \kappa L \) by Eq. (24). Equation (25) guarantees that
and hence with \( 1 \le \sqrt{ \log (4 / \delta ) } \), on the gradient concentration event, we obtain that
Plugging the last bound into Eq. (B47) yields
Hence, we obtain our result when the second term above is smaller than \( 4 R ^{2} / 9 \), which is satisfied when
where we have used the fact that \( R \ge 1 \). This completes the proof. \(\square \)
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Stankewitz, B., Mücke, N. & Rosasco, L. From inexact optimization to learning via gradient concentration. Comput Optim Appl 84, 265–294 (2023). https://doi.org/10.1007/s10589022004085
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589022004085
Keywords
 Implicit regularization
 Kernel methods
 Statistical learning