Stochastic Inertial Dynamics via Time Scaling and Averaging

Published Online:https://doi.org/10.1287/stsy.2024.0068

Abstract

Our work is part of the close link between continuous-time dissipative dynamical systems and optimization algorithms, and more precisely here, in the stochastic setting. We aim to study stochastic convex minimization problems through the lens of stochastic inertial differential inclusions that are driven by the subgradient of a convex objective function. This will provide a general mathematical framework for analyzing the convergence properties of stochastic second-order inertial continuous-time dynamics involving vanishing viscous damping and measurable stochastic subgradient selections. Our chief goal in this paper is to develop a systematic and unified way that transfers the properties recently studied for first-order stochastic differential equations to second-order ones involving even subgradients in lieu of gradients. This program will rely on two tenets: time scaling and averaging, following an approach recently developed in the literature by one of the coauthors in the deterministic case. Under a mild integrability assumption involving the diffusion term and the viscous damping, our first main result shows that almost surely, there is weak convergence of the trajectory toward a minimizer of the objective function and fast convergence of the values and gradients. We also provide a comprehensive complexity analysis by establishing several new pointwise and ergodic convergence rates in expectation for the convex, strongly convex, and (local) Polyak-Łojasiewicz case. Finally, using Tikhonov regularization with a properly tuned vanishing parameter, we can obtain almost sure strong convergence of the trajectory toward the minimum norm solution.

Funding: This research was supported by Agence Nationale de la Recherche (ANR) [Projet-ANR-20-CE92-0037].

1. Introduction

1.1. Problem Statement

We consider the minimization problem

minxHF(x)=deff(x)+g(x),(P)
where H is a separable real Hilbert space, and the objective F satisfies the following standing assumptions:
{f:HR is continuously differentiable and convex with LLipschitzcontinuous gradient;g:HR{±} is proper, lower semicontinuous (lsc) and convex;SF=defargmin(F).(H0)

1.1.1. First-Order in Time Systems.

To solve (P) when g0, a fundamental dynamic is the gradient flow system:

{x˙(t)+f(x(t))=0,t>t0;x(t0)=x0.(GF)

The gradient system (GF) is a dissipative dynamical system, whose study dates back to Cauchy Cauchy (1847) in finite dimension. It plays a fundamental role in optimization: It transforms the problem of minimizing f into the study of the asymptotic behavior of the trajectories of (GF). This example was the precursor to the rich connection between continuous dissipative dynamical systems and optimization. It is well known since the founding papers of Brezis, Baillon, and Bruck in the 1970s that, if the solution set argmin(f) of (P) is nonempty, then each solution trajectory of (GF) converges weakly, and its (weak) limit belongs to argmin(f). Moreover, this dynamic is known to yield a convergence rate of O(t1) (in fact even o(t1)) on the values.

The Euler forward (a.k.a. Euler-Maruyama) discretization (GF), with stepsize sequence hk>0, is the celebrated gradient descent scheme

xk+1=xkhkf(xk).(GD)

Under (H0), and for (hk)kN]0,2/L[, then we have both the convergence of the values f(xk)min f=O(1/k) (in fact even o(1/k)), and the weak convergence of iterates (xk)kN to a point in argmin(f). This convergence rate can be refined under various additional geometrical properties on the objective f such as error bounds (and the closely related Kurdyka-Łojasiewicz property in the convex case; Bolte et al. 2016).

1.1.2. Second-Order In-Time Systems: Key Role of Inertia.

Second-order in-time inertial dynamical systems have been introduced to provably accelerate the convergence behavior compared with (GF). An abundant literature has been devoted to the study of inertial dynamics:

x¨(t)+γ(t)x˙(t)+f(x(t))=0,t>t0.(IGSγ)

The importance of working with an asymptotically vanishing viscosity coefficient γ(t) to obtain acceleration was stressed by several authors (Cabot et al. 2009, Attouch and Cabot 2017). Most of the literature focuses on the case γ(t)=α/t, originating from the seminal work of Su et al. (2016) who showed the rate of convergence O(1/t2) of the values for α=3, thus making the link with the Nesterov accelerated gradient method (Nesterov 1983). Since then, an important body of literature has been devoted to this important case and the subtle tuning of parameter α. Taking α3 is mandatory for provable accelerated rate O(1/t2) of the values (Attouch et al. 2018b), and α>3 provides an even better rate o(1/t2) and weak convergence of the trajectory (Attouch and Peypouquet 2016, May 2017). On the other hand, α<3 necessarily leads to a slower rate O(1/t2α/3) (Apidopoulos et al. 2018, Attouch et al. 2019). Another remarkable instance of (IGSγ) corresponds to the well-known heavy ball with friction (HBF) method, where γ(t) is a constant, first introduced by Polyak (1964). When the objective is strongly convex, it was shown that the trajectory converges exponentially with an optimal convergence rate for a properly chosen constant γ (Attouch et al. 2011).

1.1.3. Geometric Hessian-Driven Damping.

Because of the inertial aspects, and the asymptotic vanishing viscous damping coefficient, (IGSγ) may exhibit many small oscillations that are not desirable from an optimization point of view. To remedy this, a powerful tool consists in introducing a geometric damping driven by the Hessian of f into the dynamic. This yields the inertial system with explicit Hessian-driven damping (Attouch et al. 2016, 2022b):

x¨(t)+γ(t)x˙(t)+β(t)2f(x(t))x˙(t)+f(x(t))=0,(ISEHD)
and the inertial system with implicit Hessian-driven damping (Alecsa et al. 2021, Muehlebach and Jordan 2021):
x¨(t)+γ(t)x˙(t)+f(x(t)+β(t)x˙(t))=0.(ISIHD)

The rationale behind the use of the term “implicit” in (ISIHD) comes from a Taylor expansion of the gradient term (as t+ we expect x˙(t)0). Following the physical interpretation of these Ordinary Differential Equations, we call the nonnegative parameters γ and β as the viscous and geometric damping parameters, respectively.

At first glance, the presence of the Hessian in (ISEHD) may seem to entail numerical difficulties. However, this is not the case because the term 2f(x(t))x˙(t) is nothing but the time derivative of tf(x(t)). This explains why the time discretization of this dynamic provides efficient first-order algorithms (Attouch et al. 2022b). On the other hand, (ISEHD) can be argued to be truly of second-order nature, that is, close to Newton’s and Levenberg-Marquardt’s dynamics (Castera et al. 2024). This understanding suggests that (ISIHD) may reflect the nature of first-order algorithms more faithfully than (ISEHD). Moreover, when it will come to our stochastic setting, which is the focus of this paper, the approach we propose will only make sense for the implicit form of the Hessian-driven damping. Indeed, in our stochastic setting, we do not have direct access to the evaluation of the gradient of f. Instead, we model the associated errors with a continuous Itô martingale (denoted as M(t)). But for the explicit form of the Hessian-driven damping, this would entail a term involving the time derivative of f(X(t))+M(t). This is meaningless because (nonconstant) martingales are not differentiable almost sure (a.s.) This is why from now on, we will solely consider (ISIHD).

1.2. Motivations

In the following, H,K are real separable Hilbert spaces. In many practical situations, the (sub)gradient evaluation is subject to stochastic errors. This is, for example, the case if the cost per iteration is very high, and thus cheap and random approximations of the (sub)gradient are necessary. These errors can also be due to some other exogenous factor. The continuous-time approach through stochastic differential equations (SDEs) is a powerful way to model these errors in a unified way, and stochastic algorithms can then be viewed as time discretizations. In fact, several recent works have used the SDE perspective to model Stochastic Gradient Descent (SGD)-type algorithms motivated by various reasons; (Li et al. 2017, 2021; Mertikopoulos and Staudigl 2018; Soatto and Chaudhari 2018; Hu et al. 2019b; Orvieto and Lucchi 2019; Shi et al. 2023; Dambrine et al. 2024; Maulen-Soto et al. 2024, 2025). The continuous-time perspective offers a deep insight and unveils the key properties of the dynamic without being tied to a specific discretization.

In this context, the first SDE that comes to mind is

{dX(t)=f(X(t))+σ(t,X(t))dW(t),t>t0;X(t0)=X0,(SGF)
defined over a complete filtered probability space (Ω,F,(Ft)tt0,P), where the diffusion (volatility) term σ:R+×HL2(K;H) is a measurable function, W is a Ft-adapted K-valued cylindrical Brownian motion, and the initial data X0 is an Ft0-measurable H-valued random variable. All these notations and concepts are introduced in Section 2. (SGF) is a stochastic counterpart of (GF) where the error is modeled as a stochastic integral with respect to the measure defined by a continuous Itô martingale.

1.2.1. SDE Modeling of SGD.

To simplify the discussion, let us focus in this section on the finite-dimensional case (H=Rd, K=Rm). In various areas of science and engineering, in particular, in machine learning, the SGD is a powerful alternative to gradient descent and consists in replacing the full gradient computation by a cheap random version, serving as an unbiased estimator. The SGD updates the iterates according to

xk+1=xkh(f(xk)+ek),(SGD)
where hR+ is the stepsize and ek is the random noise term on the gradient at the kth iteration. As such, (SGD) can be viewed as instance of the Robbins-Monro stochastic approximation algorithm (Robins and Monro 1951). When the objective takes the form f(x)=E[f^(x,ξ)], where the expectation is with respect to the random variable ξ, the single-batch version of SGD reads
xk+1=xkhf^(xk,ξk),(SGDSB)
where (ξk)kN are independent and identically distributed random variables with the same distribution as ξ. Of course, (SGDSB) is an instance of (SGD) with ek=f^(xk,ξk)f(xk).

The SDE continuous-time approach is motivated by its close relation to (SGD) or (SGDSB). We first note that when the noise ek in (SGD) is N(0,σkId), (SGF) is a better continuous-time model for (SGD) than (GF), as has been shown recently in Dambrine et al. (2024, proposition 2.1). There, the sequence (xk)kN provided by (SGD), with ekN(0,σkId), was proved to be accurately approximated by (SGF) with σ(t,X(t))=hσ(t) and σ(kh)=σkId.

For the standard single-batch SGD (SGDSB), the argument is more involved. Actually, many recent works (Mandt et al. 2016; Li et al. 2017, 2021, 2024; Soatto and Chaudhari 2018; Hu et al. 2019b; Orvieto and Lucchi 2019; Latz 2021; Xie et al. 2021; Shi et al. 2023) have linked algorithm (SGDSB) with continuous-time first-order stochastic diffusion dynamics such as (SGF). These works show either empirically or theoretically under which conditions (appropriate drift and diffusion terms, regularity of f, etc.) (SGF) can be seen as a good approximation model of (SGDSB) for fixed stepsize. By a good model, we mean that (SGF) is a continuum limit of (SGDSB) as the stepsize h goes to zero, or equivalently that the approximation of (SGDSB) via the diffusion process (SGF) is precise in some weak sense (Li et al. 2017, 2021; Hu et al. 2019b).

As a consequence, using (SGF) as a proxy of (SGD) or (SGDSB) allows to capitalize on the wealth of results in the field of SDEs, Itô calculus, and measure theory, and this in turn opens the door to new insights in the behavior of (SGD) or (SGDSB) and to transfer all the convergence results that one can prove for (SGF) to (SGD). Actually, this is one of the main messages we want to convey in this work. Our motivation and results are also complementary to those in the literature. Indeed, most, if not all, of works cited in the previous paragraph are primarily motivated by the fact that continuous-time SDE approximation of (SGD) is a crucial tool to study its escape behavior of bad saddle points (a.k.a. traps) in the nonconvex smooth case. Our standpoint, which is line with Maulen-Soto et al. (2024), Mertikopoulos and Staudigl (2018), Dambrine et al. (2024), and Maulen-Soto et al. (2025), is complementary, and we argue that the continuous-time perspective offers a deep insight and unveils the key properties of the dynamic, without being tied to a specific discretization. This enlightens the behavior of the sequence generated by some specific algorithm. In turn, studying the continuous-time SDE will allow to predict the convergence behavior of stochastic algorithms seen as a discretization of the corresponding continuous-time dynamics.

1.2.2. Second-Order SDE Modeling of Inertial SGD.

Using a lifting argument to get an equivalent first-order reformulation, a natural generalization of (ISIHD) to the nonsmooth case yields the differential inclusion

{x˙(t)=v(t),t>t0;v˙(t)[γ(t)v(t)+F(x(t)+β(t)v(t))],t>t0;x(t0)=x0,x˙(t0)=v0,(ISIHDNS)
where F is the convex subdifferential of F. In this setting, keeping in mind that we want to give a rigorous meaning to (ISIHDNS), we can model the associated errors using a stochastic integral with respect to the measure defined by a continuous Itô martingale. This entails the following stochastic differential inclusion (SDI), which is the stochastic counterpart of (ISIHDNS):
{dX(t)=V(t)dt,dV(t)γ(t)V(t)dtF(X(t)+β(t)V(t))dt+σ(t,X(t)+β(t)V(t))dW(t),X(t0)=X0,V(t0)=V0.(S-ISIHDNS)

This SDI is defined on a filtered probability space (Ω,F,{Ft}t0,P), where σ:[t0,+[×HL2(K;H) is a measurable function; and W is a K-valued cylindrical Brownian motion. When g0, this reduces to the stochastic counterpart of (ISIHD), given by the following SDE:

{dX(t)=V(t)dt,dV(t)=γ(t)V(t)dtf(X(t)+β(t)V(t))dt+σ(t,X(t)+β(t)V(t))dW(t),X(t0)=X0,V(t0)=V0.(S-ISIHD)

In the smooth but nonconvex case, and motivated again by strict saddle points avoidance, Hu et al. (2019a, b) study the convergence behavior of a stochastic discrete heavy ball method from its approximating SDE. The latter is a randomly perturbed nonlinear oscillator in Hu et al. (2019c) and a coupled system of nonlinear oscillators in Hu et al. (2019a). These SDEs are very different from the ones considered here. By contrast, other works do not employ SDE techniques and instead analyze the stochastic iteration directly; see, for instance, Barakat et al. (2021), Gadat et al. (2018), and Le (2024), with the last reference also addressing the nonsmooth case. There are several advantages of adopting the SDE perspective in our setting, among which are a more accurate approximation of the discrete stochastic dynamics than the ODE method and the ability to quantify stochastic fluctuations and describe the long-run distribution of the iterates; the approximation aspect is detailed in Appendix A.

Extending what we have discussed above for (SGF) as a good model of (SGD), we will show in Proposition A.1 (see Appendix A for details) that (S-ISIHD) is a good model of the natural stochastic inertial algorithm (A.1) obtained by simple Euler forward (a.k.a. Euler-Maruyama) discretization of (S-ISIHD). The corresponding convergence rate as a function of the time stepsize h is O(h) and shows that this is much better that the approximation rate of (ISIHD), which is only O(h). As a consequence, this justifies and motivates the continuous-time dynamics (S-ISIHD) (and (S-ISIHDNS)) as a good proxy of stochastic inertial algorithms and opens the door to new insights in the behavior of such algorithms, and that their convergence properties can be easily derived from those of (S-ISIHD) with minimal effort. For instance, when f is smooth with Lipschitz-continuous gradient, it is easy to see from the descent lemma that

E[f(Xk)min f]=E[f(X(kh))min f]+O(h),
where Xk are the iterates of (A.1) and X(t) the solution to (S-ISIHD). This means that any rate proved on E[f(X(t))min f] can be directly transferred to E[f(Xk)min f].

1.3. Objectives and Contributions

In this work, our goal is to provide a general mathematical framework for analyzing the convergence properties of (S-ISIHD) and (S-ISIHDNS). In this context, considering inertial dynamics with a time-dependent vanishing viscosity coefficient γ is a key ingredient to obtain fast convergent methods. We will develop a systematic and unified way that transfers the properties of stochastic first-order dynamics recently studied by Maulen-Soto et al. (2024, 2025) to second-order ones. Our program will then rely on two pillars: time scaling and averaging, following the methodology recently developed in Attouch et al. (2024) for the deterministic case.

More precisely, we study the stochastic dynamics (S-ISIHDNS) and its long-time behavior in order to solve (P). We conduct a new analysis using specific and careful arguments that are much more involved than in the deterministic case. To get some intuition, keeping the discussion informal at this stage, let us first identify the assumptions needed to expect that the position state of (S-ISIHD) “approaches” argmin(f) in the long run. In the case where H=K, γ(·)γ>0,β0, and σ=σ˜IH, where σ˜ is a positive real constant; under mild assumptions one can show that (S-ISIHD) has a unique invariant distribution πσ˜ in (x,v) with density proportional to

exp2γσ˜2f(x)+v22
(Pavliotis 2014, proposition 6.1). Clearly, as σ˜0+, πσ˜ gets concentrated around argmin(f)×{0H}, with limσ˜0+πσ˜(argmin(f)×{0H})=1; see also Section 1.4 for further discussion. Motivated by these observations and the fact that we aim to exactly solve (P), our paper will then mainly focus on the case where σ(·,x) vanishes fast enough as t+ uniformly in x.

Our main contributions are summarized as follows:

  • We show almost sure weak convergence of the trajectory (see Theorem 5) and convergence rates (see Theorem 6) in expectation in the case of time-dependent coefficients γ(t) and a proper choice of β(t) (depending on γ). For this analysis, we transfer the results from the Lyapunov analysis of the first-order in-time stochastic (sub)gradient system studied in Maulen-Soto et al. (2024, 2025) from which our inertial system is built through time scaling and averaging.

  • We obtain almost sure and ergodic convergence results which correspond precisely to the best-known results in the deterministic case. In particular, if we let α>3, γ(t)=α/t, β(t)=t/(α1), then under appropriate assumptions on the diffusion (volatility) term σ, we obtain the rate of convergence o(1/t2) of the values as well as fast convergence of the gradient in almost sure sense (see Corollary 1). This corresponds to the best known results of second-order in-time Hessian-driven damping dynamics in the deterministic case.

  • As far as the interplay between viscous damping, geometric damping, and noise level, our results reveal that viscous damping, which allows for acceleration, enters in the control of the noise and may impose a more stringent summability condition on the diffusion coefficient (see, e.g., Theorem 5, Theorem 6 and Corollary 1). The geometric damping, which is designed to reduce oscillations, does not enter directly in this control and can be chosen in a more flexible way.

  • We then turn to providing a local analysis with a local linear convergence rate under the Polyak-Łojasiewicz inequality (see Theorem 8). This is much more challenging in the stochastic case, and even more for second-order systems, as localizing the process in this case is very delicate. Leveraging time scaling and averaging offers an elegant framework to achieve such a local convergence analysis while it is barely possible otherwise. To the best of our knowledge, this is the first result of this kind for these systems in the literature.

  • We also show almost sure strong convergence of the trajectory to the minimal norm solution when adding a Tikhonov regularization to our systems (see Theorem 9). Moreover, we show convergence rates in expectation for the objective and the trajectory for a particular Tikhonov regularizer (see Theorem 11).

It is worth observing that, because our approach is based on an averaging technique, it will involve Jensen’s inequality at some point to get fast convergence rates. In this respect, the convexity assumption on the objective function appears unavoidable, at least in this proof strategy. It is also worth stressing the fact that the approach only makes sense for the implicit form of the Hessian-driven damping. Indeed, as explained above, the explicit form of the Hessian-driven damping has a term involving the time derivative of the (sub)gradient at the trajectory. As the noise, modeled here as an Itô martingale, in practice stems from the (sub)gradient evaluation, this time derivative is meaningless with explicit Hessian-driven damping, as (nonconstant) martingales are a.s. nondifferentiable.

1.4. Relation to Prior Work

1.4.1. Kinetic Diffusion Dynamics for Sampling.

Let us consider (S-ISIHD) in the case where H=K=Rn, γ(t)=γ>0,β0, and σ=2γI. Then one recovers the kinetic Langevin diffusion (or second-order Langevin process). In this case, the continuous-time Markov process (X(t),V(t)) is positive recurrent and has a unique invariant distribution that has the density exp(f(x)v2/2) with respect to the Lebesgue measure on R2n. Time-discretized versions of this Langevin diffusion process have been studied in the literature to (approximately) sample from exp(f(x)) with asymptotic and nonasymptotic convergence guarantees in various topologies and under various conditions; see Cheng et al. (2018), Ma et al. (2021), and Dalalyan et al. (2019) and references therein. By rescaling the problem, relation between sampling and optimization with quantitative estimates has been investigated in, for example, Dalalyan and Karagulyan (2019) for the strongly convex case.

1.4.2. First-Order Stochastic (Sub)Gradient Systems.

In Maulen-Soto et al. (2024) (respectively, Maulen-Soto et al. (2025)), the authors studied (SGF) (respectively, its nonsmooth version as an SDI) as a proxy for (SGD). One of their main results is the almost sure weak convergence of the trajectory to the set of minimizers under integrability conditions on σ, as well as convergence rates in expectation and in almost sure sense of the dynamic under different geometries of f. Our goal here is to take these results to second-order inertial dynamics featuring both viscous and geometric dampings. This turns out to be a challenging task. We will show that the convergence rate on the objective can be achieved provided that the noise vanishes sufficiently fast.

1.4.3. Inexact Inertial Gradient Systems.

There is an abundant literature regarding the dynamics of (ISIHD) and (ISEHD), either in the exact case or with errors but only deterministic ones (Schmidt et al. 2011; Haraux and Jendoubi 2012; Villa et al. 2013; Dossal and Aujol 2015; Attouch et al. 2018a, b, 2022a, b, 2023a, b; Alecsa et al. 2021; Castera et al. 2021; Shi et al. 2022). Only a few papers have been devoted to studying stochastic versions of (IGSγ), either with vanishing damping γ(t)=α/t or constant damping γ(t) (stochastic HBF) (Gadat and Panloup 2014, Gadat et al. 2018, Orvieto et al. 2020, Dambrine et al. 2024). One of the advantages of considering the stochastic version of (ISIHD) is the possible reduction of oscillations thanks to the introduction of the geometric damping. We show that this effect could be preserved in the stochastic setting, hence obtaining more stable trajectory solutions than other stochastic second-order dynamics. Additionally, having the flexibility to choose the viscous damping would eventually allow us to achieve faster convergence results. For a stochastic version of (IGSγ), Dambrine et al. (2024) provide asymptotic O(1/t2) convergence rate on the objective values in expectation under integrability conditions on the diffusion term, as well as other rates under additional geometrical properties of the objective. These geometrical assumptions come in the form of global growth and flatness of the objective that is very restrictive. Rather, here, our geometrical assumptions on f will be only local. The corresponding stochastic algorithms for these two choices of γ, whose mathematical formulation and analysis are simpler, have been the subject of active research work (Frostig et al. 2015, Allen-Zhu 2017, Jain et al. 2017, Lin et al. 2017, Gadat et al. 2018, Yan 2018, Assran and Rabbat 2020, Laborde and Oberman 2020, Lan 2020, Loizou and Richtárik 2020, Defazio and Jelassi 2022, Driggs et al. 2022, Attouch et al. 2024, Hamadouche et al. 2024).

1.4.4. Time Scaling and Averaging.

Attouch et al. (2024) proposed time scaling and averaging to link (GF) and (ISIHD) with a general viscous damping function γ and a properly adjusted geometric damping function β (related to γ). Our aim is to extend the results of Attouch et al. (2024) to the stochastic case. Leveraging these techniques with a general function γ and an appropriate β, we will be able to transfer all the results we obtained in Maulen-Soto et al. (2025) for a first-order SDI to the second-order one (S-ISIHDNS). This avoids in particular to go through an intricate and a dedicated Lyapunov analysis for (S-ISIHDNS). A local convergence analysis becomes also easily accessible through this lens, whereas it is barely possible otherwise. We also specialize our results to the standard case where γ(t)=α/t and β(t)=t/(α1).

The idea of passing from a first-order system to a second-order one via time scaling is not new. In the smooth case (g0), Cabot (2009) proposes time scaling and a tricky change of variables to show that (IGSγ) is equivalent to an averaged gradient system, that is, the steepest gradient system (GF) where the instantaneous value of f(x(t)) is replaced by some average of the gradients f(x(s)) over all past positions st. See also Goudou and Munier (2005) for more general gradient systems with memory terms involving kernels. This gives rise to an integro-differential equation whose asymptotic behavior and the equivalent second-order dynamic have been investigated in Cabot (2009). A stochastic version of this integro-differential equation has been studied in Gadat and Panloup (2014), where the long time behavior of the resulting process, in particular its invariant distribution and occupation measure, was investigated under ellipticity assumptions on f and σ and proper behavior of the averaging gradient function. Clearly, the motivation of that work is not on the minimizing properties of the process, whereas it is our focus here. We remark that after simple integration on (S-ISIHD), we can get that

{dX(t)=V(t)dt,V(t)=V0p(t)1p(t)t0tp(s)f(X(s)+β(s)V(s))ds+1p(t)t0tp(s)σ(s,X(s)+β(s)V(s))dW(s),
where p(t)=exp(t0tγ(s)ds). This representation highlights the link with integro-differential equations.

1.5. Organization of the Paper

Section 2 introduces notations, definitions, and preliminaries that are essential to our exposition. Section 3 is the main part of our study. We develop the passage from the first-order system to the second-order inertial system by using the time scaling and averaging in a stochastic framework. Almost sure and ergodic convergence rates are provided under different geometric properties of the objective function, such as convexity and Polyak-Łojasiewicz geometry. Finally, we show a strong convergence result when adding a Tikhonov regularization. Additional technical results that are needed throughout the paper are gathered in Appendix B.

2. Notation and Preliminaries

2.1. Notation

We will use the following shorthand notations: Given nN, [n]=def{1,,n}. Consider H,K real separable Hilbert spaces endowed with the inner product ·,·H and ·,·K, respectively, and norm ·H=·,·H and ·K=·,·K, respectively (we will omit the subscripts H and K whenever it is clear from the context); IH is the identity operator from H to H; L(K;H) is the space of bounded linear operators from K to H; L1(K) is the space of trace-class operators; and L2(K;H) is the space of bounded linear Hilbert-Schmidt operators from K to H. For ML1(K), the trace is defined by

tr(M)=defiIMei,ei<+,
where IN and (ei)iI is an orthonormal basis of K. Besides, for ML(K;H), ML(H;K) is the adjoint operator of M, and for ML2(K;H),
MHS=deftr(MM)<+
is its Hilbert-Schmidt norm (in the finite-dimensional case is equivalent to the Frobenius norm). We denote by w-lim (respectively, s-lim) the limit for the weak (respectively, strong) topology of H. The notation A:HH means that A is a set-valued operator from H to H. For f:HR, the sublevel of f at height rR is denoted [fr]=def{xH:f(x)r}. For 1p+, Lp([a,b]) is the space of measurable functions g:RR such that ab|g(t)|pdt<+, with the usual adaptation when p=+. On the probability space (Ω,F,P), Lp(Ω;H) denotes the (Bochner) space of H-valued random variables whose pth moment (with respect to the measure P) is finite. Other notations will be explained when they first appear.

Let us recall some important definitions and results from convex analysis; for a comprehensive coverage, we refer the reader to Rockafellar (1997).

We denote by Γ0(H) the class of proper lsc and convex functions on H taking values in R{+}. For μ>0, Γμ(H)Γ0(H) is the class of μ-strongly convex functions, that is, functions f such that fμ·2/2 is convex. We denote by Cs(H) the class of s-times continuously differentiable functions on H. For L0, CL1,1(H)C1(H) is the set of functions on H whose gradient is L-Lipschitz continuous, and CL2(H) is the subset of CL1,1(H) whose functions are twice differentiable.

The subdifferential of a function fΓ0(H) is the set-valued operator f:HH such that, for every x in H,

f(x)={uH:f(y)f(x)+u,yxyH},
which is nonempty for every point in the relative interior of the domain of f. When f is finite-valued, then f is continuous, and f(x) is a nonempty convex and compact set for every xH. If f is differentiable, then f(x)={f(x)}. For every xH such that f(x), the minimum norm selection of f(x) is the unique element {0f(x)}=defargminuf(x)u. The projection of a point xH onto a nonempty closed convex set CH is denoted by PC(x).

2.2. Assumptions on Volatility and Damping Parameters

Recall that our focus in this paper is on an optimization perspective, and as we argued in the Introduction, we will study the long time behavior of our SDEs and SDIs (in particular (S-ISIHD) and (S-ISIHDNS)) as the diffusion term vanishes when t+. Therefore, throughout the paper, we assume that the diffusion (volatility) term σ satisfies

{suptt0,xHσ(t,x)HS<+,σ(t,x)σ(t,x)HSl0xx,(Hσ)
for some l0>0 and for all tt0,x,xH. The Lipschitz continuity assumption is mild and classical and will be required to ensure the well posedness of (S-ISIHD) and (S-ISIHDNS). Let us also define σ:[t0,+[R+ as
σ(t)=defsupxHσ(t,x)HS.

Remark 1.

(Hσ) implies the existence of σ*>0 such that

σ(t,x)HS2=tr[Σ(t,x)]σ*2,
for all tt0,xH, where Σ=defσσ.

For t0>0, let γ:[t0,+[R+ be a viscous damping and define

p(t)=defexp(t0tγ(s)ds),Γ(t)=defp(t)t+dsp(s),I[h](t)=defexp(t0tduΓ(u))t0th(u)exp(t0udsΓ(s))Γ(u)du.

We assume that

{γ is upper bounded by a nonincreasing function for every tt0;t0+dsp(s)<+.(Hγ)

Remark 2.

Let us notice that Γ satisfies the relation Γ=γΓ1.

2.3. Reminder of Main Previous Results

Before we delve into our core contributions, it is important to note that we will require some specific results gleaned from Maulen-Soto et al. (2024, 2025). These are the subject of the following paragraphs.

2.3.1. Results on (SGF).

Because we are going to show results in the smooth case, we rewrite (H0) when g0:

{f:HR is continuously differentiable and convex with LLipschitzcontinuous gradient;S=defargmin(f).(H0)
Theorem 1

(Maulen-Soto et al. 2024, Theorem 3.1). Consider f and σ that satisfy Assumptions (H0) and (Hσ). Let ν2 and consider the SDE

{dX(t)=f(X(t))dt+σ(t,X(t))dW(t),X(t0)=X0,(1)

where X0Lν(Ω;H). Then, there exists a unique solution XSHν[t0] (see Section 7.2 for the notation) of (1). Additionally, if σL2([t0,+[), then

  1. supt0E[X(t)2]<+.

  2. xS, limt+X(t)x exists a.s. and supt0X(t)<+ a.s.

  3. limtf(X(t))=0 a.s. As a result, limt+f(X(t))=min f a.s.

  4. There exists an S-valued random variable X such that wlimt+X(t)=X a.s.

Theorem 2

(Maulen-Soto et al. 2024, Theorem 3.4). Let ν2 and consider the SDE (1) with initial data X0Lν(Ω;H), where f and σ satisfy Assumptions (H0) and (Hσ). Moreover, we assume that σ satisfies ttσ2(t)L1([t0,+[) and that either H is finite-dimensional or fC2(H). Then, the solution trajectory XSHν[t0] is unique and we have that

  1. E[f(X(t))min f]=O(t1).

    Moreover, if fC2(H), then the following hold:

  2. ttf(X(t))2L1([t0,+[) a.s.

  3. f(X(t))min f=o(t1) a.s.

2.3.2. Results on (SGI).

The far more intricate nonsmooth version of (SGF) has been recently studied in Maulen-Soto et al. (2025). Let F,σ satisfy (H0) and (Hσ). We consider the stochastic differential inclusion

{dX(t)F(X(t))dt+σ(t,X(t))dW(t),t>t0,X(t0)=X0.(SGI)

The following definition makes precise the notion of solution that we are interested in.

Definition 1.

A solution of (SGI) is a couple (X,η) of Ft-adapted processes such that almost surely

  1. X is continuous with sample paths in the domain of g.

  2. η:[t0,+[H is absolutely continuous, such that η(t0)=0, and T>t0, ηL2([t0,T];H), η(t)g(X(t)) for almost all tt0;

  3. For t>t0,

    {X(t)=X0t0tf(X(s))dsη(t)+t0tσ(s,X(s))dW(s),X(t0)=X0.(2)

For brevity, we sometimes omit the process η and say that X is a solution of (SGI), meaning that, there exists a process η such that (X,η) satisfies the previous definition. The definition of uniqueness for the process X is given in Section 7.2.

In order to show the main results for (SGI), we consider the sequence of solutions (Xλ)λ>0 of the SDEs

{dXλ(t)=(f+gλ)(Xλ(t))dt+σ(t,Xλ(t))dW(t),t>t0,Xλ(t0)=X0,(SDEλ)
where gλ is the Moreau envelope of g with parameter λ>0. Observe that system (SDEλ) was also directly studied in Maulen-Soto et al. (2024) to solve (P), where a complete discussion is provided. It is worth emphasizing that the Moreau envelope of g, and the corresponding system (SDEλ) is only needed as a means to establish existence and uniqueness of solution of (SGI). This follows the same reasoning as in the deterministic case where the Moreau-Yosida regularization and nonlinear semigroup theory have proven very useful to show existence and uniqueness for differential inclusions Brézis (1973). However, in the convergence analysis, we never replace g by its Moreau envelope.

We define the integrability condition that for every T>t0,

limsupλ0t0TE(gλ(Xλ(t))2)dt<+,(Hλ)

Remark 3.

Some conditions on g for (Hλ) to be satisfied are discussed in Pettersson (1995). Of particular interest, which covers a broad class of functions, is when g has full domain and there exists C0>0 such that

0g(x)C0(1+x),xH.

This is, for instance, the case when g is Lipschitz continuous.

The following results on (SGI) were proved in Maulen-Soto et al. (2025).

Theorem 3

(Maulen-Soto et al. 2025). Consider F=f+g and σ satisfying (H0) and (Hσ). Suppose further that g verifies (Hλ). Let ν2, t00, and consider the dynamic (SGI) with initial data X0Lν(Ω;H). Then, (SGI) has a unique solution in the sense of Definition 1 (X,η)SHν[t0]×C1([t0,+[;H).

Moreover, if σL2([t0,+[), then the following holds:

  1. E[suptt0X(t)ν]<+.

  2. xSF, limt+X(t)x exists a.s. and suptt0X(t)<+ a.s.

  3. If g is continuous, then f is constant on SF, there exists xSF such that s-limt+f(X(t))=f(x) a.s., and

    t0+(F(X(t))minF)dt<+a.s.

  4. There exists an SF-valued random variable X such that w-limt+X(t)=X.

2.3.3. Tikhonov Regularization.

Let us now turn to a Tikhonov regularization of (SGI), that is,

{dX(t)F(X(t))ε(t)X(t)+σ(t,X(t))dW(t),tt0,X(t0)=X0.(SGI-TA)

Solution existence and uniqueness for (SGI-TA) are established in Maulen-Soto et al. (2025, theorem 3.3). We also have the following.

Theorem 4

(Maulen-Soto et al. 2025, Theorem 4.1). Let ν2 and consider the dynamic (SGI-TA) with initial data X0Lν(Ω;H), where F=f+g and σ satisfy Assumptions (H0) and (Hσ). Furthermore, assume that g satisfies (Hλ). Then, there exists a unique solution XSHν[t0] of (SGI-TA). Let x=PSF(0) be the minimum norm solution, and for ε>0 let xε be the unique minimizer of Fε(x)=defF(x)+εx2/2. Suppose that σL2([t0,+[), and that ε:[t0,+[R+ satisfies the conditions:

(T1) ε(t)0 as t+;

(T2) t0+ε(t)dt=+;

(T3) t0+ε(t)(x2xε(t)2)dt<+.

Then, we have

  1. suptt0X(t)<+ a.s., and

  2. s-limt+X(t)=x a.s.

This means that we can obtain almost sure strong convergence of the trajectory to a particular (nonrandom) solution: the one of minimal norm.

3. From First-Order to Second-Order Systems

3.1. Time Scaling and Averaging

We apply a time scaling and then an averaging technique to the system (SGI) to derive an insightful reparametrization of a particular case of our second-order system (S-ISIHDNS), specifically, the case when βΓ. The main advantage of this method is that the results of (SGI) directly carry over to obtain results on the convergence behavior of (S-ISIHDNS) without passing through a dedicated Lyapunov analysis. However, as discussed in the introduction, the averaging technique is restricted to convex objectives, as it heavily relies on Jensen’s inequality.

Let ν2, s0>0. We consider the potential F=f+g where g satisfies (Hλ). Let σ1 be a diffusion term in the time parametrization by s. We will study the dynamic (SGI) in s, starting at s0, with diffusion term σ1 under Hypotheses (H0) and (Hσ). Let σ1*>0 be such that

σ1(s,x)HSσ1*2,ss0,xH,
and σ1(s)=defsupxHσ1(s,x)HS. We rewrite (SGI) in a format adapted to our case,
{dZ(s)F(Z(s))ds+σ1(s,Z(s))dW(s),s>s0,Z(s0)=Z0,(3)
where Z0Lν([s0,+[;H).

Let us make the change of time s=τ(t) in the dynamic (3), where τ is an increasing function from [t0,+[ to [s0,+[, which is twice differentiable and which satisfies limt+τ(t)=+. Denote Y(t)=defZ(s) and t0 be such that s0=τ(t0). By the chain rule and Öksendal 2003 (theorem 8.5.7), we have

{dY(t)τ(t)F(Y(t))dt+τ(t)σ1(τ(t),Y(t))dW(t),t>t0,Y(t0)=Z0.(4)

Consider the smooth case, that is, when g0 and the hypotheses of Theorem 2 (fCL2(H) and σ1L2([s0,+[)), then we can conclude that the convergence rate of (4) (when g0) is the following:

f(Y(t))min f=o(1τ(t)) a.s.(5)

By introducing a function τ that grows faster than the identity (τ(t)t), we have accelerated the dynamic, passing from the asymptotic convergence rate 1/s for (3) to 1/τ(t) for (4). The price to pay is that the drift term in (4) is nonautonomous; furthermore, when the coefficient in front of the gradient tends to infinity as t+, it will preclude the use of an explicit discretization in time. To overcome this, we adapt from Attouch et al. (2024) the following approach, which is called averaging.

Consider (4) and define the two stochastic processes X,V:Ω×[t0,+[H as

{dX(t)=V(t)dt,t>t0,Y(t)  =X(t)+τ(t)V(t),t>t0,X(t0)=X0,V(t0)=V0,(6)
where Y(t) is the process in (4), and X0,V0Lν(Ω;H) are initial data. This leads us to set Z0=defX0+τ(t0)V0 in order for the equations to fit. According to the averaging, the differential form of Y(t) is
dY(t)=dX(t)+τ(t)V(t)dt+τ(t)dV(t).

Combining the previous equation with (4), we have that

τ(t)F(Y(t))dt+τ(t)σ1(τ(t),Y(t))dW(t)dX(t)+τ(t)V(t)dt+τ(t)dV(t).

Using that dX(t)=V(t)dt and dividing by τ, we then have

F(X(t)+τ(t)V(t))dt+1τ(t)σ1(τ(t),X(t)+τ(t)V(t))dW(t)1+τ(t)τ(t)V(t)dt+dV(t).

Therefore, after the time scaling and averaging, we obtain the following dynamic:

{dX(t)=V(t)dt,t>t0, dV(t)1+τ′′(t)τ(t)V(t)dtF(X(t)+τ(t)V(t))dt+1τ(t)σ1(τ(t),X(t)+τ(t)V(t))dW(t),t>t0,X(t0)=X0,V(t0)=V0.(ISIHD-S.1)

Let γ:[t0,+[R+ satisfy (Hγ). We are going to determine τ in order to obtain a viscous damping coefficient equal to γ, that is,

1+τ(t)τ(t)=γ(t).

Clearly, τ solves the following ODE in ζ:

ζ=γζ1.

As observed in Remark 2, the function Γ also satisfies the same ODE, and thus we can adjust the initial condition of τ to obtain

τ(t)=Γ(t)=p(t)t+dup(u)tt0.

We then integrate and take τ(t)=s0+t0tΓ(u)du to get τ(t0)=s0 as required. This is a valid selection of τ because ts0+t0tΓ(u)du is an increasing function from [t0,+[ to [s0,+[, twice differentiable and ΓL1([t0,+[) because Γ is lower bounded by a nondecreasing function because γ is upper bounded by a nonincreasing function (Attouch and Cabot 2017, proposition 2.2) by (Hγ). For this particular selection of τ, and defining σ˜1(t,·)=defσ1(τ(t),·)/Γ(t), we have that (ISIHD-S.1) is equivalent to

{dX(t)=V(t)dt,t>t0, dV(t)γ(t)V(t)dtF(X(t)+Γ(t)V(t))dt+σ˜1(t,X(t)+Γ(t)V(t))dW(t),t>t0,X(t0)=X0,V(t0)=V0.(ISIHD-S.2)

Clearly, (ISIHD-S.2) is nothing but (S-ISIHDNS) when βΓ and σσ˜1.

In order to be able to transfer the convergence results on Z in (3) (via (4)) to X in (ISIHD-S.2), it remains to express X in terms of Y only. For this, let

a(t)=def1τ(t),A(t)=deft0ta(u)du.

Recalling the averaging in (6), we need to integrate the following equation:

V(t)+a(t)X(t)=a(t)Y(t).(7)

Multiplying both sides by eA(t) and using (6), we get equivalently

d(eA(t)X(t))=a(t)eA(t)Y(t)dt.(8)

Integrating and again using (6), we obtain

X(t)=eA(t)X(t0)+eA(t)t0ta(u)eA(u)Y(u)du=eA(t)Y(t0)+eA(t)t0ta(u)eA(u)Y(u)dueA(t)τ(t0)V(t0).

Then we can write

X(t)=t0tY(u)dμt(u)+ξ(t),(9)
where μt is the probability measure on [t0,t] defined by
μt=defeA(t)δt0+a(u)eA(u)A(t)du,(10)
where δt0 is the Dirac measure at t0, a(u)eA(u)A(t)du is the measure with density a(·)eA(·)A(t) with respect to the Lebesgue measure on [t0,t], and ξ(t) is a random process since V0 is a random variable, that is,
ξ(t)=defξ(ω,t)=eA(t)τ(t0)V0(ω)ωΩ.(11)

3.2. Convergence of the Trajectory and Convergence Rates Under General γ, and βΓ

We state the main results of this section. We first show almost sure convergence of the trajectory of (S-ISIHDNS) to a random variable taking values in the set of minimizers of F. When g0, we also provide convergence rates.

The following result imposes an integrability condition on the diffusion term, which is essential for ensuring the almost sure weak convergence of the trajectory. More precisely, this integrability condition allows to show that the trajectory asymptotically converges almost surely, in the weak topology, to a random variable that takes values in the set of minimizers of F.

Theorem 5.

Let ν2 and consider the dynamic (S-ISIHDNS) with initial data X0,V0Lν(Ω;H), where γ:[t0,+[R+ satisfies (Hγ), and βΓ. Besides, F=f+g and σ satisfy Assumptions (H0) and (Hσ). Moreover, suppose that g satisfies (Hλ). Then, there exists a unique solution (X,V)SH×Hν[t0] of (S-ISIHDNS). Additionally, if ΓσL2([t0,+[), then there exists an SF-valued random variable X such that w-limt+X(t)=X a.s. and w-limt+Γ(t)V(t)=0. a.s.

Proof.

Let θ(t)=deft0tΓ(u)du, σ˜(s,·)=defσ(θ1(s),·)Γ(θ1(s)), and σ˜(s)=defsupxHσ˜(s,x)HS. Then ΓσL2([t0,+[) is equivalent to σ˜L2(R+). Consider the dynamic:

{dZ(s)F(Z(s))+σ˜(s,Z(s))dW(s),s>0,Z(0)=X0+Γ(t0)V0.(12)

By Theorem 3, we have that there exists a unique solution (Z,η)SHν×C1(R+;H) of (12) and an SF-valued random variable X such that w-lims+Z(s)=X a.s. Moreover, using the time scaling τθ and the averaging described in this section, we end up with the dynamic (S-ISIHDNS) in the case where βΓ.

It is direct to check that the time scaling and averaging preserves the uniqueness of a solution (X,V)SH×H0[t0]. Now let us validate (X,V)SH×Hν[t0]. Because

E(sups[0,T]Z(s)ν)<+,T>0,
we directly obtain
E(supt[t0,T]Y(t)ν)<+,T>t0.

Thanks to Relation (9), the following holds:

X(t)νν(X(t)t0tY(u)dμt(u)ν+t0tY(u)dμt(u)ν)ν(ξ(t)ν+(tt0)ν1t0tY(u)νdμt(u)).

Let T>t0 be arbitrary. Taking supremum over [t0,T] and then expectation at both sides, we obtain that

E(supt[t0,T]X(t)ν)ν(E(V0ν)Γ(t0)ν+(Tt0)ν1E(supt[t0,T]Y(t)ν))<+.

Because V(t)=Y(t)X(t)Γ(t), we have

V(t)ννΓν(t)(Y(t)ν+X(t)ν).

Similar to before, we let T>t0 be arbitrary, and take the supremum over [t0,T] and then expectation at both sides to obtain

E(supt[t0,T]V(t)ν)νsupt[t0,T]1Γν(t)(E(supt[t0,T](Y(t)ν+X(t)ν))).

Because Γ is a continuous positive function, by the extreme value theorem, we have that there exists tT[t0,T] such that supt[t0,T]1/Γν(t)=1/Γν(tT)<+, and we conclude that (X,V)SH×Hν[t0].

Now we prove that there exists an SF-valued random variable X such that w-limt+X(t)=X a.s. By virtue of Theorem 3, there exists an SF-valued random variable X such that w-lims+Z(s)=X a.s. We also notice that we have directly w-limt+Y(t)=X a.s. Let hH be arbitrary and use Relation (9) as follows:

|X(t)X,h||X(t)t0tY(u)dμt(u),h|+|t0tY(u)dμt(u)X,h|=|ξ(t),h|+|t0t(Y(u)X)dμt(u),h|=|ξ(t),h|+|t0tY(u)X,hdμt(u)|ξ(t)h+t0t|Y(u)X,h|dμt(u),
where the second equality comes from the dominated convergence theorem, because sups>t0Y(s)<+ a.s. (by (ii) of Theorem 3).

Now let a(t)=1/Γ(t) and A(t)=t0tdu/Γ(u). By Lemma 3 (defined in Section 7.1) and the fact that V0Lν(Ω;H), we have that limt+ξ(t)=0 a.s. On the other hand, it holds that

t0t|Y(u)X,h|dμt(u)eA(t)|Y(t0)X,h|+eA(t)t0ta(u)eA(u)|Y(u)X,h|du.

Now let b(u)=|Y(u)X,h|. Because we already proved that limu+b(u)=0 a.s., and we have that aL1([t0,+[) by Lemma 3, we utilize Lemma 2 (also defined in Section 7.1) with our respective a, b functions. This let us conclude that

limt+|X(t)X,h|=0a.s.

Thus, w-limt+X(t)=X a.s. Finally, because

Y(t)=X(t)+Γ(t)V(t),
and that X and Y have (a.s.) the same limit, we conclude that
w-limt+Γ(t)V(t)=0a.s.

In the smooth case, we also have convergence rates on the objective value and the gradient. In particular, the following two theorems will provide general abstract convergence rates under the same integrability condition on the diffusion term. These results will be specialized to specific choice of the parameters in Section 3.3.

Theorem 6.

Let ν2 and consider the dynamic (S-ISIHD) with initial data X0,V0Lν(Ω;H), such that f and σ satisfy (H0) and (Hγ), and in the case where γ satisfies (Hγ), βΓ. Moreover, suppose that either H is finite dimensional or fC2(H), and

tθ(t)Γ(t)σ(t)L2([t0,+[),
where θ(t)=deft0tΓ(u)du. Then the solution trajectory (X,V)SH×Hν[t0] is unique and satisfies
E[f(X(t))min f]=O(max{eA(t),I[1θ](t)}),t>t0,
where A(t)=deft0tduΓ(u) and we recall that I[1θ](t)=eA(t)t0t1θ(u)eA(u)Γ(u)du.

From Hypothesis (Hλ), we have that limt+eA(t)=0, and because ΓL1([t0,+[), we can use Lemma 2 to check that limt+I[1θ](t)=0.

Remark 4.

If H is finite-dimensional and g is a L0-Lipschitz function, we could obtain convergence rates for the nonsmooth setting (P) by considering (S-ISIHD) with potential Fρ=deff+gρ, where gρ is the Moreau envelope of g with parameter ρ>0. With the same hypotheses on the initial conditions, σ,γ,β as in Theorem 6, and proceeding as in Maulen-Soto et al. (2024, section 5), we could obtain

E[F(Xρ(t))minF]=O(max{eA(t),I[1θ](t)})+L022ρ,t>t0,
where (Xρ,Vρ)SH×Hν[t0] is the solution of (S-ISIHD) with potential Fρ.

Proof.

We will utilize the averaging technique used in Theorem 5 and Jensen’s inequality. First, we have

E(f(X(t))min f)=E(f(X(t))f(t0tY(u)dμt(u)))+E(f(t0tY(u)dμt(u))min f).

Let us recall that E(sups0Z(s))<+, which implies that E(suptt0X(t))<+. We bound the first term using the convexity of f and Cauchy-Schwarz inequality, that is, that for every x,yH,

f(x)f(y)f(x),xyf(x)yx,
we get that
f(X(t))f(t0tY(u)dμt(u))f(X(t))ξ(t)ξ(t)(LX(t)+f(0))ξ(t)(Lsuptt0X(t)+f(0)),
and we conclude that
E(f(X(t))f(t0tY(u)dμt(u)))=O(eA(t)).

For the second term, we use Jensen’s inequality to obtain

E(f(t0tY(u)dμt(u))min f)t0tE[f(Y(u))min f]dμt(u)eA(t)E[f(Y(t0))min f]+eA(t)t0teA(u)Γ(u)E(f(Y(u))min f)du.

Because θΓσL2([t0,+[) is equivalent to ssσ˜2(s)L1(R+), by Theorem 2, we have that there exists C>0 such that E(f(Z(s))min f)C/s. Then, we have E(f(Y(t))min f)C/θ(t). Hence, there exists C0>0 such that

E(f(X(t))min f)C0eA(t)+CI[1θ](t).

Theorem 7.

Let ν2 and consider the dynamic (S-ISIHD) with initial data X0,V0Lν(Ω;H), such that f and σ satisfy (H0) and (Hσ), and in the case where γ satisfies (Hγ), βΓ. Moreover, suppose that fC2(H) and

tθ(t)Γ(t)σ(t)L2([t0,+[),
where θ(t)=deft0tΓ(u)du. Then the solution trajectory (X,V)SH×Hν[t0] is unique and satisfies
t0+θ(u)Γ(u)f(X(u)+Γ(u)V(u))2du<+a.s.(13)

Proof.

Consider (12) and the technique used in Theorem 5. We have that tθ(t)Γ2(t)σ2(t)L1([t0,+[) is equivalent to ssσ˜2(s)L1(R+). Therefore, we can use Theorem 2 to state that

0+sf(Z(s))2ds<+a.s.

Using the time scaling τθ and making the change of variable θ(t)=s in the previous integral, we obtain

t0+θ(t)Γ(t)f(Y(t))2dt<+a.s.

Recalling that in the averaging, we impose that Y=X+ΓV, we conclude. □

3.3. Fast Convergence Under α>3, γ(t)=α/t and β(t)=t/(α1)

In the following, we show fast convergence results in expectation and in almost sure sense. This result imposes an integrability condition on the diffusion term to ensure a convergence rate of 1/t2 for the function values. This is highly desirable, as it represents the fastest convergence rate we can expect to achieve for gradient-based second-order dynamics featuring inertia when applied to a general convex function. Besides, these results match those in Attouch et al. (2024) when there is no noise.

Corollary 1

(Case α/t). Let ν2,α>3 and consider the dynamic (S-ISIHD) with initial data X0,V0Lν(Ω;H), in the case where γ(t)=α/t and β(t)=t/(α1). Besides, consider that f and σ satisfy (H0) and (Hσ). Moreover, let fC2(H) and tt2σ(t)L2([t0,+[). Then the solution trajectory (X,V)SH×Hν[t0] is unique and satisfies

  1. f(X(t))min f=o(t2) a.s.

  2. E[f(X(t))min f]=O(t2).

    t0+t3f(X(t)+tα1V(t))2dt<+a.s.

Proof.

Consider (12) with Γ(t)=t/(α1) and θ(t)=(t2t02)/(2(α1)). Let σ˜(s,·)=σ(θ1(s),·)Γ(θ1(s)). Notice that tt2σ(t)L2([t0,+[) is equivalent to ssσ˜2(s)L1(R+). We apply Theorem 2 to deduce that

f(Z(s))min f=o(s1) a.s.

Using the time scaling τθ and then the averaging technique as in the proof of Theorem 5, we have that

f(Y(t))min f=o(t2) a.s.

Moreover, it holds that

X(t)=t0tY(u)dμt(u)+ξ(t).
  1. Now we prove the first point in the following way:

    t2(f(X(t))min f)=t2(f(X(t))f(t0tY(u)dμt(u)))+t2(f(t0tY(u)dμt(u))min f).

    Let us bound the first term using the convexity of f:

    t2(f(X(t))f(t0tY(u)dμt(u)))t2f(X(t))ξ(t)t2ξ(t)(LX(t)+f(0))t2ξ(t)(Lsuptt0X(t)+f(0)).

    Let us recall that sups0Z(s)<+ a.s. Because of the time scaling and averaging, it is direct to check that suptt0X(t)<+ a.s. On the other hand, ξ(t)=O(t1α) a.s. Therefore, we have

    t2(f(X(t))f(t0tY(u)dμt(u)))=O(t3α)a.s.(14)

    Now let us bound the second term using Jensen’s inequality:

    t2(f(t0tY(u)dμt(u))min f)t2(t0t[f(Y(u))min f]dμt(u))=t0α1tα3[f(Y(t0))min f]+α1tα3t0tuα4(u2(f(Y(u))min f))du.

    In order to calculate the limit of this second term, let a(t)=(α1)/t, b(u)=u2(f(Y(u))min f); by Lemma 2, we have that

    limt+α1tα1t0tuα2b(u)du=0a.s.

    Because α>3, we also have that

    limt+α3tα3t0tuα4b(u)du=0a.s.(15)

    Therefore, we conclude that

    limt+t2(f(X(t))min f)=0a.s.

  2. By Theorem 6, in the case γ(t)=α/t, we have that eA(t)=t0α1t1α and θ(t)=(t2t02)/(2(α1)). On the other hand,

    I[1θ](t)=2(α1)2t1αt0tuα2u2t02=O(t1α+t2).

    Because α>3, we have that O(t1α) is also O(t2), and we conclude that

    E(f(X(t))min f)=O(t2).

  3. This point follows directly from Theorem 7 in the case γ(t)=αt. □

3.4. Convergence Rate Under Polyak-Łojasiewicz Inequality

In this section, we show a local convergence rate under Polyak-Łojasiewicz inequality. The Polyak-Łojasiewicz property is a special case of the Łojasiewicz property (Łojasiewicz 1963, 1965, 1984) and is commonly used to prove linear convergence of gradient descent algorithms.

Definition 2

(Polyak-Łojasiewicz Inequality). Let f:HR be a differentiable function with S. Then, f satisfies the Polyak-Łojasiewicz (PŁ) inequality on S, if there exists r>min f and μ>0 such that

2μ(f(x)min f)f(x)2,x[min f<f<r],(16)
and we will write fPŁμ(S).

Theorem 8.

Let ν2 and consider the dynamic (S-ISIHD) with initial data X0,V0Lν(Ω;H), where f satisfies (H0), and σ satisfies (Hσ). Besides, fPŁμ(S) and suppose that either H is finite dimensional or fC2(H). Let also, γ2μ, βΓ1/2μ, and such that σL2([t0,+[).

Then the solution trajectory (X,V)SH×Hν[t0] is unique. Moreover, letting δ>0, then there exists t^δ>t0,s^δ>0,Kμ,δ,Cl,Cf>0 such that

E(f(X(t))min f)Kμ,δeμ2(tt^δ)+1μlδ(t+3t^δ4t04μ)+Cfδ,t>t^δ,(17)
where
lδ(s)=L2σ2(s)+Clδσ2(s)2s^δsσ2(u)du.

Besides, if fPŁμ(S) holds on the entire space (i.e., r=+), then we have that there exists Kμ>0 such that

E(f(X(t))min f)Kμeμ2(tt0)+L2μσ2(tt04μ),t>t0.(18)

Remark 5.

If f is μ-strongly convex, then fPŁμ(S) holds on the entire space (i.e., r=+).

Remark 6.

For a proper discussion on the arbitrarily small (but nonzero) term Cfδ, we refer to (Maulen-Soto et al. 2024, section 4).

Proof.

Consider the dynamic (S-ISIHD) with γc, βΓ1/c, where c>0 is a constant that will be fixed later.

Let us also define θ(t)=deft0tΓ(u)du=(tt0)/c and σ˜(s,·)=defσ(θ1(s),·)Γ(θ1(s)). Then σL2([t0,+[) is equivalent to σ˜L2(R+). Now consider the dynamic

{dZ(s)=f(Z(s))+σ˜(s,Z(s))dW(s),s>0,Z(0)=X0+Γ(t0)V0.(19)

Let δ>0 and apply the result of Maulen-Soto et al. (2024, theorem 4.5(i-b)) (with coefficient 2μ); that is, there exists s^δ>0 such that for every λ]0,1[,

E(f(Z(s))min f)e2μ(ss^δ)E(f(Z(s^δ))min f)+e2μ(1λ)(ss^δ)(LC22+ClCδ)+lδ(s^δ+λ(ss^δ))2μ+Cfδ,s>s^δ,(20)
where C,Cl,Cf>0 and the establishment of lδ are detailed in Maulen-Soto et al. (2024, section 4.2), in particular C=t0+σ2(s)ds.

Considering the time scaling τθ, Y(t)=Z(θ(t)) and t^δ>t0 such that θ(t^δ)=s^δ (i.e., t^δ=cs^δ+t0), we have that

E(f(Y(t))min f)e2μ(θ(t)s^δ)E(f(Y(t^δ))min f)+e2μ(1λ)(θ(t)s^δ)(LC22+ClCδ)+lδ(s^δ+λ(θ(t)s^δ))2μ+Cfδ,t>t^δ.(21)

Let a(t)=c and A(t)=c(tt^δ). Now, we consider the averaging as in (8) but change the initial condition to t^δ. Thus, we have

X(t)=t^δtY(u)dμ˜t(u)+ξ˜(t),(22)
where μ˜t is the probability measure on [t^δ,t] defined by
μ˜t=ec(tt^δ)δt^δ+cec(ut)du,(23)
where δt^δ is the Dirac measure at t^δ and
ξ˜(t)=def1cec(tt^δ)V(t^δ).(24)

Then

E(f(X(t))min f)=E(f(X(t))f(t^δtY(u)dμt(u)))+E(f(t^δtY(u)dμt(u))min f).

We can bound the first term using convexity and Cauchy-Schwarz inequality in the following way:

E(f(X(t))f(t^δtY(u)dμ˜t(u)))E(f(X(t))2)E(ξ˜(t)2)E(V(t^δ)2)c2f(0)2+2L2E(suptt0X(t)2)ec(tt^δ),
where E(suptt0X(t)2)<+ as mentioned in Corollary 1.

On the other hand, we can bound the second term using Jensen’s inequality and then (21):

E(f(t^δtY(u)dμ˜t(u))min f)t^δtE(f(Y(u)min f))dμ˜t(u)t^δte2μ(θ(u)s^δ)E(f(Y(t^δ))min f)dμ˜t(u)+t^δte2μ(1λ)(θ(u)s^δ)(LC22+ClCδ)dμ˜t(u)+t^δtlδ(s^δ+λ(θ(u)s^δ))2μdμ˜t(u)+Cfδ=(E(f(Y(t^δ))min f)+(LC22+ClCδ)+lδ(s^δ)2μ)ec(tt^δ)+cE(f(Y(t^δ))min f)ectt^δte2μ(θ(u)s^δ)ecudu+c(LC22+ClCδ)ectt^δte2μ(1λ)(θ(u)s^δ)ecudu+c2μectt^δtlδ(s^δ+λ(θ(u)s^δ))ecudu+Cfδ,t>t^δ.

We bound the first integral as follows:

ectt^δte2μ(θ(u)s^δ)ecudue2μ(t0c+s^δ)e2μct.

The second integral is bounded in the same way:

ectt^δte2μ(1λ)(θ(u)s^δ)ecudue2μ(1λ)(t0c+s^δ)e2μ(1λ)ct.

To treat the third integral, we are going to split the integral in two in order to find a useful convergence rate. Let us recall that lδL1([s^δ,+[) and that lδ is decreasing. Let us define φλ,c,δ(t)=defs^δ+λ(t+t^δ2t02cs^δ), then

ectt^δtlδ(s^δ+λ(θ(u)s^δ))ecudu=ectt^δt^δ+t2lδ(s^δ+λ(θ(u)s^δ))ecudu+ectt^δ+t2tlδ(s^δ+λ(θ(u)s^δ))ecuducλect^δ2Cect2+lδ(φλ,c,δ(t)).

Now that we have bounded all the terms, we have the following bound:

E(f(X(t))min f)E(V(t^δ)2)c2f(0)2+2L2E(suptt0X(t)2)ec(tt^δ)+(E(f(Y(t^δ))min f)+(LC22+ClCδ)+lδ(s^δ)2μ)ec(tt^δ)+cE(f(Y(t^δ))min f)e2μ(t0+t^δc+s^δ)e2μc(tt^δ)+c(LC22+ClCδ)e2μ(1λ)(t0+t^δc+s^δ)e2μ(1λ)c(tt^δ)+c2μ(cλCec(tt^δ)2+lδ(φλ,c,δ(t)))+Cfδ,t>t^δ.

Letting λ=1/2 and c=2μ, we obtain

E(f(X(t))min f)E(V(t^δ)2)2μ2f(0)2+2L2E(suptt0X(t)2)e2μ(tt^δ)+(E(f(Y(t^δ))min f)+(LC22+ClCδ)+lδ(s^δ)2μ)e2μ(tt^δ)+2μE(f(Y(t^δ))min f)e2μ(t0+t^δ2μ+s^δ)e2μ(tt^δ)+2μ(LC22+ClCδ)eμ(t0+t^δ2μ+s^δ)e2μ2(tt^δ)+2Ce2μ(tt^δ)2+12μlδ(φ12,2μ,δ(t))+Cfδ,t>t^δ.

Letting Kμ,δ=def2μ(LC22+ClCδ)eμ(t0+t^δ2μ+s^δ)+2C, we conclude that

E(f(X(t))min f)Kμ,δe2μ2(tt^δ)+12μlδ(φ12,2μ,δ(t))+Cfδ,t>t^δ.(25)

4. From Weak to Strong Convergence Under General γ and βΓ

4.1. General Result

We consider the Tikhonov regularization of the dynamic (S-ISIHDNS), that is, for t>0,

{dX(t)=V(t)dt,t>t0, dV(t)γ(t)V(t)dtF(X(t)+Γ(t)V(t))dt+σ˜1(t,X(t)+Γ(t)V(t))dW(t),t>t0,X(t0)=X0,V(t0)=V0.(S-ISIHD-S.2)

We show some conditions (on γ,β,ε) under which we can obtain strong convergence of the trajectory.

Theorem 9.

Consider that γ:[t0,+[R+ satisfies (Hγ). Besides, F=f+g and σ satisfy Assumptions (H0) and (Hσ). Moreover, suppose that g satisfies (Hλ) and let ν2. Consider (S-ISIHDNS-TA) with βΓ and initial data X0,V0Lν(Ω;H).

Then, there exists a unique solution (X,V)SH×Hν[t0] of (S-ISIHDNS-TA). Additionally, let x=defPSF(0) be the minimum norm solution, and for ε>0, let xε be the unique minimizer of Fε(x)=defF(x)+εx2/2. If we suppose that ΓσL2([t0,+[), and that ε:[t0,+[R+ satisfies the conditions:

(T1) ε(t)0 as t+;

(T2) t0+ε(t)Γ(t)dt=+; and

(T3) t0+ε(t)Γ(t)(x2xε(t)2)dt<+.

Then s-limt+X(t)=x a.s., and V(t)=o(1Γ(t)) a.s.

Proof.

Let s0>0, θ(t)=defs0+t0tΓ(u)du; ε˜(t)=ε(θ1(t)); and σ˜(s,·)=defσ(θ1(s),·)Γ(θ1(s)). Then ε satisfying (T1),(T2), and (T3) is equivalent to ε˜ satisfying (T1), (T2), and (T3) defined in Theorem 4. Besides, ΓσL2([t0,+[) is equivalent to σ˜L2(R+). Consider the dynamic:

{dZ(s)F(Z(s))ε˜(s)Z(s)+σ˜(s,Z(s))dW(s),s>s0,Z(s0)=X0+Γ(t0)V0.(26)

By Theorem 4, we have that there exists a unique solution ZSHν[s0], and that lims+Z(s)=x a.s. (recall that x=defPSF(0)). Using the time scaling τθ and the averaging described at the beginning of this section, we end up with the dynamic (S-ISIHDNS-TA) in the case where βΓ. The existence and uniqueness of solution, and the fact that (X,V)SH×Hν[t0] goes analogously as in the proof of Theorem 5.

Now we prove the claim: Because lims+Z(s)=x a.s., this implies directly that limt+Y(t)=x a.s. Besides, we have Relation (9), that is,

X(t)=t0tY(u)dμt(u)+ξ(t),
where μt and ξ are defined in (10) and (11), respectively. Consequently, we have
X(t)xX(t)t0tY(u)dμt(u)+t0tY(u)dμt(u)xξ(t)+t0tY(u)dμt(u)x.

Let a(t)=1/Γ(t) and A(t)=t0tdu/Γ(u). By Lemma 3, we have that limt+ξ(t)=0. On the other hand,

t0tY(u)dμt(u)x=t0t(Y(u)x)dμt(u)t0tY(u)xdμt(u)=eA(t)Y(t0)x+eA(t)t0ta(u)eA(u)Y(u)xdu.

Let b(u)=Y(u)x. Because we already proved that limu+b(u)=0 a.s., and we have that aL1([t0,+[) by Lemma 3, we utilize Lemma 2 with our respective a, b functions. This let us conclude that

limt+t0tY(u)dμt(u)x=0a.s.

Thus, limt+X(t)=x a.s. Finally, because

Y(t)=X(t)+Γ(t)V(t),
and the fact that X and Y have (a.s.) the same limit, we conclude that
limt+Γ(t)V(t)=0a.s.

4.2. Concrete Cases

In order to give some conditions when (T1), (T2), and (T3) of Theorem 9 are satisfied, we need to introduce the following definition.

Definition 3

(Hölderian Error Bound). Let f:HR be a proper function such that S; f satisfies a Hölderian (or power-type) error bound inequality on S with exponent p1, if there exists κ>0 and r>min f such that

f(x)min fκdist(x,S)p,x[min ffr],(27)
and we will write fEBp(S).

Remark 7.

Let f:HR be a differentiable function such that S. If f satisfies the P-Ł inequality on S, then f satisfies a Hölderian error bound inequality with exponent p=2.

Theorem 10.

Consider the setting of Theorem 9 and suppose that F=f+gEBp(SF). Let s0>0 and denote θ(t)=defs0+t0tΓ(s)ds, then taking the Tikhonov parameter ε(t)=1/θr(t) with

1r>2p2p+1,

the three conditions (T1), (T2), and (T3) of Theorem 9 are satisfied simultaneously. In particular, for any solution (X,V)SH×Hν[t0] of (9), we get almost sure (strong) convergence of X(t) to the minimal norm solution named x=PSF(0) and that V(t)=o(1/Γ(t)).

Proof.

We proceed as in the proof of Theorem 9 and arrive to the dynamic (26); because ε˜(t)=ε(θ1(t))=1/tr, the proof goes as in Maulen-Soto et al. (2025, theorem 4.8). □

Theorem 11.

Let ν2, fΓ0(H)CL2(H) such that S is nonempty, and also fEBp(S), σ satisfying (Hσ), and ΓσL2([t0,+[) and is nonincreasing. Let us consider ε(t)=1/tr, where 0<r<1, then we evaluate (S-ISIHDNS-TA) in the case where γ satisfies (Hγ), g0, βΓ, and with initial data X0,V0Lν(Ω;H), that is, for t>t0,

{dX(t)=V(t)dt,dV(t)=γ(t)V(t)dtf(X(t)+Γ(t)V(t))dtε(t)(X(t)+Γ(t)V(t))+σ(t,X(t)+Γ(t)V(t))dW(t),X(t0)=X0,V(t0)=V0.(28)

For ε>0, let us define fε(x)=deff(x)+εx2/2, and let xε be the unique minimizer of fε. Moreover, let s0>0 and for s1>s0 consider

R(s)=defes1r1rs1seu1r1rσ2(θ1(u))Γ(θ1(u))du,(29)

where θ(t)=defs0+t0tΓ(u)du. Let also x=defPS(0), A(s)=defs1sdu/Γ(u), and t1=defθ1(s1). Then, the solution trajectory (X,V)SH×Hν[t0] is unique, and we have that

  1. R(θ(t))0 as t+.

  2. Let σ¯(t)=Γ(t)σ2(t), then

    R(θ(t))=O(exp(θr(t)(12r))+θr(t)σ¯(s1+θ(t)2)).

    Moreover, if σ¯(t)=O(θΔ(t)) for Δ>1, then R(θ(t))=O(θrΔ(t)).

    Besides, we have the following convergence rate in expectation:

  3. For the values, we have

    E[f(X(t))min(f)]=O(max{eA(t),I[h1](t)}),

    where h1(t)=1/θr(t)+R(θ(t)).

  4. Also, for the trajectory, we obtain

    E[X(t)x||2]=O(max{eA(t),I[h2](t)}),

where h2(t)=θr1(t)+θrp(t)+θr(t)R(θ(t)).

Proof.

We proceed as in the proof of Theorem 5 and define analogously σ˜, ε˜; we also consider the dynamic (12). By Maulen-Soto et al. (2025, theorem 4.11) we obtain that

R(s)=es1r1rs1seu1r1rσ˜2(u)du,
where σ˜2L2([s0,+[), satisfies the following:
  • R(s)+ as t+.

  • R(s)=O(exp(sr(12r))+srσ˜2(s1+s2)). Moreover if σ˜2(s)=O(sΔ) for Δ>1, then R(s)=O(srΔ).

Also, evaluating at s=θ(t), we obtain the first two items of the theorem. For the third and fourth items, we used that

  • E[f(Z(s))min(f)]=O(1sr+R(s)).

  • E[Z(s)x||2]=O(1s1r+1srp+srR(s)).

Then, proceeding as in the proof of Theorem 6, we obtain the desired results. □

Corollary 2.

Consider Theorem 10 in the case where γ(t)=α/t for α>1, β(t)=t/(α1); then, we have that

  1. If σ2(t)=O(t2(Δ+1)) for Δ>1, and α{1+2r,1+2(Δr)}, then

    E[f(X(t))min(f)]=O(max{t(α1),t2r,t2(Δr)}).

    In particular, if α>3,

  2. If σ2(t)=O(t2(Δ+1)) for Δ>max{1,2r}, and α{32r,1+2r/p,1+2(2rΔ)}, then

    E[X(t)x||2]=O(max{t(α1),t2(1r),t2rp,t2(2rΔ)}).

5. Conclusion

This work uncovers the global and local convergence properties of trajectories of the inertial system with implicit Hessian-driven damping under stochastic errors both in the smooth and nonsmooth setting. The aim is to solve convex optimization problems with noisy gradient input with vanishing variance. We have shed light on these properties and provided a comprehensive local and global complexity analysis both in the case where the Hessian damping parameter β was dependent on the geometric damping γ and when it was zero. We believe that this work, along with the technique of time scaling and averaging, paves the way for important extensions and research avenues. Among them, we mention extension to the situation where the drift term is a nonpotential cocoercive operator.

Appendix A. SDEs Are Better Approximations to Stochastic Inertial Algorithms

In this section, we will argue that (S-ISIHD) is an accurate continuous-time model of a natural stochastic inertial algorithm with an accuracy error that scales as O(h), and this is much better than (ISIHD) whose accuracy is only O(h). This generalizes (Dambrine et al. 2024, proposition 2.1) and holds for a more general model of the diffusion coefficient and under weaker regularity assumptions. The proof is reminiscent of strong consistency bounds of Euler-type methods for nonlinear SDEs (Kloeden and Platen 1992) that we will refine by exploiting the structure of our SDE (S-ISIHD). We also restrict our discussion to the finite-dimensional case where H=K=Rd. Similar approximation results can be found, for instance, in Hu et al. (2019b), Li et al. (2021), and Fontaine et al. (2021), whereas for momentum-based algorithms, the tools developed in Li et al. (2017) may provide useful insights for deriving alternative approximation results, once adapted to our Hessian-driven damping setting.

Given a step-size h>0, the Euler-Maruyama discretization applied to (S-ISIHD) computes approximations Xk and Vk of X(tk) and V(tk), where tk=t0+kh, kN, by initializing (X0,V0)=(X(t0),V(t0)) and forming the following iterative scheme:

{Xk+1=Xk+hVk,Vk+1=(1γkh)Vkhf(Xk+βkVk)+hσkGk,(A.1)
where GkN(0,Id), γk=γ(tk), σk=σ(tk,Xk+βkVk) and βk=β(tk). This is a stochastic version of the algorithm proposed in Alecsa et al. (2021). Setting Yk=(Xk,Vk), it will be convenient to rewrite (A.1) in the product space R2d as
{Yk+1=Yk+hΦ(tk,Yk)+hς(tk,Yk)(W(tk+1)W(tk)),Y0=(X0,V0),(A.2)
where W is a R2d-valued Brownian motion and
Φ(t,(x,v))=(v,γ(t)vf(x+β(t)v)), and ς(t,(x,v))=(0d×d0d×d0d×dσ(t,x+β(t)v)).

This then motivates the SDE

{dY(t)=Φ(t,Y(t))dt+hς(t,Y(t))dW(t),Y(t0)=(X0,V0),(A.3)
where we set Y(t)=(X(t),V(t)) which is (S-ISIHD) with an extra h in front the diffusion.

As classical in numerical analysis of evolution equations, we define the continuous-time piece-wise linear extension of the sequence (Yk)kN:

Y¯(t)=defYk+(ttk)Φ(tk,Yk)+hς(tk,Yk)(W(t)W(tk)),t[tk,tk+1[=Y0+t0tΦ^(s,Y^(s))ds+ht0tς^(s,Y^(s))dW(s),
where for t[tk,tk+1[, Y^(t)=defYk, Φ^(t,Y^(t))=defΦ(tk,Yk), ς^(t,Y^(t))=defς(tk,Yk). We also define γ^(t) and β^(t) similarly. We thus have σ^(t,X^(t)+β^(t)V^(t))=σk for t[tk,tk+1[.

Our result requires the following assumption.

Assumption A.1.

Let f:d be a continuously differentiable function with L-Lipschitz continuous gradient. For T>t0, γ and β are respectively Lγ-and Lβ-Lipschitz continuous on [t0,T]. σ verifies, t,s[t0,T] and x,xRd,

σ(t,x)σ(t,x)Lσxx,σ(t,x)Kσ(1+x),σ(t,x)σ(s,x)Lσ(1+x)|ts|1/2.
where all constants Lγ,Lβ,Lσ,Kσ do not depend on h.

All these assumptions are verified in the instances studied in Section 3 when f is smooth. Observe that these assumptions also ensure existence and uniqueness of the solution (X(t),V(t)) to (A.3) (hence, (S-ISIHD)).

We have strong consistency results that show that (A.3) is a better continuous-time approximation to (A.1) than (ISIHD).

Proposition A.1.

Suppose that Assumption 1 holds and that X0,V0L2(Ω;Rd). Let (X(t),V(t)) be the solution to (A.3) and (x(t),v(t)=x˙(t)) the solution to (ISIHD). Then the iterates of algorithm (A.1) satisfy, as h0,

E[sup0kN1XkX(tk)+VkV(tk)]=O(h),(A.4)
E[sup0kN1Xkx(tk)+Vkv(tk)]=O(h).(A.5)

Proof.

By Assumption 1, it is not difficult to see that Φ and ς verify the following the Lipschitz continuity and linear growth properties:

Φ(t,y)Φ(t,z)2max(4L2,1+2γmax2+4L2βmax2)yz2,t[t0,T],y,zRd,Φ(t,y)Φ(s,y)2(2Lγ2+4L2Lβ2)y2|ts|2,s,t[t0,T],yRd,Φ(t,y)2max(8L2,1+2γmax2+8L2βmax2)y2+4f(0)2,t[t0,T],yRd.(A.6)

In the rest of the proof, C is any positive constant that does not depend on h (and may depend on d, Tt0, the different Lipschitz and growth constants in Assumption 1), and that may change from one line to another. Using Jensen’s inequality, Doob’s martingale inequality, and Mao (2007, theorem 1.5.21), we have for any τ[t0,T],

E[supt0tτY¯(t)Y(t)2]=E[supt0tτt0t(Φ^(s,Y^(s))Φ(s,Y(s)))ds+ht0t(ς^(s,Y^(s))ς(s,Y(s)))dW(s)2]CE[t0τΦ^(s,Y^(s))Φ(s,Y(s))2ds]+ChE[t0τσ^(s,X^(s)+β^(s)V^(s))σ(s,X(s)+β(s)V(s))2ds].(A.7)

Using Jensen’s inequality, (A.6), and Assumption 1 on σ, we get

E[supt0tτY¯(t)Y(t)2]CE[t0τΦ^(s,Y^(s))Φ(s,Y^(s))2ds]+ChE[t0τσ^(s,X^(s)+β^(s)V^(s))σ(s,X^(s)+β^(s)V^(s))2ds]+C(1+h)t0τE[supt0rsY¯(r)Y(r)2]ds+C(1+h)E[t0τY¯(t)Y^(t)2ds]+ChE[supt0tTY(t)2]t0τ|β(s)β^(s)|2ds,
where the expectation in the last display is bounded by Kloeden and Platen (1992, theorem 4.5.4). Let N=(Tt0)/h. Lipschitz continuity of β gives
t0τ|β(s)β^(s)|2dsk=0N1tktk+1|β(s)β(tk)|2dsLβ2k=0N1tktk+1(stk)2ds=Lβ2(Tt0)3h2.

Now, we have for any s[tk,tk+1[,

Y¯(s)Y^(s)=(stk)Φ(tk,Yk)hς(tk,Yk)(W(s)W(tk)).

It then follows from (A.6), Assumption 1 on σ, and Kloeden and Platen (1992, theorem 4.5.4) that

E[t0τY¯(t)Y^(t)2ds]k=0N1tktk+1E[(stk)Φ(tk,Yk)+hς(tk,Yk)(W(s)W(tk))2]dsCh2.

With similar arguments, we have

E[t0τΦ^(s,Y^(s))Φ(s,Y^(s))2ds]=k=0N1tktk+1E[Φ(tk,Yk)Φ(s,Yk)2]dsCh2,
and using Assumption 1 on σ
E[t0τσ^(s,X^(s)+β^(s)V^(s))σ(s,X^(s)+β^(s)V^(s))2ds]=k=0N1tktk+1E[σ(tk,Xk+βkVk)σ(s,Xk+βkVk)2]dsCh.

Collecting all bounds, we get

E[supt0tτY¯(t)Y(t)2]C(h2+h3)+C(1+h)t0τE[supt0rsY¯(r)Y(r)2]ds.

Applying the Jensen and Gronwall inequalities then gives

E[supt0tTY¯(t)Y(t)]E[supt0tTY¯(t)Y(t)2]1/2C(h+h3/2)eC(1+h)T=O(h).

In turn

E[sup0kN1YkY(tk)]=E[sup0kN1Y¯(tk)Y(tk)]E[supt0tTY¯(t)Y(t)]=O(h),
which gives (A.4). For (A.5), it is sufficient to see that with System (A.3), the term ς(s,y(s)) disappears in the main inequality (A.7). Starting from there, this becomes the leading term that scales as O(h) (instead of O(h2) previously), hence entailing (A.5). □

Appendix B. Auxiliary Results

B.1. Deterministic Results

Lemma B.1.

Let t0>0 and a,b:[t0,+[R+. If limt+a(t) exists, bL1([t0,+[) and t0+a(s)b(s)ds<+, then limt+a(t)=0.

Lemma B.2.

Let a,b:[t0,+[R+ be two functions such that aL1([t0,+[), limu+b(u)=0, and define A(t)=deft0ta(u)du and B(t)=defeA(t)t0ta(u)eA(u)b(u)du. Then limt+B(t)=0.

Proof.

Let ε>0 arbitrary, let us take Tε such that t0<Tε and b(u)ε for uTε. For t>Tε, let us write

B(t)=eA(t)t0Tεa(u)eA(u)b(u)du+eA(t)Tεta(u)eA(u)b(u)dueA(t)t0Tεa(u)eA(u)b(u)du+ε.

Because aL1([t0,+[), then limt+eA(t)=0, we get

limsupt+B(t)ε.

This being true for any ε>0, we infer that limt+B(t)=0, which gives the claim. □

Lemma B.3.

Under Hypothesis (Hγ), then

t0+dsΓ(s)=+.

Proof.

Let q(t)=deft+ds/p(s), because t0+ds/p(s)<+, then limt+q(t)=0 and q(t)=1/p(t). On the other hand,

t0+dsΓ(s)=t0+q(t)q(t)=ln(q(t0))limtln(q(t))=+.

B.2. On Stochastic Processes

Let us recall some elements of stochastic analysis. Throughout the paper, (Ω,F,P) is a probability space and {Ft|t0} is a filtration of the σ-algebra F. Given C2Ω, we will denote σ(C) the σ-algebra generated by C. We denote F=defσ(t0Ft)F.

The expectation of a random variable ξ:ΩH is denoted by

E(ξ)=defΩξ(ω)dP(ω).

An event EF happens almost surely if P(E)=1, and it will be denoted as “E, P-a.s.” or simply “E, a.s.” The indicator function of an event EF is denoted by

1E(ω)=def{1if ωE,0otherwise.

An H-valued stochastic process starting at t00 is a function X:Ω×[t0,+[H. It is said to be continuous if X(ω,·)C([t0,+[;H) for almost all ωΩ. We will denote X(t)=defX(·,t). We are going to study SDEs and SDIs, and in order to ensure the uniqueness of a solution, we introduce a relation over stochastic processes. Two stochastic processes X,Y:Ω×[t0,T]H are said to be equivalent if X(t)=Y(t), t[t0,T], P-a.s. This leads us to define the equivalence relation R, which associates the equivalent stochastic processes in the same class.

Furthermore, we will need some properties about the measurability of these processes. A stochastic process X:Ω×[t0,+[H is progressively measurable if for every tt0, the map Ω×[t0,t]H defined by (ω,s)X(ω,s) is FtB([t0,t])-measurable, where is the product σ-algebra and B is the Borel σ-algebra. On the other hand, X is Ft-adapted if X(t) is Ft-measurable for every tt0. It is a direct consequence of the definition that if X is progressively measurable, then X is Ft-adapted.

Let us define the quotient space:

SH0[t0,T]=def{X:Ω×[t0,T]H,X is a prog. measurable cont. stochastic process}/R.

Set SH0[t0]=defTt0SH0[t0,T]. For ν>0, we define SHν[t0,T] as the subset of processes X(t) in SH0[t0,T] such that

SHν[t0,T]=def{XSH0[t0,T]:E(supt[t0,T]Xtν)<+}.

We define SHν[t0]=defTt0SHν[t0,T].

Following the notation of Gawarecki and (Mandrekar 2011, section 2.1.2), we say that Wt is a K-valued cylindrical Brownian motion defined on the filtered space (Ω,F,Ft,P) if

  1. For an arbitrary t0, the mapping Wt:KL2(Ω;R) is linear;

  2. For an arbitrary kK, Wt(k) is an Ft Brownian motion; and

  3. For arbitrary k,kK and t0, E[Wt(k)Wt(k)]=tk,kK.

Remark B.1.

There is no K-valued process W˜t such that

Wt(k)(ω)=W˜t(ω),kK.

However, if Q is a nonnegative definite symmetric trace-class operator on K, then a K-valued Q-Brownian motion can be defined (Da Prato and Zabszyk 2014, section 4.1; Gawarecki and Mandrekar 2011, definition 2.6). Moreover, if K=Rm then Wt(k)=W˜t,kK, where W˜t corresponds to the standard m-dimensional Brownian motion.

Besides, let G:Ω×R+L2(K;H) be a measurable and Ft-adapted process, then we can define 0tG(s)dW(s), which is the stochastic integral of G, and we have that G0·G(s)dW(s) is an isometry between the measurable and Ft-adapted L2(K;H)valued processes and the space of H-valued continuous square-integrable martingales (Gawarecki and Mandrekar 2011, theorem 2.4).

References

  • Alecsa C, László S, Pinta T (2021) An extension of the second order dynamical system that models Nesterov’s convex gradient method. Appl. Math. Optim. 84(2):1687–1716.Google Scholar
  • Allen-Zhu Z (2017) Katyusha: The first direct acceleration of stochastic gradient methods. J. Machine Learn. Res. 18(221):1–51.Google Scholar
  • Apidopoulos V, Aujol JF, Dossal C (2018) The differential inclusion modeling the FISTA algorithm and optimality of convergence rate in the case b3. SIAM J. Optim. 28(1):551–574.Google Scholar
  • Assran M, Rabbat M (2020) On the convergence of Nesterov’s accelerated gradient method in stochastic settings. Shawe-Taylor J, Zemel RS, Bartlett P, Pereira FCN, Weinberger KQ, eds. Proc. 37th Internat. Conf. Machine Learn., vol. 119 (Curran Associates, Inc., Red Hook, NY), 410–420.Google Scholar
  • Attouch H, Cabot A (2017) Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity. J. Differential Equations 263(9):5412–5458.Google Scholar
  • Attouch H, Peypouquet J (2016) The rate of convergence of Nesterov’s accelerated forward-backward method is actually faster than 1k2. SIAM J. Optim. 26(3):1824–1834.Google Scholar
  • Attouch H, Bot R, Nguyen DK (2024) Fast convex optimization via time scale and averaging of the steepest descent. Math. Oper. Res. 50(4):2633–2665.Google Scholar
  • Attouch H, Chbani Z, Riahi H (2019) Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α3. ESAIM: Control Optim. Calculus Variations (ESAIM-COCV), 25(2).Google Scholar
  • Attouch H, Fadili J, Kungurtsev V (2023a) On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping. Evolution Equations Control 12(1):71–117.Google Scholar
  • Attouch H, Fadili J, Kungurtsev V (2024) The stochastic Ravine accelerated gradient method with general extrapolation coefficients. Preprint, Submitted March 7, https://arxiv.org/abs/2403.04860.Google Scholar
  • Attouch H, Goudou X, Redont P (2011) The heavy ball with friction method. I: The continuous dynamical system. Comm. Contemporary Math. 2(1):1–34.Google Scholar
  • Attouch H, Peypouquet J, Redont P (2016) Fast convex optimization via inertial dynamics with Hessian driven damping. J. Differential Equations 261(10):5734–5783.Google Scholar
  • Attouch H, Balhag A, Chbani Z, Riahi H (2022a) Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling. Evolution Equations Control Theory 11(2):487–514.Google Scholar
  • Attouch H, Cabot A, Chbani Z, Riahi H (2018a) Accelerated forward-backward algorithms with perturbations: Application to Tikhonov regularization. J. Optim. Theory Appl. 179(1):1–36.Google Scholar
  • Attouch H, Chbani Z, Fadili J, Riahi H (2023b) Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping. Optimization 72(5):1199–1238.Google Scholar
  • Attouch H, Chbani Z, Fadili J, Riahi H (2022b) First-order optimization algorithms via inertial systems with Hessian driven damping. Math. Programming 193(1):113–155.Google Scholar
  • Attouch H, Chbani Z, Peypouquet J, Redont P (2018b) Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Programming Ser. B 168(1–2):123–175.Google Scholar
  • Barakat A, Bianchi P, Hachem W, Schechtman S (2021) Stochastic optimization with momentum: Convergence, fluctuations, and traps avoidance. J. Statist. 15(2):3892–3947.Google Scholar
  • Bolte J, Nguyen T, Peypouquet J, Suter BW (2016) From error bounds to the complexity of first-order descent methods for convex functions. Math. Programming 165(2):471–507.Google Scholar
  • Brézis H (1973) Opérateurs Maximaux Monotones et Semi-Groupes de Contractions dans les Espaces de Hilbert, Mathematics Studies, vol. 5 (North-Holland, New York).Google Scholar
  • Cabot A (2009) Asymptotics for a gradient system with memory term. Proc. Amer. Math. Soc. 137(9):3013–3024.Google Scholar
  • Cabot A, Engler H, Gadat S (2009) On the long time behavior of second order differential equations with asymptotically small dissipation. Trans. Amer. Math. Soc. 361(11):5983–6017. Google Scholar
  • Castera C, Attouch H, Fadili J, Ochs P (2024) Continuous Newton-like methods featuring inertia and variable mass. SIAM J. Optim. 34(1):251–277.Google Scholar
  • Castera C, Bolte J, Févotte C, Pauwels E (2021) An inertial Newton algorithm for deep learning. J. Machine Learn. Res. 22(134):1–31.Google Scholar
  • Cauchy A (1847) Méthode générale pour la résolution des systèmes d’équations simultanées. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences 25:536–538.Google Scholar
  • Cheng X, Chatterji N, Bartlett PL, Jordan MI (2018) Underdamped Langevin MCMC: A non-asymptotic analysis. Proc. Machine Learn. Res. 75:1–24. Google Scholar
  • Da Prato G, Zabszyk J (2014) Stochastic Equations in Infinite Dimensions, 2nd ed. (Cambridge University Press, Cambridge, UK).Google Scholar
  • Dalalyan AS, Karagulyan A (2019) User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient. Stochastic Processes Appl. 129(12):5278–5311. Google Scholar
  • Dalalyan A, Riou-Durand L, Karagulyan A (2019) Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets. J. Machine Learn. Res. 23(235):1–38.Google Scholar
  • Dambrine M, Dossal C, Puig B, Rondepierre A (2024) Stochastic differential equations for modeling first order optimization methods. SIAM J. Optim. 34(2):1402–1426.Google Scholar
  • Defazio A, Jelassi S (2022) Adaptivity without compromise: A momentumized, adaptive, dual averaged gradient method for stochastic optimization. J. Machine Learn. Res. 23(144):1–34.Google Scholar
  • Dossal C, Aujol J (2015) Stability of over-relaxations for the forward-backward algorithm, application to FISTA. SIAM J. Optim. 25(4):2408–2433.Google Scholar
  • Driggs D, Ehrhardt MJ, Schönlieb C (2022) Accelerating variance-reduced stochastic gradient methods. Math. Programming 191(2):671–715.Google Scholar
  • Fontaine X, De Bortoli V, Durmus A (2021) Convergence rates and approximation results for SGD and its continuous-time counterpart. Belkin M, Kpotufe S, eds. Proc. Thirty Fourth Conf. Learn. Theory, Proceedings of Machine Learning Research, vol. 134 (PMLR, New York), 1965–2058.Google Scholar
  • Frostig R, Ge R, Kakade S, Sidford A (2015) Un-regularizing: Approximate proximal point and faster stochastic algorithms for empirical risk minimization. Bach F, Blei D, eds. Proc. 32nd Internat. Conf. Machine Learn., Proceedings of Machine Learning Research, vol. 37 (PMLR, New York), 2540–2548.Google Scholar
  • Gadat S, Panloup F (2014) Long time behaviour and stationary regime of memory gradient diffusions. Annales de L’Institut Henri Poincaré - Probabilités et Statistiques 50(2):564–601.Google Scholar
  • Gadat S, Panloup F, Saadane S (2018) Stochastic heavy ball. Electronic J. Statist. 12(1):461–529.Google Scholar
  • Gawarecki L, Mandrekar V (2011) Stochastic Differential Equations in Infinite Dimensions: With Applications to Stochastic Partial Differential Equations (Springer, New York).Google Scholar
  • Goudou X, Munier J (2005) Asymptotic behavior of solutions of a gradient-like integrodifferential Volterra inclusion. Adv. Math. Sci. Appl. 15(2):509–525.Google Scholar
  • Hamadouche A, Wu Y, Wallace AM, Mota JC (2024) Sharper bounds for proximal gradient algorithms with errors. SIAM J. Optim. 34(1):278–305.Google Scholar
  • Haraux A, Jendoubi M (2012) On a second order dissipative ODE in Hilbert space with an integrable source term. Acta Math. Sci. 32(1):155–163.Google Scholar
  • Hu W, Li C, Su W (2019c) On the global convergence of continuous–Time stochastic heavy–ball method for nonconvex optimization. 2019 IEEE Internat. Conf. Big Data (IEEE, Piscataway, NJ), 94–104. Google Scholar
  • Hu W, Li C, Zhou X (2019a) On the global convergence of continuous-time stochastic heavy-ball method for nonconvex optimization. Baru CK, Huan J, Khan L, Hu X, Ak R, Tian Y, Barga RS, Zaniolo C, Lee K, Ye Y, eds. Proc. 2019 IEEE Internat. Conf. Big Data (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 94–104.Google Scholar
  • Hu W, Li C, Li L, Lui JG (2019b) On the diffusion approximation of nonconvex stochastic gradient descent. Ann. Math. Sci. Appl. 4(1):3–32.Google Scholar
  • Jain P, Netrapalli P, Kakade SM, Kidambi R, Sidford A (2017) Parallelizing stochastic gradient descent for least squares regression: Mini-batching, averaging, and model misspecification. J. Machine Learn. Res. 18(223):1–42.Google Scholar
  • Kloeden PE, Platen E (1992) Numerical Solution of Stochastic Differential Equations (Springer-Verlag, Berlin).Google Scholar
  • Laborde M, Oberman A (2020) A Lyapunov analysis for accelerated gradient methods: From deterministic to stochastic case. Chiappa S, Calandra R, eds. Proc. Twenty Third Internat. Conf. Artificial Intelligence Statist., Proceedings of Machine Learning Research, vol. 108 (PMLR, New York), 602–612.Google Scholar
  • Lan G (2020) First-order and Stochastic Optimization Methods for Machine Learning (Springer Nature, Cham, Switzerland).Google Scholar
  • Latz J (2021) Analysis of stochastic gradient descent in continuous time. Statist. Comput. 31:39. Google Scholar
  • Le T (2024) Nonsmooth nonconvex stochastic heavy ball. J. Optim. Theory Appl. 201(2):699–719.Google Scholar
  • Li Z, Malladi S, Arora S (2021) On the validity of modeling SGD with stochastic differential equations. Advances in Neural Information Processing Systems, vol. 21 (Curran Associates Inc., Red Hook, NY).Google Scholar
  • Li Q, Tai C, Weinan E (2017) Stochastic modified equations and adaptive stochastic gradient algorithms. Proc. 34th Internat. Conf. Machine Learn., vol. 70 (PMLR, New York), 2101–2110.Google Scholar
  • Li X, Shen Z, Zhang L, He N (2024) A Hessian-aware stochastic differential equation for modelling SGD. Preprint, submitted May 28, https://arxiv.org/abs/2405.18373.Google Scholar
  • Lin H, Mairal J, Harchaoui Z (2017) Catalyst acceleration for first-order convex optimization: From theory to practice. J. Machine Learn. Res. 18(212):1–54.Google Scholar
  • Loizou N, Richtárik P (2020) Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. Comput. Optim. Appl. 77(3):653–710.Google Scholar
  • Łojasiewicz S (1963) Une propriété topologique des sous-ensembles analytiques réels. Colloque du C.N.R.S. sur les Équations aux Dérivées Partielles (Paris), 87–89.Google Scholar
  • Łojasiewicz S (1965) Ensembles Semi-analytiques (Prépublication) (Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France).Google Scholar
  • Łojasiewicz S (1984) Sur les trajectoires du gradient d’une fonction analytique. Seminari di Geometria 1982/1983 (Universita di Bologna, Dipartemento di Matematica, Bologna, Italy), 115–117.Google Scholar
  • Ma YA, Chatterji N, Cheng X, Flammarion N, Bartlett P, Jordan MI (2021) Is there an analog of Nesterov acceleration for MCMC? Bernoulli 27(3):1942–1992.Google Scholar
  • Mandt S, Hoffman M, Blei D (2016) A variational analysis of stochastic gradient algorithms. Proc. 33rd Internat. Conf. Machine Learn. (PMLR, New York).Google Scholar
  • Mao X (2007) Stochastic Differential Equations and Applications, 2nd ed. (Woodhead Publishing, Chichester, UK).Google Scholar
  • Maulen-Soto R, Fadili J, Attouch H (2024) An SDE perspective on stochastic convex optimization. Math. Oper. Res. 50(4):3190–3221.Google Scholar
  • Maulen-Soto R, Fadili J, Attouch H (2025) Stochastic differential inclusions and Tikhonov regularization for stochastic non-smooth convex optimization in Hilbert spaces. Open J. Math. Optim. 6, article no.9.Google Scholar
  • May R (2017) Asymptotic for a second order evolution equation with convex potential and vanishing damping term. Turkish J. Math. 41(3):681–685.Google Scholar
  • Mertikopoulos P, Staudigl M (2018) On the convergence of gradient-like flows with noisy gradient input. SIAM J. Optim. 28(1):163–197.Google Scholar
  • Muehlebach M, Jordan MI (2021) Optimization with momentum: Dynamical, control-theoretic, and symplectic perspectives. J. Machine Learn. Res. 22(73):1–50.Google Scholar
  • Nesterov Y (1983) A method of solving a convex programming problem with convergence rate O(1/k2). Doklady Akademii Nauk SSSR (Proc. USSR Acad. Sci.) 269(3):543–547. Google Scholar
  • Öksendal B (2003) Stochastic Differential Equations, 6th ed. (Springer-Verlag, Berlin).Google Scholar
  • Orvieto A, Lucchi A (2019) Continuous-time models for stochastic optimization algorithms. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Advances in Neural Information Processing Systems, vol. 32 (Curran Associates, Inc., Red Hook, NY).Google Scholar
  • Orvieto A, Kohler J, Lucchi A (2020) The role of memory in stochastic optimization. Adams RP, Gogate V, eds. Proc. 35th Conf. Uncertainty Artificial Intelligence, Proceedings of Machine Learning Research, vol. 115 (PMLR, New York), 356–366.Google Scholar
  • Pavliotis GA (2014) Stochastic Processes and Applications: Diffusion Processes, the Fokker-Planck Equation and Large Deviations (Springer, New York). Google Scholar
  • Pettersson R (1995) Yosida approximations for multivalued stochastic differential equations. Stochastics Stochastics Rep. 52(1–2):107–120.Google Scholar
  • Polyak B (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Physics 4(5):1–17.Google Scholar
  • Robins H, Monro S (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Google Scholar
  • Rockafellar R (1997) Convex Analysis (Princeton University Press, Princeton, NJ).Google Scholar
  • Schmidt M, Le Roux N, Bach F (2011) Convergence rates of inexact proximal-gradient methods for convex optimization. Shawe‑Taylor J, Zemel RS, Bartlett PL, Pereira FCN, Weinberger KQ, eds. Advances in Neural Information Processing Systems, vol. 24 (Curran Associates, Inc., Red Hook, NY).Google Scholar
  • Shi B, Su WJ, Jordan MI (2023) On learning rates and Schrödinger operators. J. Machine Learn. Res. 24(379):1–53.Google Scholar
  • Shi B, Du S, Jordan M, Su WJ (2022) Understanding the acceleration phenomenon via high resolution differential equations. Math. Programming 195:79–148.Google Scholar
  • Soatto S, Chaudhari P (2018) Stochastic gradient descent performs variational inference, converges to limit cycles for deep networks. Choi SP, Yilmaz O, Poor HV, eds. Proc. 2018 Inform. Theory Appl. Workshop (ITA) (IEEE, Piscataway, NJ), 1–10.Google Scholar
  • Su W, Boyd S, Candès E (2016) A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights. J. Machine Learn. Res. 17(153):1–43.Google Scholar
  • Villa S, Salzo S, Baldassarres L (2013) Accelerated and inexact forward-backward. SIAM J. Optim. 23(3):1607–1633.Google Scholar
  • Xie Z, Sato I, Sugiyama M (2021) A diffusion theory for deep learning dynamics: Stochastic gradient descent exponentially favors flat minima. Proc. Ninth Internat. Conf. Learn. Representations (ICLR) (OpenReview.net).Google Scholar
  • Yan B (2018) Theoretical analysis for convex and non-convex clustering algorithms Doctoral dissertation, The University of Texas at Austin, Austin.Google Scholar