Stochastic Inertial Dynamics via Time Scaling and Averaging
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
1.1.1. First-Order in Time Systems.
To solve (P) when , a fundamental dynamic is the gradient flow system:
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 of (P) is nonempty, then each solution trajectory of (GF) converges weakly, and its (weak) limit belongs to . Moreover, this dynamic is known to yield a convergence rate of (in fact even ) on the values.
The Euler forward (a.k.a. Euler-Maruyama) discretization (GF), with stepsize sequence , is the celebrated gradient descent scheme
Under (H0), and for , then we have both the convergence of the values (in fact even ), and the weak convergence of iterates to a point in . 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:
The importance of working with an asymptotically vanishing viscosity coefficient to obtain acceleration was stressed by several authors (Cabot et al. 2009, Attouch and Cabot 2017). Most of the literature focuses on the case , originating from the seminal work of Su et al. (2016) who showed the rate of convergence of the values for , 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 is mandatory for provable accelerated rate of the values (Attouch et al. 2018b), and provides an even better rate and weak convergence of the trajectory (Attouch and Peypouquet 2016, May 2017). On the other hand, necessarily leads to a slower rate (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 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):
The rationale behind the use of the term “implicit” in (ISIHD) comes from a Taylor expansion of the gradient term (as we expect ). 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 is nothing but the time derivative of . 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 ). But for the explicit form of the Hessian-driven damping, this would entail a term involving the time derivative of . 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, 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
1.2.1. SDE Modeling of SGD.
To simplify the discussion, let us focus in this section on the finite-dimensional case (, ). 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
The SDE continuous-time approach is motivated by its close relation to (SGD) or (SGDSB). We first note that when the noise in (SGD) is , (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 provided by (SGD), with , was proved to be accurately approximated by (SGF) with and .
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
This SDI is defined on a filtered probability space , where is a measurable function; and W is a -valued cylindrical Brownian motion. When , this reduces to the stochastic counterpart of (ISIHD), given by the following SDE:
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 and shows that this is much better that the approximation rate of (ISIHD), which is only . 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
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” in the long run. In the case where , and , where is a positive real constant; under mild assumptions one can show that (S-ISIHD) has a unique invariant distribution in with density proportional to
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 and a proper choice of (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 , then under appropriate assumptions on the diffusion (volatility) term , we obtain the rate of convergence 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 , , and . Then one recovers the kinetic Langevin diffusion (or second-order Langevin process). In this case, the continuous-time Markov process is positive recurrent and has a unique invariant distribution that has the density with respect to the Lebesgue measure on . Time-discretized versions of this Langevin diffusion process have been studied in the literature to (approximately) sample from 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 or constant damping (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 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 and .
The idea of passing from a first-order system to a second-order one via time scaling is not new. In the smooth case (), 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 is replaced by some average of the gradients over all past positions . 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
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 , . Consider real separable Hilbert spaces endowed with the inner product and , respectively, and norm and , respectively (we will omit the subscripts and whenever it is clear from the context); is the identity operator from to ; is the space of bounded linear operators from to ; is the space of trace-class operators; and is the space of bounded linear Hilbert-Schmidt operators from to . For , the trace is defined by
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 the class of proper lsc and convex functions on taking values in . For , is the class of -strongly convex functions, that is, functions f such that is convex. We denote by the class of s-times continuously differentiable functions on . For , is the set of functions on whose gradient is L-Lipschitz continuous, and is the subset of whose functions are twice differentiable.
The subdifferential of a function is the set-valued operator such that, for every x in ,
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 . Therefore, throughout the paper, we assume that the diffusion (volatility) term satisfies
(
For , let be a viscous damping and define
We assume that
Let us notice that satisfies the relation
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 :
(
where . Then, there exists a unique solution (see Section 7.2 for the notation) of (1). Additionally, if , then
.
, exists a.s. and a.s.
a.s. As a result, a.s.
There exists an -valued random variable such that a.s.
(
Moreover, if , then the following hold:
a.s.
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 satisfy (H0) and (Hσ). We consider the stochastic differential inclusion
The following definition makes precise the notion of solution that we are interested in.
A solution of (SGI) is a couple of -adapted processes such that almost surely
X is continuous with sample paths in the domain of .
is absolutely continuous, such that , and , , for almost all ;
For ,
(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 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 of the SDEs
We define the integrability condition that for every ,
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 has full domain and there exists such that
This is, for instance, the case when g is Lipschitz continuous.
The following results on (SGI) were proved in Maulen-Soto et al. (2025).
(
Moreover, if , then the following holds:
.
, exists a.s. and a.s.
If g is continuous, then is constant on , there exists such that a.s., and
There exists an -valued random variable such that .
2.3.3. Tikhonov Regularization.
Let us now turn to a Tikhonov regularization of (SGI), that is,
Solution existence and uniqueness for (SGI-TA) are established in Maulen-Soto et al. (2025, theorem 3.3). We also have the following.
(
(T1) as ;
(T2) ;
(T3)
Then, we have
a.s., and
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 , . We consider the potential where g satisfies (Hλ). Let be a diffusion term in the time parametrization by s. We will study the dynamic (SGI) in s, starting at , with diffusion term under Hypotheses (H0) and (Hσ). Let be such that
Let us make the change of time in the dynamic (3), where is an increasing function from to , which is twice differentiable and which satisfies . Denote and be such that . By the chain rule and Öksendal 2003 (theorem 8.5.7), we have
Consider the smooth case, that is, when and the hypotheses of Theorem 2 ( and ), then we can conclude that the convergence rate of (4) (when ) is the following:
By introducing a function that grows faster than the identity (), we have accelerated the dynamic, passing from the asymptotic convergence rate for (3) to 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 , 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 as
Combining the previous equation with (4), we have that
Using that and dividing by , we then have
Therefore, after the time scaling and averaging, we obtain the following dynamic:
Let satisfy (Hγ). We are going to determine in order to obtain a viscous damping coefficient equal to , that is,
Clearly, solves the following ODE in :
As observed in Remark 2, the function also satisfies the same ODE, and thus we can adjust the initial condition of to obtain
We then integrate and take to get as required. This is a valid selection of because is an increasing function from to , twice differentiable and 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 , we have that (ISIHD-S.1) is equivalent to
Clearly, (ISIHD-S.2) is nothing but (S-ISIHDNS) when and .
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 in terms of only. For this, let
Recalling the averaging in (6), we need to integrate the following equation:
Multiplying both sides by and using (6), we get equivalently
Integrating and again using (6), we obtain
Then we can write
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 , 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.
Let and consider the dynamic (S-ISIHDNS) with initial data , where satisfies (Hγ), and . Besides, and satisfy Assumptions (H0) and (Hσ). Moreover, suppose that g satisfies (Hλ). Then, there exists a unique solution of (S-ISIHDNS). Additionally, if , then there exists an -valued random variable such that a.s. and a.s.
Let , , and . Then is equivalent to . Consider the dynamic:
By Theorem 3, we have that there exists a unique solution of (12) and an -valued random variable such that 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 . Now let us validate . Because
Thanks to Relation (9), the following holds:
Let be arbitrary. Taking supremum over and then expectation at both sides, we obtain that
Because , we have
Similar to before, we let be arbitrary, and take the supremum over and then expectation at both sides to obtain
Because is a continuous positive function, by the extreme value theorem, we have that there exists such that , and we conclude that .
Now we prove that there exists an -valued random variable such that a.s. By virtue of Theorem 3, there exists an -valued random variable such that a.s. We also notice that we have directly a.s. Let be arbitrary and use Relation (9) as follows:
Now let and . By Lemma 3 (defined in Section 7.1) and the fact that , we have that a.s. On the other hand, it holds that
Now let . Because we already proved that a.s., and we have that by Lemma 3, we utilize Lemma 2 (also defined in Section 7.1) with our respective a, b functions. This let us conclude that
Thus, a.s. Finally, because
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.
Let and consider the dynamic (S-ISIHD) with initial data , such that f and satisfy (H0) and (Hγ), and in the case where satisfies (Hγ), . Moreover, suppose that either is finite dimensional or , and
From Hypothesis (Hλ), we have that , and because , we can use Lemma 2 to check that .
If 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 , where is the Moreau envelope of g with parameter . 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
We will utilize the averaging technique used in Theorem 5 and Jensen’s inequality. First, we have
Let us recall that , which implies that . We bound the first term using the convexity of f and Cauchy-Schwarz inequality, that is, that for every ,
For the second term, we use Jensen’s inequality to obtain
Because is equivalent to , by Theorem 2, we have that there exists such that . Then, we have . Hence, there exists such that
Let and consider the dynamic (S-ISIHD) with initial data , such that f and satisfy (H0) and (Hσ), and in the case where satisfies (Hγ), . Moreover, suppose that and
Consider (12) and the technique used in Theorem 5. We have that is equivalent to . Therefore, we can use Theorem 2 to state that
Using the time scaling and making the change of variable in the previous integral, we obtain
Recalling that in the averaging, we impose that , we conclude. □
3.3. Fast Convergence Under and
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 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.
(
a.s.
.
Consider (12) with and . Let . Notice that is equivalent to . We apply Theorem 2 to deduce that
Using the time scaling and then the averaging technique as in the proof of Theorem 5, we have that
Moreover, it holds that
Now we prove the first point in the following way:
Let us bound the first term using the convexity of f:
Let us recall that a.s. Because of the time scaling and averaging, it is direct to check that a.s. On the other hand, a.s. Therefore, we have
(14)Now let us bound the second term using Jensen’s inequality:
In order to calculate the limit of this second term, let ; by Lemma 2, we have that
Because , we also have that
(15)Therefore, we conclude that
By Theorem 6, in the case , we have that and . On the other hand,
Because , we have that is also , and we conclude that
This point follows directly from Theorem 7 in the case . □
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.
(
Let and consider the dynamic (S-ISIHD) with initial data , where f satisfies (), and satisfies (Hσ). Besides, and suppose that either is finite dimensional or . Let also, , , and such that .
Then the solution trajectory is unique. Moreover, letting , then there exists such that
Besides, if holds on the entire space (i.e., ), then we have that there exists such that
If f is μ-strongly convex, then holds on the entire space (i.e., ).
For a proper discussion on the arbitrarily small (but nonzero) term , we refer to (Maulen-Soto et al. 2024, section 4).
Consider the dynamic (S-ISIHD) with , where is a constant that will be fixed later.
Let us also define and . Then is equivalent to . Now consider the dynamic
Let and apply the result of Maulen-Soto et al. (2024, theorem 4.5(i-b)) (with coefficient ); that is, there exists such that for every ,
Considering the time scaling , and such that (i.e., ), we have that
Let and . Now, we consider the averaging as in (8) but change the initial condition to . Thus, we have
Then
We can bound the first term using convexity and Cauchy-Schwarz inequality in the following way:
On the other hand, we can bound the second term using Jensen’s inequality and then (21):
We bound the first integral as follows:
The second integral is bounded in the same way:
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 and that is decreasing. Let us define , then
Now that we have bounded all the terms, we have the following bound:
Letting and , we obtain
Letting , we conclude that
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 ,
We show some conditions (on ) under which we can obtain strong convergence of the trajectory.
Consider that satisfies (Hγ). Besides, and satisfy Assumptions (H0) and (Hσ). Moreover, suppose that g satisfies (Hλ) and let . Consider (S-ISIHDNS-TA) with and initial data .
Then, there exists a unique solution of (S-ISIHDNS-TA). Additionally, let be the minimum norm solution, and for , let be the unique minimizer of . If we suppose that , and that satisfies the conditions:
() as ;
() ; and
()
Then a.s., and a.s.
Let , ; ; and . Then satisfying (),(), and () is equivalent to satisfying (), (), and () defined in Theorem 4. Besides, is equivalent to . Consider the dynamic:
By Theorem 4, we have that there exists a unique solution , and that a.s. (recall that ). 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 goes analogously as in the proof of Theorem 5.
Now we prove the claim: Because a.s., this implies directly that a.s. Besides, we have Relation (9), that is,
Let and . By Lemma 3, we have that . On the other hand,
Let . Because we already proved that a.s., and we have that by Lemma 3, we utilize Lemma 2 with our respective a, b functions. This let us conclude that
Thus, a.s. Finally, because
4.2. Concrete Cases
In order to give some conditions when (), (), and () of Theorem 9 are satisfied, we need to introduce the following definition.
(
Let be a differentiable function such that . If f satisfies the P-Ł inequality on , then f satisfies a Hölderian error bound inequality with exponent .
Consider the setting of Theorem 9 and suppose that . Let and denote , then taking the Tikhonov parameter with
the three conditions (), (), and () of Theorem 9 are satisfied simultaneously. In particular, for any solution of (9), we get almost sure (strong) convergence of to the minimal norm solution named and that .
We proceed as in the proof of Theorem 9 and arrive to the dynamic (26); because , the proof goes as in Maulen-Soto et al. (2025, theorem 4.8). □
Let , such that is nonempty, and also , satisfying (Hσ), and and is nonincreasing. Let us consider , where , then we evaluate (S-ISIHDNS-TA) in the case where satisfies (Hγ), , , and with initial data , that is, for ,
For , let us define , and let be the unique minimizer of . Moreover, let and for consider
where . Let also , , and . Then, the solution trajectory is unique, and we have that
Let , then
Moreover, if for , then .
Besides, we have the following convergence rate in expectation:
For the values, we have
where .
Also, for the trajectory, we obtain
where .
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
as .
. Moreover if for , then .
Also, evaluating at , we obtain the first two items of the theorem. For the third and fourth items, we used that
.
Then, proceeding as in the proof of Theorem 6, we obtain the desired results. □
Consider Theorem 10 in the case where for , ; then, we have that
If for , and , then
In particular, if ,
If for , and , then
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 , and this is much better than (ISIHD) whose accuracy is only . 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 . 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 , the Euler-Maruyama discretization applied to (S-ISIHD) computes approximations and of and , where , , by initializing and forming the following iterative scheme:
This then motivates the SDE
As classical in numerical analysis of evolution equations, we define the continuous-time piece-wise linear extension of the sequence :
Our result requires the following assumption.
Let be a continuously differentiable function with L-Lipschitz continuous gradient. For , and are respectively -and -Lipschitz continuous on . verifies, and ,
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 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).
Suppose that Assumption 1 holds and that . Let be the solution to (A.3) and the solution to (ISIHD). Then the iterates of algorithm (A.1) satisfy, as ,
By Assumption 1, it is not difficult to see that and verify the following the Lipschitz continuity and linear growth properties:
In the rest of the proof, C is any positive constant that does not depend on h (and may depend on d, , 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 ,
Using Jensen’s inequality, (A.6), and Assumption 1 on , we get
Now, we have for any
It then follows from (A.6), Assumption 1 on , and Kloeden and Platen (1992, theorem 4.5.4) that
With similar arguments, we have
Collecting all bounds, we get
Applying the Jensen and Gronwall inequalities then gives
In turn
Appendix B. Auxiliary Results
B.1. Deterministic Results
Let and . If exists, and , then
Let be two functions such that , , and define and . Then .
Let arbitrary, let us take such that and for . For , let us write
Because , then , we get
This being true for any , we infer that , which gives the claim. □
Under Hypothesis (Hγ), then
Let , because , then and . On the other hand,
B.2. On Stochastic Processes
Let us recall some elements of stochastic analysis. Throughout the paper, is a probability space and is a filtration of the σ-algebra . Given , we will denote the σ-algebra generated by . We denote .
The expectation of a random variable is denoted by
An event happens almost surely if , and it will be denoted as “E, -a.s.” or simply “E, a.s.” The indicator function of an event is denoted by
An -valued stochastic process starting at is a function . It is said to be continuous if for almost all . We will denote . 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 are said to be equivalent if , , -a.s. This leads us to define the equivalence relation , 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 is progressively measurable if for every , the map defined by is -measurable, where is the product -algebra and is the Borel -algebra. On the other hand, X is -adapted if is -measurable for every . It is a direct consequence of the definition that if X is progressively measurable, then X is -adapted.
Let us define the quotient space:
Set . For , we define as the subset of processes in such that
We define .
Following the notation of Gawarecki and (Mandrekar 2011, section 2.1.2), we say that is a -valued cylindrical Brownian motion defined on the filtered space if
For an arbitrary , the mapping is linear;
For an arbitrary , is an Brownian motion; and
For arbitrary and , .
There is no -valued process such that
However, if Q is a nonnegative definite symmetric trace-class operator on , then a -valued Q-Brownian motion can be defined (Da Prato and Zabszyk 2014, section 4.1; Gawarecki and Mandrekar 2011, definition 2.6). Moreover, if then , where corresponds to the standard m-dimensional Brownian motion.
Besides, let be a measurable and -adapted process, then we can define , which is the stochastic integral of G, and we have that is an isometry between the measurable and -adapted valued processes and the space of -valued continuous square-integrable martingales (Gawarecki and Mandrekar 2011, theorem 2.4).
References
- (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
- (2017) Katyusha: The first direct acceleration of stochastic gradient methods. J. Machine Learn. Res. 18(221):1–51.Google Scholar
- (2018) The differential inclusion modeling the FISTA algorithm and optimality of convergence rate in the case . SIAM J. Optim. 28(1):551–574.Google Scholar
- (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
- (2017) Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity. J. Differential Equations 263(9):5412–5458.Google Scholar
- (2016) The rate of convergence of Nesterov’s accelerated forward-backward method is actually faster than . SIAM J. Optim. 26(3):1824–1834.Google Scholar
- (2024) Fast convex optimization via time scale and averaging of the steepest descent. Math. Oper. Res. 50(4):2633–2665.Google Scholar
- (2019) Rate of convergence of the Nesterov accelerated gradient method in the subcritical case . ESAIM: Control Optim. Calculus Variations (ESAIM-COCV), 25(2).Google Scholar
- (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
- (2024) The stochastic Ravine accelerated gradient method with general extrapolation coefficients. Preprint, Submitted March 7, https://arxiv.org/abs/2403.04860.Google Scholar
- (2011) The heavy ball with friction method. I: The continuous dynamical system. Comm. Contemporary Math. 2(1):1–34.Google Scholar
- (2016) Fast convex optimization via inertial dynamics with Hessian driven damping. J. Differential Equations 261(10):5734–5783.Google Scholar
- (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
- (2018a) Accelerated forward-backward algorithms with perturbations: Application to Tikhonov regularization. J. Optim. Theory Appl. 179(1):1–36.Google Scholar
- (2023b) Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping. Optimization 72(5):1199–1238.Google Scholar
- (2022b) First-order optimization algorithms via inertial systems with Hessian driven damping. Math. Programming 193(1):113–155.Google Scholar
- (2018b) Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Programming Ser. B 168(1–2):123–175.Google Scholar
- (2021) Stochastic optimization with momentum: Convergence, fluctuations, and traps avoidance. J. Statist. 15(2):3892–3947.Google Scholar
- (2016) From error bounds to the complexity of first-order descent methods for convex functions. Math. Programming 165(2):471–507.Google Scholar
- (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
- (2009) Asymptotics for a gradient system with memory term. Proc. Amer. Math. Soc. 137(9):3013–3024.Google Scholar
- , 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
- (2024) Continuous Newton-like methods featuring inertia and variable mass. SIAM J. Optim. 34(1):251–277.Google Scholar
- (2021) An inertial Newton algorithm for deep learning. J. Machine Learn. Res. 22(134):1–31.Google Scholar
- (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
- (2018) Underdamped Langevin MCMC: A non-asymptotic analysis. Proc. Machine Learn. Res. 75:1–24. Google Scholar
- (2014) Stochastic Equations in Infinite Dimensions, 2nd ed. (Cambridge University Press, Cambridge, UK).Google Scholar
- (2019) User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient. Stochastic Processes Appl. 129(12):5278–5311. Google Scholar
- (2019) Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets. J. Machine Learn. Res. 23(235):1–38.Google Scholar
- (2024) Stochastic differential equations for modeling first order optimization methods. SIAM J. Optim. 34(2):1402–1426.Google Scholar
- (2022) Adaptivity without compromise: A momentumized, adaptive, dual averaged gradient method for stochastic optimization. J. Machine Learn. Res. 23(144):1–34.Google Scholar
- (2015) Stability of over-relaxations for the forward-backward algorithm, application to FISTA. SIAM J. Optim. 25(4):2408–2433.Google Scholar
- (2022) Accelerating variance-reduced stochastic gradient methods. Math. Programming 191(2):671–715.Google Scholar
- (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
- (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
- (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
- (2018) Stochastic heavy ball. Electronic J. Statist. 12(1):461–529.Google Scholar
- (2011) Stochastic Differential Equations in Infinite Dimensions: With Applications to Stochastic Partial Differential Equations (Springer, New York).Google Scholar
- (2005) Asymptotic behavior of solutions of a gradient-like integrodifferential Volterra inclusion. Adv. Math. Sci. Appl. 15(2):509–525.Google Scholar
- (2024) Sharper bounds for proximal gradient algorithms with errors. SIAM J. Optim. 34(1):278–305.Google Scholar
- (2012) On a second order dissipative ODE in Hilbert space with an integrable source term. Acta Math. Sci. 32(1):155–163.Google Scholar
- (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
- (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
- (2019b) On the diffusion approximation of nonconvex stochastic gradient descent. Ann. Math. Sci. Appl. 4(1):3–32.Google Scholar
- (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
- (1992) Numerical Solution of Stochastic Differential Equations (Springer-Verlag, Berlin).Google Scholar
- (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
- (2020) First-order and Stochastic Optimization Methods for Machine Learning (Springer Nature, Cham, Switzerland).Google Scholar
- (2021) Analysis of stochastic gradient descent in continuous time. Statist. Comput. 31:39. Google Scholar
- (2024) Nonsmooth nonconvex stochastic heavy ball. J. Optim. Theory Appl. 201(2):699–719.Google Scholar
- (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
- (2017) Stochastic modified equations and adaptive stochastic gradient algorithms. Proc. 34th Internat. Conf. Machine Learn., vol. 70 (PMLR, New York), 2101–2110.Google Scholar
- (2024) A Hessian-aware stochastic differential equation for modelling SGD. Preprint, submitted May 28, https://arxiv.org/abs/2405.18373.Google Scholar
- (2017) Catalyst acceleration for first-order convex optimization: From theory to practice. J. Machine Learn. Res. 18(212):1–54.Google Scholar
- (2020) Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. Comput. Optim. Appl. 77(3):653–710.Google Scholar
- (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
- (1965) Ensembles Semi-analytiques (Prépublication) (Institut des Hautes Études Scientifiques, Bures-sur-Yvette, France).Google Scholar
- (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
- (2021) Is there an analog of Nesterov acceleration for MCMC? Bernoulli 27(3):1942–1992.Google Scholar
- (2016) A variational analysis of stochastic gradient algorithms. Proc. 33rd Internat. Conf. Machine Learn. (PMLR, New York).Google Scholar
- (2007) Stochastic Differential Equations and Applications, 2nd ed. (Woodhead Publishing, Chichester, UK).Google Scholar
- (2024) An SDE perspective on stochastic convex optimization. Math. Oper. Res. 50(4):3190–3221.Google Scholar
- (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
- (2017) Asymptotic for a second order evolution equation with convex potential and vanishing damping term. Turkish J. Math. 41(3):681–685.Google Scholar
- (2018) On the convergence of gradient-like flows with noisy gradient input. SIAM J. Optim. 28(1):163–197.Google Scholar
- (2021) Optimization with momentum: Dynamical, control-theoretic, and symplectic perspectives. J. Machine Learn. Res. 22(73):1–50.Google Scholar
- (1983) A method of solving a convex programming problem with convergence rate . Doklady Akademii Nauk SSSR (Proc. USSR Acad. Sci.) 269(3):543–547. Google Scholar
- (2003) Stochastic Differential Equations, 6th ed. (Springer-Verlag, Berlin).Google Scholar
- (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
- (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
- (2014) Stochastic Processes and Applications: Diffusion Processes, the Fokker-Planck Equation and Large Deviations (Springer, New York). Google Scholar
- (1995) Yosida approximations for multivalued stochastic differential equations. Stochastics Stochastics Rep. 52(1–2):107–120.Google Scholar
- (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Physics 4(5):1–17.Google Scholar
- (1951) A stochastic approximation method. Ann. Math. Statist. 22(3):400–407.Google Scholar
- (1997) Convex Analysis (Princeton University Press, Princeton, NJ).Google Scholar
- (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
- (2023) On learning rates and Schrödinger operators. J. Machine Learn. Res. 24(379):1–53.Google Scholar
- (2022) Understanding the acceleration phenomenon via high resolution differential equations. Math. Programming 195:79–148.Google Scholar
- (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
- (2016) A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights. J. Machine Learn. Res. 17(153):1–43.Google Scholar
- (2013) Accelerated and inexact forward-backward. SIAM J. Optim. 23(3):1607–1633.Google Scholar
- (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
- (2018) Theoretical analysis for convex and non-convex clustering algorithms Doctoral dissertation, The University of Texas at Austin, Austin.Google Scholar

