Derivatives of Stochastic Gradient Descent in parametric optimization

Authors: franck  iutzeler
edouard  pauwels
samuel  vaiter
Venue: NeurIPS_cc_2024_Conference
Published: 2024-05-13 21:53:13

Abstract: We consider stochastic optimization problems where the objective depends on some parameter, as commonly found in hyperparameter optimization for instance. We investigate the behavior of the derivatives of the iterates of Stochastic Gradient Descent (SGD) with respect to that parameter and show that they are driven by an inexact SGD recursion on a different objective function, perturbed by the convergence of the original SGD. This enables us to establish that the derivatives of SGD converge to the derivative of the solution mapping in terms of mean squared error whenever the objective is strongly convex. Specifically, we demonstrate that with constant step-sizes, these derivatives stabilize within a noise ball centered at the solution derivative, and that with vanishing step-sizes they exhibit $O(\log(k)^2 / k)$ convergence rates. Additionally, we prove exponential convergence in the interpolation regime.  Our theoretical findings are illustrated by numerical experiments on synthetic tasks.

Main paper: 
 introduction: 
 The differentiation of iterative algorithms has been a subject of research since the 1990s (Gilbert, 1992; Christianson, 1994; Beck, 1994) , and was succinctly described as "piggyback differentiation" by Griewank and Faure (2003) . This idea has gained renewed interest within the machine learning community, particularly for applications such as hyperparameter optimization (Maclaurin et al., 2015; Franceschi et al., 2017) , meta-learning (Finn et al., 2017; Rajeswaran et al., 2019) , and learning discretization of total variation (Chambolle and Pock, 2021; Bogensperger et al., 2022) . When applied to an optimization problem, an important theoretical concern is the convergence of the derivatives of iterates to the derivatives of the solution. Traditional guarantees focus on asymptotic convergence to the solution derivative, as described by the implicit function theorem (Gilbert, 1992; Christianson, 1994; Beck, 1994) . This issue has inspired recent works for smooth optimization algorithms (Mehmood and Ochs, 2020, 2022) , generic nonsmooth iterations (Bolte et al., 2022) , and second-order methods (Bolte et al., 2023) .Convergence analysis of iterative processes have predominantly focused on deterministic algorithms such as the gradient descent. In this work, we extend these results in the context of strongly convex parametric optimization by studying the iterative differentiation of the Stochastic Gradient Descent (SGD) algorithm. Since the seminal work of Robbins and Monro (1951) , SGD has been a workhorse of stochastic optimization and is extensively employed in training various machine learning models (Bottou et al., 2018; Gower et al., 2019) . A critical aspect of our work is based on the fact that the sequence of iterative derivatives in this stochastic setting is itself a stochastic gradient sequence.What is the dynamics of the derivatives of the iterates of stochastic gradient descent in the context of minimization of parametric strongly convex functions?Our motivation for studying this question is twofold. First, while iterative differentiation through SGD sequences is possibly not the most efficient way to differentiate solutions of convex programs, it is very natural in the context of differentiable programming and has already been motivated and explored in the machine learning literature (Maclaurin et al., 2015; Pedregosa, 2016; Finn et al., 2017; Ji et al., 2022) . Second, existing attempts to provide stochastic oracle based methods to differentiate through convex programming solutions require more intricate algorithmic schemes than the conceptually simple iterative differentiation of SGD. Despite its conceptual simplicity, the answer to this question is not direct in the first place due to the joint effect of noise on the iterate sequence and its derivatives.Contributions. The strongly convex setting ensures that the solution mapping is single valued and differentiable under appropriate smoothness assumptions. In this setting, we prove in Theorem 2.2 the convergence of the derivatives of the SGD recursion toward the derivative of the solution mapping, in the sense of mean squared errors:• We first provide a general result for non-increasing step-sizes converging to some η ≥ 0 (covering constant step-sizes schedules), for which we prove that the derivatives of SGD eventually fluctuate in a ball centered at the solution derivative, of size proportional to √ η.• With vanishing steps, this result implies that the derivatives of SGD converge toward the solution derivatives, and we obtain O(log(k) 2 /k) convergence rates for O(1/k) step-size decay schedules.• We also study the interpolation regime, for which we show that the derivatives converge exponentially fast toward the derivative of the solution mapping. All these results suggest that derivatives of SGD sequences behave qualitatively similarly as the original SGD sequence under typical step size regimes.The key insight in proving these results is to interpret the recursion describing the derivatives of SGD as a perturbed SGD sequence, or SGD with errors, related to a quadratic parametric optimization problem involving the second order derivatives at the solution of the original problem. We perform a general abstract analysis of inexact SGD recursions, that is, SGD with an additional error term which is not required to have zero mean. This constitutes a result of independent interest, which we apply to the sequence of SGD derivatives in order to prove their convergence toward the derivative of the solution mapping. The developed theory is illustrated with numerical experiments on synthetic tasks. We believe our work paves the way to a better understanding of stochastic hyperparameter optimization, and more generally stochastic meta-learning strategies.Related works. Differentiating through algorithms is closely associated with the broader concept of automatic differentiation (Griewank, 1989) . In practice, it is implemented using either the forward mode (Wengert, 1964) , or the more common reverse mode (Rumelhart et al., 1986 ) known as backpropagation. For detailed surveys, see (Griewank et al., 1993) or (Griewank and Walther, 2008; Baydin et al., 2018) . Modern machine learning is intrinsically linked to this idea through the use of Python frameworks like Tensorflow (Abadi et al., 2015) , PyTorch (Paszke et al., 2019) , and JAX (Bradbury et al., 2018; Blondel et al., 2022) . When using the reverse mode, a limitation of this method is the need to retain every iteration of the inner optimization process in memory, although this challenge can be mitigated by employing checkpointing, invertible optimization algorithms (Maclaurin et al., 2015) , by utilizing truncated backpropagation (Shaban et al., 2019) , Jacobian-free backpropagation (Fung et al., 2022) or one-step differentiation (Bolte et al., 2023) .Along with iterative differentiation (ITD), (approximate) implicit differentiation (AID) plays an increasing important role, sometimes under the name implicit deep learning. El Ghaoui et al. (2021) highlights the utility of fixed-point equations in defining hidden features, and (Bai et al., 2019) proposes equilibrium points for sequence models, reducing memory consumption significantly. Further, (Bertrand et al., 2020; Agrawal et al., 2019) expands implicit differentiation's applications to high-dimensional, non-smooth problems and convex programs. Ablin et al. (2020) emphasizes the computational benefits of automatic differentiation, particularly in min-min optimization. In particular, OptNet (Amos and Kolter, 2017) and Deep Equilibrium Models (DEQ) (Bai et al., 2019) are examples of relevant applications.Hypergradient estimation through iterative differentiation or implicit differentiation has a long story in machine learning (Pedregosa, 2016; Lorraine et al., 2020) . In the context of imaging, itera-tive differentiation was used to perform hyperparameter selection through the Stein's unbiased risk estimator (Deledalle et al., 2014) , and also for refitting procedure (Deledalle et al., 2017) . Modelagnostic Meta-learning (MAML) was introduced by Finn et al. (2017) as a methodology to train neural architectures that adapt to new tasks through iterative differentiation (meta-learning). It was later adapted to implicit differentiation (Rajeswaran et al., 2019) . These developments motivated further studies of the bilevel programming problem in a machine learning context (Franceschi et al., 2018; Grazzi et al., 2020) .The literature on the stochastic iterative and implicit differentiation is more limited. In the stochastic setting, Grazzi et al. (2021 Grazzi et al. ( , 2023 Grazzi et al. ( , 2024) ) considered implicit differentiation, mostly as a stochastic approximation to solve the implicit differentiation linear equation or use independent copies for the derivative part. In general stochastic approaches for bilevel optimization sample different batches for the iterate and derivative recursions. Here we jointly analyze both recursion with the same samples. Despite this lack of systemic theoretical analysis of convergence, differentiating through the SGD iterates is mentioned in Maclaurin et al. (2015) which is focused on an efficient implementation of backpropagation through SGD, Pedregosa (2016) 2021) introduces a method, demonstrating improved convergence rates for stochastic nested problems through a unified SGD approach. In the same vein, Arbel and Mairal (2021) leverages inexact implicit differentiation and warm-start strategies to match the computational efficiency of oracle methods, proving effective in hyperparameter optimization. Additionally, the work (Ji et al., 2021) provides a thorough convergence analysis for AID and ITD-based methods, proposing the novel stocBiO algorithm for enhanced sample complexity. Furthermore, (Dagréou et al., 2022; Dagréou et al., 2024) introduce a novel framework allowing unbiased gradient estimates and variance reduction methods for stochastic bilevel optimization.Although this is not the initial focus of this work, the technical bulk of our arguments requires an analysis of perturbed, or inexact, SGD sequences. This amounts to study the robustness of the stochastic gradient algorithm with non-centered noise, or equivalently non-vanishing deterministic errors. Such questioning around robustness to errors have existed for decades in the stochastic approximation literature, see for example (Ermoliev, 1983; Chen et al., 1987) and references therein. Many existing results presented in the literature are qualitative and relate to nonconvex optimization (Solodov and Zavriev, 1998; Borkar, 2009; Doucet and Tadic, 2017; Ramaswamy and Bhatnagar, 2017; Dieuleveut et al., 2023) . Let us also mention the smooth convex setting for which inexact oracles have been studied by (Nedić and Bertsekas, 2010; Devolder et al., 2014) . A recent account of existing convergence results for biased SGD is given by Demidovich et al. (2023) . As a byproduct of our arguments, we provide a general mean squared error convergence analysis of inexact SGD for a diversity of step size regimes, in the smooth, strongly convex setting. Our analysis allows to handle random non stationary bias terms, whose magnitude depend on the iteration counter k. This is customary as the errors in the sequence of derivatives are due to the suboptimality of the sequence of iterates. These errors thus depend on the realization of the iterate sequence, requiring a dedicated analysis not covered by existing art Demidovich et al. (2023) .2 The derivative of SGD is inexact SGDQuestion: Do the main claims made in the abstract and introduction accurately reflect the paper's contributions and scope?Answer: [Yes] Justification: We propose a theoretical analysis to iterative differentiation of stochastic gradient descent as highlighted in abstract and introduction.Guidelines:• The answer NA means that the abstract and introduction do not include the claims made in the paper. • The abstract and/or introduction should clearly state the claims made, including the contributions made in the paper and important assumptions and limitations. A No or NA answer to this question will not be perceived well by the reviewers. • The claims made should match theoretical and experimental results, and reflect how much the results can be expected to generalize to other settings. • It is fine to include aspirational goals as motivation as long as it is clear that these goals are not attained by the paper.Question: Does the paper fully disclose all the information needed to reproduce the main experimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and data are provided or not)?Answer: [Yes] Justification: Our numerical experiments are simple and reproducible, and we provide all the necessary details in the paper to reproduce the main experimental results.Guidelines:• The answer NA means that the paper does not include experiments.• If the paper includes experiments, a No answer to this question will not be perceived well by the reviewers: Making the paper reproducible is important, regardless of whether the code and data are provided or not. • If the contribution is a dataset and/or model, the authors should describe the steps taken to make their results reproducible or verifiable. • Depending on the contribution, reproducibility can be accomplished in various ways.For example, if the contribution is a novel architecture, describing the architecture fully might suffice, or if the contribution is a specific model and empirical evaluation, it may be necessary to either make it possible for others to replicate the model with the same dataset, or provide access to the model. In general. releasing code and data is often one good way to accomplish this, but reproducibility can also be provided via detailed instructions for how to replicate the results, access to a hosted model (e.g., in the case of a large language model), releasing of a model checkpoint, or other means that are appropriate to the research performed. • While NeurIPS does not require releasing code, the conference does require all submissions to provide some reasonable avenue for reproducibility, which may depend on the nature of the contribution. For example (d) We recognize that reproducibility may be tricky in some cases, in which case authors are welcome to describe the particular way they provide for reproducibility.In the case of closed-source models, it may be that access to the model is limited in some way (e.g., to registered users), but it should be possible for other researchers to have some path to reproducing or verifying the results. 
intuitive overview: 
 We consider a parametric stochastic optimization problem of the formx ⋆ (θ) = arg min x∈R d F (x, θ) := E ξ∼P [f (x, θ; ξ)] (Opt)where F : R d × Θ → R is smooth and strongly convex in x for a fixed θ. The stochastic gradient descent algorithm, stochastic gradient descent (SGD), is defined by an initialization x 0 (θ), and fork ∈ N x k+1 (θ) = x k (θ) -η k ∇ x f (x k (θ), θ; ξ k+1 ) (SGD)where (η k ) k∈N is a sequence of positive step-sizes and (ξ k ) k∈N is a sequence of independent random variables with common distribution P. Precise assumptions on the problem and the algorithm will be given in Section 2.2 to ensure convergence. We highlight here that both the objective f (x, θ, ξ) and the initialization of the algorithm x 0 (θ) depend on some parameter θ ∈ Θ ⊂ R m , and so do the iterates and optimal solution.For any θ ∈ Θ and any k ≥ 0, under appropriate assumptions, the Jacobian of x k (θ) w.r.t. θ, denoted by ∂ θ x k (θ) ∈ R d×m , is well defined and obeys the following recursion from the chain rule of differentiation:∂ θ x k+1 (θ) = ∂ θ x k (θ) -η k ∇ 2 xx f (x k (θ), θ; ξ k+1 )∂ θ x k (θ) -η k ∇ 2 xθ f (x k (θ), θ; ξ k+1 ).(SGD') The natural limit candidate for this recursion is the Jacobian of the solution, ∂ θ x ⋆ (θ), which, from the implicit function theorem, is the unique solution to the following linear system∇ 2 xx F (x ⋆ (θ), θ)D + ∇ 2 xθ F (x ⋆ (θ), θ) = E ξ∼P ∇ 2 xx f (x ⋆ (θ), θ; ξ)D + ∇ 2 xθ f (x ⋆ (θ), θ; ξ) = 0.As noted in (Arbel and Mairal, 2021 , Proposition 1), this is equivalently characterized as a solution to the following stochastic minimization problem∂ θ x ⋆ (θ) = arg min D∈R d×m E ξ∼P 1 2 ∇ 2 xx f (x ⋆ (θ), θ; ξ)D + ∇ 2 xθ f (x ⋆ (θ), θ; ξ), D (Opt')where we use the standard Frobenius inner product over matrices. Our key insight is to formally understand the recursion in (SGD') as an inexact SGD sequence applied to problem (Opt').Intuition from the quadratic case.Consider two maps ξ → Q(ξ) ∈ R d×d and ξ → B(ξ) ∈ R d×m . Let f (x, θ; ξ) = 1 2 x ⊤ Q(ξ)x + x ⊤ B(ξ)θ, then the recursion in (SGD') becomes ∂ θ x k+1 (θ) = ∂ θ x k (θ) -η k (Q(ξ k+1 )∂ θ x k (θ) + B(ξ k+1 )).which is exactly a stochastic gradient descent sequence for problem (Opt'). Hence, choosing appropriate step sizes ensures convergence. Beyond the quadratic setting, one needs to take into consideration the fact that the second order derivatives of f are not constant, leading to our interpretation as perturbed stochastic gradient iterates for the derivatives, as detailed below.The general case. We rewrite the recursion (SGD') as followsEQUATION) where the error term e k+1 is defined ase k+1 = η k ∇ 2 xx f (x ⋆ (θ), θ; ξ k+1 ) -∇ 2 xx f (x k (θ), θ; ξ k+1 ) ∂ θ x k (θ) + η k ∇ 2 xθ f (x ⋆ (θ), θ; ξ k+1 ) -∇ 2 xθ f (x k (θ), θ; ξ k+1) . Assuming that the second derivative of f is Lipschitz-continuous, the error term e k+1 is of the same order as η k ∥x k (θ)-x ⋆ (θ)∥(1+∥∂ θ x k (θ)∥). Our main contribution is a careful analysis of a specific version of inexact SGD which covers the above recursion. Under typical stochastic approximation assumptions, the convergence of x k (θ) toward x ⋆ (θ) essentially entails the convergence of ∂ θ x k (θ) toward ∂ θ x ⋆ (θ). This allows us to carry out a joint convergence analysis of both sequences in (SGD) and (SGD'). We now describe the assumptions required to make this intuition rigorous.We start with the stochastic objective, f in (Opt) and then specify assumptions on the underlying random variable ξ. The crucial assumption for our results is strong convexity. The rest of the assumptions are typically satisfied in applications such as hyper parameter tuning. We point out that both examples in the numerical section satisfy our assumptions and are implemented in the regime described by our main theorem. Assumption 1. Let Θ be an open Euclidean subset of R m and Ξ be a measure space. The function f : R d × Θ × Ξ → R satisfies the following conditions:(a) Differentiability: f (•, •; ξ) is C 2 , with M -Lipschitz Hessian (in Frobenius norm), for all ξ ∈ Ξ. (b) Smoothness: ∇ x f (•, θ; ξ) is L-Lipschitz and ∇ x f (x, •; ξ) is L ′ -Lipschitz for all x, θ and ξ ∈ Ξ. (c) Strong convexity: f (•, θ; ξ) is µ-strongly convex for all θ ∈ Θ and ξ ∈ Ξ. Assumption 1(b) entails that ∇ 2xx f and ∇2 xθ f are uniformly bounded in operator norm by L and L ′ respectively. We remark that our smoothness assumption is global in x, but possibly only local in θ since Θ is an arbitrary open neighborhood, so that Assumption 1(b) does not require global Lipschicity with respect to the variable θ. Assumption 1(c) implies that F (•, θ) has a unique minimizer that we will denote by x ⋆ (θ); it also implies that ∇ 2 xx f is positive definite. This is actually the strongest part of Assumption 1, it is somewhat a requirement since the problem of differentiating the solution to an optimization problem, not necessarily strongly convex, is not settled for the moment.As a consequence of Assumption 1, the derivative sequence in (SGD') is almost surely bounded1 . This is proved in Appendix B. Lemma 2.1. Under Assumption 1, assuming that η k ≤ 1 L for all k, we have almost surely∥∂ θ x k (θ)∥ ≤ max{∥∂ θ x 0 (θ)∥, √ mL ′ /µ}.We now specify the structure of the random variables (ξ k ) k∈N appearing in the recursions (SGD) and (SGD'). In particular, we follow the classical approach of (Bottou et al., 2018; Gower et al., 2019) among a rich literature for our variance condition. Assumption 2. The observed noise sequence (ξ k ) k∈N is independent identically distributed with common distribution P on Ξ. Furthermore, (a) Variance control: there is σ ≥ 0 such that for all θ ∈ Θ,E ∥∇ x f (x ⋆ (θ), θ; ξ)∥ 2 ≤ σ 2 , E ∥∇ 2 xx f (x ⋆ (θ), θ; ξ)∂ θ x ⋆ (θ) + ∇ 2 xθ f (x ⋆ (θ), θ; ξ)∥ 2 ≤ σ 2 . (b) Integrability: f (x, θ; •) and ∇f (x, θ; •) are integrable w.r.t. P for a certain fixed pair x ∈ R d , θ ∈ Θ.Note that we control the second moment only at the solution, which means that the case σ 2 = 0 corresponds to the interpolation scenario but does not mean that the algorithm is noiseless. Furthermore, we also control the second moment of the second derivative (in Frobenius norm). This is not typical in the SGD literature but is required here to analyze the sequence of derivatives (this is illustrated in the simple interpolation case of Fig. 1 ). Assumption 1(a) and (b) together with Assumption 2 imply that one can permute expectation and derivative up to order 2, as detailed in Appendix A.In this setting, we use the natural filtration (F k ) k∈N where for all k, F k is defined as the σ-algebra generated by ξ 0 , . . . , ξ k . Note that ξ k+1 and thus∇ x f (x k (θ), θ; ξ k+1 ) is not F k -measurable but F k+1 -measurable.The following is the main result of this paper. Its proof is postponed to Section 3.2. Theorem 2.2 (Convergence of the derivatives of SGD). Let Θ ⊂ R m be open, Ξ be a measure space and f : R d × Θ × Ξ → R be as in Assumption 1. Set κ = L/µ, the condition number. Let (ξ k ) k∈N be a sequence of independent variables on Ξ, as in Assumption 2. Let (η k ) k∈N be a positive, non-increasing, non-summable sequence withη 0 ≤ µ 4L 2 = 1 µ 1 4κ 2 and (x k (θ)) k∈N be defined as in (SGD). Then:• General estimates: setting η = lim k→∞ η k , we havelim sup k→∞ E ∥∂ θ x k (θ) -∂ θ x ⋆ (θ)∥ 2 ≤ 4σ 2 η µ 1 + 3M (1 + max{∥∂ θ x 0 (θ)∥, √ mL ′ /µ}) µ 2 . • Sublinear rate: if for all k, η k = 1 µ 2 k+8κ 2 , then E ∥∂ θ x k (θ) -∂ θ x ⋆ (θ)∥ 2 = O log(k + 8κ 2 ) 2 k + 8κ 2 .where the constants in the big O are polynomials in κ, ∥x 0 (θ)-x ⋆ (θ)∥ 2 , ∥∂ θ x 0 (θ) -∂ θ x ⋆ (θ)∥ 2 , σ 2 , 1 µ , M and √ m.• Interpolation regime: if σ = 0 and η k = µ 4L 2 for all k ∈ N, thenE ∥∂ θ x k (θ) -∂ θ x ⋆ (θ)∥ 2 = O k 1 - 1 8κ 2 k .The first part of the result provides a general estimate which allows covering virtually all small step-size cases. This includes: i) vanishing step-sizes, for which our result implies convergence of derivatives; and ii) constant step-sizes η, for which we provide a bound on the distance to the true derivative that is proportional to η. For the second part, using step-sizes decreasing as 1/k, which is a typical setup for the convergence of SGD on strongly convex objectives, our result shows that the derivatives converge as well, with a rate that is asymptotically of the same order, up to log factors. Finally, the last part of the result relates to the interpolation regime which has drawn a lot of attention in recent years because it captures some of the features of overparameterized deep neural network training Ma et al. (2018) ; Varre et al. (2021) ; Garrigos and Gower (2023) . Note that the condition σ = 0 in Assumption 2 entails that interpolation occurs for both problems (Opt) and (Opt'), and in this case we obtain exponential convergence of both the iterates and their derivatives, with a constant stepsize, as in the deterministic setting (Mehmood and Ochs, 2020) .Remark 2.3. The specific stepsize used to obtain the sublinear rate actually applies to any stepsize of the form η k = 2/(ck + 8u) for given c, u > 0 such that 0 < c ≤ µ and u ≥ L 2 /c. One obtains the same result with µ, L respectively replaced in the expressions by μ := c ≤ µ and L := √ uc ≥ L. This corresponds to using a lower estimate for the strong convexity constant and a higher estimate for the smoothness constant, which remain valid. A similar remark holds for the interpolation regime where any stepsize η smaller than µ/(4L 2 ) will bring the same result with κ replaced by κ := 1/(4Lη) in the statement. Remark 2.4. We consider step sizes at most µ 4L 2 which is smaller than 1 L , typically used in optimization. Asside from the 1 4 factor, which could possibly be improved, it is important to relate it to the the fact that we have obtain O(1/k) rates which represent fast rates for SGD for convex optimization, limited to strongly convex objectives. Second, we do not have any Lipschicity assumption on the objective function itself. This, and the use of small steps to obtain fast rate is in line with related literature such as (Bottou et al., 2018, Theorem 4.6) , the discussion following (Moulines and Bach, 2011 , Theorem 1) or (Garrigos and Gower, 2023, Corollary 5.8 and Theorem 5.9 ). The possibility to obtain convergence of derivatives of SGD for larger step sizes will be a topic of future research.The setting is the same as the standard one, except that we consider a specific value of θ = Aζ for some ζ ∈ R d . In this case, we do not differentiate through the linear relation θ = Aζ, the function b remains the identity, we simply evaluate at a specific point which corresponds to data interpolation. We call this simple interpolation, because it corresponds to σ = 0 for the sequence (SGD), but not for (SGD'). 
proof of the main result: 
 Our result relies on the interpretation of the recursion (SGD') as an inexact SGD sequence for the problem (Opt'). We start with a detailed analysis of inexact SGD under appropriate assumptions. This is an abstract result which we formulate using an abstract function g different from the objective in problems (Opt) and (Opt') in order to avoid any possible confusion. In particular g is static (does not depend on external parameters) and the obtained convergence result will be then applied to both sequences (SGD) and (SGD').We provide here our template results for the convergence of inexact SGD. As template, we consider a function G : R q → R defined as G(x) := E ξ∼P [g(x; ξ)] . Our generic assumptions stand as follows. Assumption 3. P is a probability distribution on the measure space Ξ, and the function g : R d ×Ξ → R satisfies the following conditions:(a) Smoothness: g(•; ξ) is C 1 with L-Lipschitz gradient, i.e., there is L ≥ 0 such that ∥∇ x g(x; ξ) -∇ x g(x ′ ; ξ)∥ ≤ L∥x -x ′ ∥for all x, x ′ ∈ R q , and all ξ ∈ Ξ.(b) Strong convexity: there is x ⋆ ∈ R q and µ > 0 such that ⟨x -x ⋆ , E[∇ x g(x; ξ)]⟩ ≥ µ∥x -x ⋆ ∥ 2 for all x ∈ R q . (c) Variance control: there is 0 ≤ σ < +∞ such that E ∥∇ x g(x ⋆ ; ξ)∥ 2 ≤ σ 2 .We remark that under Assumptions 1 and 2, Assumption 3 is satisfied for both problems (Opt) and (Opt'). We will consider an inexact SGD recursion of the formEQUATIONwhere we will need the following assumption on noise and errors. Assumption 4. The observed noise sequence (ξ k ) k∈N is independent and identically distributed with common distribution P on Ξ. Denote by (F k ) k∈N the natural filtration (i.e., for all k, F k is the σ-algebra generated by ξ 0 , . . . , ξ k ), the errors (e k ) k∈N form a sequence of(F k ) k∈N -adapted random variables such that E[∥e k+1 ∥ 2 ] ≤ B 2 k where (B k ) k∈N is a deterministic non-increasing sequence.The following reduces the analysis of inexact SGD sequences to the study of a deterministic recursion, its proof is given in Appendix B. Proposition 3.1 (Convergence of inexact SGD). Let Assumption 3 and Assumption 4 hold. Consider the iterates in (2) where (η k ) k∈N is a positive, non-increasing, non-summable sequence withη 0 ≤ µ 4L 2 . Setting D k = E[∥x k -x ⋆ ∥ 2 ],we have for all k ∈ N:EQUATIONStudying the deterministic recursion (3) leads to the following results by relying on different helper lemmas laid out in Appendix C:Lemma Stepsizes Errors Noise Result Lemma C.1 η k → η ≥ 0 B k → B ∝ √ η σ 2 ≥ 0 lim sup k→∞ D k ∝ √ η Lemma C.2 η k = 2µ µ 2 k+8L 2 B k = 0 σ 2 ≥ 0 D 2 k = O log(k+8κ 2 ) k+8κ 2 Lemma C.3 η k = 2µ µ 2 k+8L 2 B 2 k = O log(k+8κ 2 ) k+8κ 2 σ 2 ≥ 0 D 2 k = O log(k+8κ 2 ) 2 k+8κ 2 Lemma C.4 η k = η < 1 2µ B 2 k = O (1 -µη 2 ) k σ 2 = 0 D 2 k = O k(1 -µη 2 ) kThese results will be used to prove Theorem 2.2 in the coming section. They are of independent interest regarding the convergence analysis of inexact SGD sequences. The first lemma allows to prove the first point in Theorem 2.2, the second and third lemmas allow to treat the second point, and the last lemma allows to treat the interpolation regime in the third point. See Appendix C for detailed statements.We first show that Proposition 3.1 can be applied to the recursion (SGD') in relation to (Opt') and then explicit its consequences using the lemmas of Appendix C.Proof of Theorem 2.2. Following (1), we have that (∂ θ x k (θ)) k∈N is an inexact SGD sequence for problem (Opt') as in (2), with an error term of the forme k+1 = ∇ 2 xx f (x ⋆ (θ), θ; ξ k+1 ) -∇ 2 xx f (x k (θ), θ; ξ k+1 ) ∂ θ x k (θ) + ∇ 2 xθ f (x ⋆ (θ), θ; ξ k+1 ) -∇ 2 xθ f (x k (θ), θ; ξ k+1 ) .Under Assumption 1 and Assumption 2, Problem (Opt') satisfies Assumption 3, and we have the same values for L, µ and σ for both problems (Opt) and (Opt'). Furthermore, the error term e k+1 satisfies Assumption 4, and, thanks to Lemma 2.1 and Assumption 1 on Lipschitz continuity of the Hessian of f , we have almost surelyEQUATIONThe various bounds are obtained by considering different regimes. We first estimate a bound on E ∥x k (θ)x ⋆ (θ)∥ 2 using Proposition 3.1 with B k = 0 for all k. This allows to obtain an estimate on E ∥e k+1 ∥ 2 using (4). We conclude for the derivative sequence by applying Proposition 3.1 with its different corollaries. We treat all these results separately.General estimate. From Proposition 3.1 with B k = 0, we obtain, by considering g(x, ξ) = f (x, θ; ξ) and Lemma C.1 that lim sup k→∞ E ∥x k (θ)x ⋆ (θ)∥ 2 ≤ 4σ 2 η µ . For the derivative sequence, combining this first estimate with (4), we can consider a decreasing sequence of mean squared upper bounds (B k ) k∈N , such thatlim k→∞ B k = B := 2σ η µ M (1 + max{∥∂ θ x 0 (θ)∥, √ mL ′ /µ}).The upper bound given by Proposition 3.1 and Lemma C.1 is of the formB 2 + 2µη(B 2 + 2σ 2 ) + B µ ≤ 3 2 B 2 + 4µησ 2 + B µ ≤ 2σ η µ + 3B µ ,which corresponds to the claimed bound.Convergence rate. From Proposition 3.1 with B k = 0, we obtain, by considering g(x, ξ) =f (x, θ; ξ) and Lemma C.2 that E ∥x k (θ) -x ⋆ (θ)∥ 2 = O log(k+8κ 2 ) k+8κ 2as given in Lemma C.2.As a consequence, combining this first estimate with (4), we may setB k = O log(k+8κ 2 ) k+8κ 2and the result follows from Lemma C.3.Interpolation regime. Setting ρ = 1 -µη 2 = 1 -1 8κ 2 , for σ 2 = 0 and B k = 0 for all k ∈ N, it is clear from (3) that E ∥x k (θ) -x ⋆ (θ)∥ 2 ≤ ∥x 0 (θ) -x ⋆ (θ)∥ 2 ρ k for all k ∈ N. Using (4), we may choose B k = O(ρ k ).Plugging this estimate in (3), the result is then given by Lemma C.4.The parameter variable θ is in R d and we set b : θ → Aθ.Here this corresponds to an interpolation regime which is uniform in θ. We call this double interpolation because it corresponds to σ = 0 for both sequences (SGD) and (SGD'). 10 -2 η0 η0/2 η0/10 η0k -1 η0k -1/2 η0k -1/4 η0/ log(k) η0 η0/2 η0/10 η0k -1 η0k -1/2 η0k -1/4 η0/ log(k)Figure 1 : Numerical behavior of SGD iterates and their derivatives (Jacobians) in a linear regression problem solved by ordinary least squares. The plots depict the convergence of the suboptimality f(x k (θ)) -f (x ⋆ (θ))and the Frobenius norm of the derivative error ∥∂ θ x k (θ) -∂ θ x ⋆ (θ)∥F across different experimental settings: constant step-size (first column), decreasing step-size (second column), double interpolation (third column), and simple interpolation (fourth column). The experiments utilize varying step-size strategies to illustrate general estimates, sublinear rates, and the impacts of interpolation regimes, validating theoretical predictions of Theorem 2.2.Note the the difference between setting 2. and 3. are that we are not differentiating through the linear map A in setting 2. Furthermore Assumption 1 and Assumption 2 are satisfied for these three settings. Figure 1 illustrates the behavior of (SGD) and (SGD'). More precisely, we monitor the convergence of the suboptimality f (x k (θ))f (x ⋆ (θ)) and of the derivatives error measured in Frobenius norm ∥∂ θ x k (θ) -∂ θ x ⋆ (θ)∥ F . We consider various step size regimes and setη 0 = µ 4L 2for all experiments. This allow us to clearly identify the three regimes of Theorem 2.2:• Constant stepsize: in setting 1., employing a constant step-size, we observe convergence of both the iterates (consistent with classical SGD theory) and their derivatives to a neighborhood of the solution whose diameter decreases with the step size. • Decreasing stepsize: in setting 1., employing a step-size proportional to 1/k, we observe a sublinear decay of both the iterates and their derivatives. The convergence is difficult to observe since the decay leads to very small updates. • Double Interpolation regime: in setting 3., employing a constant step-size, we observe both iterates and derivatives linear decays. • Simple Interpolation regime: in setting 2., Assumption 2(a) is satisfied with σ = 0 only for the iterates, but not for the derivatives, we observe linear convergence of the iterates, but the derivatives converge to a neighborhood of the solution as in the setting 1.Ridge, Logistic, Huber and SVM regression. In addition to the previous illustration of Theorem 2.2, we provide numerical experiments for constant learning rate for four different models: ridge regression, logistic regression, Huber regression and Support Vector Machines (SVM) regression. All of them are written asx ⋆ (θ) = arg min x∈R d F (x, θ) := 1 m m ξ=1 f (x, θ; ξ) + µ∥x∥ 2 2 , where f (x, θ; ξ) = 1 2 (a ⊤ ξ w -θ ξ ) 2 for ridge regression, f (x, θ; ξ) = log(1 + exp(-θ ξ a ⊤ ξ x)) for logistic regression, f (x, θ; ξ) = 1 2 (θ ξ -a ⊤ ξ x) 2 if |θ ξ -a ⊤ ξ x| ≤ δ δ |θ ξ -a ⊤ ξ x| -1 2 δ otherwise,for Huber regression for some δ > 0 (here δ = 0.1), and f (x, θ; ξ) = max(0, 1θ ξ a ⊤ ξ x) for SVM regression (hinge loss). In all cases, the finite sum structure naturally suggests a stochastic gradient decomposition as in (SGD), by choosing ξ uniformly in {1, . . . , m} with replacement All experiences are performed with m, d = 100, 10 and µ = 0.05. In Figure 2 , we show the convergence of the objective function and the derivatives with respect to θ for the four models with a constant learning rate. Note that the SVM loss is not differentiable. We refer to (Bolte et al., 2022) for a formal treatment of nonsmooth iterative differentiation, but one could expect similar results for conservative Jacobians.Experiments on real data. We display in Figure 3 the behaviour of SGD iterates and their derivatives for regularized logistic regression problem on ijcnn1.  
numerical illustration: 
 In this section, we illustrate the results of Theorem 2.2 by examining the numerical behavior of the iterates and their derivatives under various settings. Specifically, we provide insights into the behavior of classical regularized methods, such as Ridge regression, logistic regression, Huber regression. Furthermore, we explore potential extensions to the nonsmooth case by also considering the Hinge loss. All the experiments are performed for the empirical risk minimization structure, i.e., the randomness ξ is drawn from the uniform distribution over {1, . . . , m}. All the experiments were performed in jax (Bradbury et al., 2018) on a MacBook Pro M3 Max.Ordinary least squares. We consider a simple linear regression problem solved by ordinary leastsquares as:x ⋆ (θ) = arg min x∈R d F (x, θ) := 1 2m m ξ=1 (a ⊤ ξ x -b(θ) ξ ) 2 ,The data A = (a ξ ) ∈ R m×d here is a random matrix with d < m. The finite sum structure naturally suggests a stochastic gradient decomposition as in (SGD), by choosing ξ uniformly in {1, . . . , m} with replacement. We consider three generative models for the function b:1. Standard setting: θ ∈ R m , and we have b is the identity on R m . In this case, our theory corresponds to the differentiation of the least squares solution seen as a function of the output observations. 
conclusion: 
 In conclusion, our study of stochastic optimization problems where the objective depends on a parameter reveals insights into the behavior of SGD derivatives. We demonstrated that these derivatives follow an inexact SGD recursion, converging to the solution mapping's derivative under strong convexity, with constant step-sizes leading to stabilization and vanishing step-sizes achieving O(log(k) 2 /k) rates. Future research could refine the analysis by comparing stochastic implicit and iterative differentiation, develop a minibatch version, and explore outcomes in non-strongly convex or nonsmooth settings. Additionally, the feasibility of stochastic iterative differentiation warrants further investigation, given its potential benefits and challenges in such scenarios.Question: Does the paper provide open access to the data and code, with sufficient instructions to faithfully reproduce the main experimental results, as described in supplemental material?Answer: [Yes] Justification: The code is released along with the paper. It depends on jax, numpy and matplotlib.Guidelines:• The answer NA means that paper does not include experiments requiring code. Justification: We consider simple regression settings that we fully describe in the paper.Guidelines:• The answer NA means that the paper does not include experiments.• The experimental setting should be presented in the core of the paper to a level of detail that is necessary to appreciate the results and make sense of them. • The full details can be provided either with the code, in appendix, or as supplemental material. 
experiment statistical significance: 
 Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments?Answer: [No] Justification: We do not report error bars in the paper. The goal of Figure 1 is to show the variance of one trajectory of the algorithm, and repeating the procedure will not highlight this aspect.Guidelines:• The answer NA means that the paper does not include experiments.• The authors should answer "Yes" if the results are accompanied by error bars, confidence intervals, or statistical significance tests, at least for the experiments that support the main claims of the paper. • The factors of variability that the error bars are capturing should be clearly stated (for example, train/test split, initialization, random drawing of some parameter, or overall run with given experimental conditions). • The method for calculating the error bars should be explained (closed form formula, call to a library function, bootstrap, etc.) • The assumptions made should be given (e.g., Normally distributed errors). • It should be clear whether the error bar is the standard deviation or the standard error of the mean. • It is OK to report 1-sigma error bars, but one should state it. The authors should preferably report a 2-sigma error bar than state that they have a 96% CI, if the hypothesis of Normality of errors is not verified. • For asymmetric distributions, the authors should be careful not to show in tables or figures symmetric error bars that would yield results that are out of range (e.g. negative error rates). • If error bars are reported in tables or plots, The authors should explain in the text how they were calculated and reference the corresponding figures or tables in the text. 
experiments compute resources: 
 Question: For each experiment, does the paper provide sufficient information on the computer resources (type of compute workers, memory, time of execution) needed to reproduce the experiments?Answer: [Yes] Justification: This is simple low-dimensional regression problems that can be run on a standard laptop (Apple Macbook M3).Guidelines:• The answer NA means that the paper does not include experiments.• The paper should indicate the type of compute workers CPU or GPU, internal cluster, or cloud provider, including relevant memory and storage. • The paper should provide the amount of compute required for each of the individual experimental runs as well as estimate the total compute. • The paper should disclose whether the full research project required more compute than the experiments reported in the paper (e.g., preliminary or failed experiments that didn't make it into the paper). 
code of ethics: 
 Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines? 
broader impacts: 
 Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed? 
safeguards: 
 Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pretrained language models, image generators, or scraped datasets)?Answer: [NA] Justification: No model or data is released in the paper.Guidelines:• The answer NA means that the paper poses no such risks.• Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters. • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images. • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.12. Licenses for existing assets Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?Answer: [Yes] Justification: We cite accordingly the original papers that produced the code package used in our experiments.Guidelines:• The answer NA means that the paper does not use existing assets.• The authors should cite the original paper that produced the code package or dataset.• The authors should state which version of the asset is used and, if possible, include a URL. • The name of the license (e.g., CC-BY 4.0) should be included for each asset.• For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided. • If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset. • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided. • If this information is not available online, the authors are encouraged to reach out to the asset's creators. 
new assets: 
 Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets?Answer: [NA] Justification: The paper does not introduce new assets.Guidelines: 
 
 Appendix: We may assume without loss of generality that both f (0, 0; ξ) and ∇ (x,θ) f (0, 0; ξ) are integrable thanks to Assumption 2(b). Concatenate the variables x and θ, such that z = (x, θ) and consider the functiong : (z; ξ) → f (z; ξ) ∥z∥ 2 + 1 .Since the gradient of f is L-Lipschitz in z by Assumption 1(b), we have using the descent lemma (Nesterov, 2013, Lemma 1.2.3 )|f (z; ξ) -f (0; ξ)| ≤ ∥∇ z f (0; ξ)∥∥z∥ + L 2 ∥z∥ 2so that g is upper bounded by an integrable function uniformly in z asEQUATION)We also have∇ z g(z; ξ) = ∇ z f (z; ξ) 1 ∥z∥ 2 + 1 -z 2f (z; ξ) (∥z∥ 2 + 1) 2 = ∇ z f (z; ξ) 1 ∥z∥ 2 + 1 -z 2g(z; ξ) ∥z∥ 2 + 1 = ∇ z f (0; ξ) 1 ∥z∥ 2 + 1 + (∇ z f (z; ξ) -∇ z f (0; ξ)) 1 ∥z∥ 2 + 1 -z 2g(z; ξ) ∥z∥ 2 + 1Using again Lipschitz continuity of the gradient of f , ∇ z g(z; ξ) is upper bounded by an integrable function, uniformly in z, as∥∇ z g(z; ξ)∥ ≤ ∥∇ z f (0; ξ)∥ + L + 2g(z; ξ) (6) ≤ 3∥∇ z f (0; ξ)∥ + 2L + 2|f (0; ξ)|.Hence, we have that i) ∇ z g(z; ξ) exists for all z (as f is C 1 ) and ii) both ξ → g(z; ξ) and ξ → ∇ z g(z; ξ) are bounded by functions in L 1 (P) uniformly in z thanks to ( 5) and ( 6) since |f (0; ξ)| and ∥∇ z f (0; ξ)∥ belong to L 1 (P). Hence, we have the appropriate domination assumptions to differentiate under the integral for the function g so that for all z, the function G : z → E[g(z; ξ)] is differentiable and ∇ z G(z) = E[∇ z g(z; ξ)] (see e.g., (Folland, 1999, Th. 2.27) ). Now, turning back to f , since for all z, f (z; ξ) = g(z; ξ)(∥z∥ 2 + 1), F (z) = G(z)(∥z∥ 2 + 1) and thus ∇ z F (z) = ∇ z G(z)(∥z∥ 2 + 1) + 2zG(z). Also, for all z∇ z f (z; ξ) = ∇ z g(z; ξ)(∥z∥ 2 + 1) + 2zg(z; ξ)whose right hand side is integrable as shown above. This enables us to conclude that for all z,E[∇ z f (z; ξ)] = E[∇ z g(z; ξ)](∥z∥ 2 + 1) + 2zE[g(z; ξ)] = ∇ z G(z)(∥z∥ 2 + 1) + 2zG(z) = ∇ z F (z) .As for the second derivative, ∇ z f (z; ξ) is C 1 with uniformly bounded derivatives so that we may apply differentiation under the integral once again to obtain that the Hessian of the expectation is the expectation of the Hessian. Proof. We have, using the fact that∥A k D k ∥ ≤ ∥A k ∥ op ∥D k ∥, ∥D k+1 ∥ = ∥A k D k + B∥ ≤ ∥A k D k ∥ + ∥B k ∥ ≤ ∥A k ∥ op • ∥D k ∥ + ∥B k ∥ ≤ (1 -µη k )∥D k ∥ + Bη k .There are two cases.• If ∥D k ∥ ≥ B/µ, then ∥D k+1 ∥ ≤ (1 -µη k )∥D k ∥ + η k B ≤ ∥D k ∥. • If ∥D k ∥ ≤ B/µ, then ∥D k+1 ∥ ≤ (1 -µη k )B/µ + η k B = B/µ.The proof is then by induction: if ∥D k ∥ ≤ max{∥D 0 ∥, B/µ}, the property extends to D k+1 by using one of the two cases.Proof of Lemma 2.1. The recursion (SGD') can be writtenD k+1 = A k D k + B k where for all k, D k = ∂ θ x k (θ), A k = I -η k ∇ 2 xx f (x k (θ), θ; ξ k+1 ) and B k = -η k ∇ 2 xθ f (x k (θ), θ; ξ k+1 ). Using Assumption 1, we have that ∥A k ∥ op ≤ 1 -η k µ and ∥B k ∥ ≤ √ m∥B k ∥ op ≤ √ mL ′ η k .The result follows from Lemma B.1.Proof of Proposition 3.1. First, we recall that the expected norm of a stochastic gradient can be controlled for any k ∈ N asE ∥∇ x g(x k ; ξ k+1 )∥ 2 |F k ≤ 2E ∥∇ x g(x ⋆ ; ξ k+1 )∥ 2 |F k + 2E ∥∇ x g(x k ; ξ k+1 ) -∇ x g(x ⋆ ; ξ k+1 )∥ 2 |F k ≤ 2σ 2 + 2L 2 ∥x k -x ⋆ ∥ 2 (7)where we used Assumption 3(a) and (c) in the second inequality.By definition of (2), we have for allk ∈ N ∥x k+1 -x ⋆ ∥ 2 = ∥x k -x ⋆ ∥ 2 + η 2 k ∥∇ x g(x k ; ξ k+1 ) + e k+1 ∥ 2 -2η k ⟨x k -x ⋆ , ∇ x g(x k ; ξ k+1 ) + e k+1 ⟩ ≤ ∥x k -x ⋆ ∥ 2 + 2η 2 k ∥∇ x g(x k ; ξ k+1 )∥ 2 + ∥e k+1 ∥ 2 -2η k ⟨x k -x ⋆ , ∇ x g(x k ; ξ k+1 )⟩ + 2η k ∥x k -x ⋆ ∥∥e k+1 ∥.Taking the expectation conditioned on F k , we get with our assumption on the errors thatEQUATIONwhere we used successively Eq. ( 7) and Assumption 3(b). Now using Jensen's inequality and the Cauchy-Schwartz inequality:E[XY ] ≤ E[X 2 ]E[Y 2 ]for square integrable random variables, we have the following bound on the full expectation of the last product,E[∥x k -x ⋆ ∥E[∥e k+1 ∥|F k ]] ≤ E[∥x k -x ⋆ ∥ 2 ]E E[∥e k+1 ∥|F k ] 2 ≤ E[∥x k -x ⋆ ∥ 2 ] E[E[∥e k+1 ∥ 2 |F k ]] = E[∥x k -x ⋆ ∥ 2 ] E[∥e k+1 ∥ 2 ]Now, our condition on the stepsize parameters implies that -2η k µ + 4η 2 k L 2 ≤ -η k µ. By taking full expectation on both sides of (8), we obtain thatE ∥x k+1 -x ⋆ ∥ 2 ≤ (1 -η k µ) E ∥x k -x ⋆ ∥ 2 + η 2 k 4σ 2 + 2B 2 k + 2η k E[∥x k -x ⋆ ∥ 2 ]B k We set D k = E[∥x k -x ⋆ ∥ 2] so that we have the following deterministic recursion:D 2 k+1 ≤ (1 -µη k ) D 2 k + 2η 2 k (B 2 k + 2σ 2 ) + 2η k B k D k .Lemma C.1. Let (η k ) k∈N and (B k ) k∈N be non-negative and non-increasing. Assume that (η k ) k∈N is non-summable and that 0 < η k ≤ 1 µ for all k. Let (D k ) k∈N be a non-negative sequence satisfying for all kEQUATIONConsider the quantityδ k = 4η 2 k B 2 k + 8µη 3 k (B 2 k + 2σ 2 ) + 2B k η k 2µη k = B 2 k + 2µη k (B 2 k + 2σ 2 ) + B k µ .Then, (δ k ) k∈N is positive, non-increasing, and for any δ > lim k→∞ δ klim sup k→∞ D k ≤ δ. Proof. Set for each k ∈ N, F k : R + → R + , with F k (t) = (1 -µη k ) t+2η k B k √ t+2η 2 k (B 2 k +2σ 2 ). We have that F k is increasing, concave, and F k (δ 2 k ) = δ 2 k .By assumption, for all k sufficiently large, we haveδ k < δ so that F k (δ 2 ) ≤ δ 2 as t → F k (t 2 ) -t 2 is negative for t ≥ δ k .Plugging this into (9), we obtainD 2 k+1 -δ 2 ≤ (1 -µη k ) D 2 k + 2η k B k D k + 2η 2 k (B 2 k + 2σ 2 ) -F k (δ 2 ) = (1 -µη k ) (D 2 k -δ 2 ) + 2η k B k (D k -δ) .Using the fact that µη k ≤ 1, we deduce that if D k δ, then D k+i ≤ δ for all i ∈ N and the result follows. We continue assuming that D k > δ for all k ∈ N.Using the concavity of the square root, we haveD k -δ = D 2 k - √ δ 2 ≤ 1 2 √ δ 2 (D 2 k -δ 2 ). We deduce that D 2 k+1 -δ 2 ≤ 1 -µη k + η k B k δ (D 2 k -δ 2 ).We notice that for all k, 2B k µ ≤ δ k so that for k large enough, 2B k µ ≤ δ, and η k B k δ ≤ µη k 2 , and we obtainD 2 k+1 -δ 2 ≤ 1 - µη k 2 (D 2 k -δ 2 ).So there is an index k 0 such that for all k ≥ k 0 , we haveD 2 k -δ 2 ≤ k i=k0 1 -µηi 2 (D 2 k0 -δ 2) and the right hand side decreases to 0 as k → ∞ because η k is non-summable. This concludes the proof.Lemma C.2. Let η k = 2µ µ 2 k+8L 2 for all k ∈ N and (D k ) k∈N be a non-negative sequence satisfying, for all k, D 2 k+1 ≤ (1 -µη k ) D 2 k + 4η 2 k σ 2 .Then we have, for all k ∈ N,D 2 k+1 ≤ 1 k + 8κ 2 8κ 2 D 2 0 + 2σ 2 L 2 + 16σ 2 µ 2 log 1 + k 8κ 2 .Proof. From the recursion, we obtainD 2 k+1 ≤ 1 - 2µ 2 µ 2 k + 8L 2 D 2 k + 16µ 2 σ 2 (µ 2 k + 8L 2 ) 2 (µ 2 k + 8L 2 )D 2 k+1 ≤ µ 2 k + 8L 2 -2µ 2 D 2 k + 16µ 2 σ 2 (µ 2 k + 8L 2 ) ≤ µ 2 (k -1) + 8L 2 D 2 k + 16µ 2 σ 2 (µ 2 k + 8L 2 )from which we deduce that(µ 2 k + 8L 2 )D 2 k+1 ≤ 8L 2 -µ 2 D 2 0 + k i=0 16µ 2 σ 2 (µ 2 i + 8L 2 ) ≤ 8L 2 D 2 0 + 16σ 2 k i=0 1 (i + 8L 2 µ 2 ) ≤ 8L 2 D 2 0 + 16σ 2 µ 2 8L 2 + log 1 + kµ 2 8L 2where the last inequality is by integral series comparison. All in all, we obtain  and (D k ) k∈N be a non-negative sequence satisfying, for all k,D 2 k+1 ≤ 8L 2 D 2 0 µ 2 k + 8L 2 + 16σ 2 µ 2 k + 8L 2 µ 2 8L 2 + log 1 + kµ 2 8L 2 = 8κ 2 D 2 0 8κ 2 + k + 2σ 2 L 2 (k + 8κ 2 ) + 16σ 2 log 1 + kµ 2 8L 2 µ 2 (k + 8κ 2 ) = 1 k + 8κ 2 8κ 2 D 2 0 + 2σ 2 L 2 + 16σ 2 µ 2 log 1 + k 8κ 2 . Lemma C.3. Let η k = 2µ µ 2 k+8L 2 , for all k ∈ N, κ = L µ ,D 2 k+1 ≤ (1 -µη k ) D 2 k + 2η 2 k (B 2 k + 2σ 2 ) + 2η k B k D k .where there are constants A, B > 0 such that, for all k ∈ N,B 2 k ≤ A + B log k + 8κ 2 k + 8κ 2 .Then, we haveD 2 k+1 ≤ 8κ 2 D 2 0 k + 8κ 2 + 1 µ 2 5(B + A) + 8σ 2 log(k + 8κ 2 ) 2 k + 8κ 2Proof. We first rework the recursion, we use the fact that2η k B k D k = 2η k √ 2B k √ µ √ µ √ 2 D k ≤ η k 2B 2 k µ + µ 2 D 2 k = 2η k B 2 k µ + η k µ 2 D 2 k .The new recursion becomesEQUATIONFrom this recursion, we obtain by expanding all termsD 2 k+1 ≤ 1 - µ 2 µ 2 k + 8L 2 D 2 k + 8µ 2 (µ 2 k + 8L 2 ) 2 2σ 2 + A + B log k + 4κ 2 k + 4κ 2 + 2µ (µ 2 k + 8L 2 ) 2(A + B log k + 8κ 2 ) µ(k + 8κ 2 ) (µ 2 k + 8L 2 )D 2 k+1 ≤ µ 2 k + 8L 2 -µ 2 D 2 k + 8 (k + 8κ 2 ) 2σ 2 + (A + B log k + 8κ 2 ) (k + 8κ 2 ) + 4(A + B log k + 8κ 2 ) (k + 8κ 2 ) ≤ µ 2 (k -1) + 8L 2 D 2 k + log k + 8κ 2 k + 8κ 2 5(B + A) + 16σ 2where we use the fact that k ≥ 0 and κ ≥ 1 so that log k + 8κ 2 ≥ log (8) > 1. We deduce that(µ 2 k + 8L 2 )D 2 k+1 ≤ 8L 2 -µ 2 D 2 0 + 5(B + A) + 16σ 2 k i=0 log(i + 8κ 2 ) (i + 8κ 2 ) ≤ 8L 2 D 2 0 + 5(B + A) + 16σ 2 log(k + 8κ 2 ) 2where the last inequality is by integral series comparison, using the fact that t → log(t)/t is decreasing for t ≥ exp(1), we havek i=0 log(i + 8κ 2 ) (i + 8κ 2 ) ≤ log(8κ 2 ) 8κ 2 + log(k + 8κ 2 ) 2 -log(8κ 2 ) 2 ≤ log(k + 8κ 2 ) 2 .Lemma C.4. Let η k = η < 1 2µ for all k ∈ N, κ = L µ , and (D k ) k∈N be a non-negative sequence satisfying for all kD 2 k+1 ≤ (1 -µη k ) D 2 k + 2η 2 k B 2 k + 2η k B k D k .where, there is a constant A > 0, with ρ = 1 -µη 2 such that, for all k ∈ N, B 2 k ≤ Aρ k . Then, we haveD 2 k ≤ ρ k D 2 0 + kA ρ 2η 2 + 2 η µ .Proof. We proceed similarly as in ( 10) and obtainD 2 k+1 ≤ 1 - µη k 2 D 2 k + 2η 2 k B 2 k + 2η k B 2 k µ ≤ ρD 2 k + Aρ k 2η 2 + 2 η µ .We rewrite and use an induction to obtainD 2 k+1 ρ k+1 ≤ D 2 k ρ k + A ρ 2η 2 + 2 η µ ≤ D 2 0 + kA ρ 2η 2 + 2 η µwhich is the desired result.NeurIPS Paper ChecklistJustification: There is no ethical concern in the paper.Guidelines:• The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics.• If the authors answer No, they should explain the special circumstances that require a deviation from the Code of Ethics. • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction).Justification: There is no societal impact of the work performed due to its very theoretical nature.Guidelines:• The answer NA means that there is no societal impact of the work performed.• If the authors answer NA or No, they should explain why their work has no societal impact or why the paper does not address societal impact. • Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations. • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster. • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology.• If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML).This does not depend on the randomness structure detailed in Assumption 


Decision: The paper looks at the behavior of the derivative of the iterates of SGD in the strongly convex setting. It has applications to bi-level optimization (through implicit differentiation). I suggest that the authors take into consideration the concerns about adding real data experiments and adding some discussions on the literature of inexact SGD and why their techniques are novel.

Reviews: review: paper_summary: paper_summary: This is a theoretical paper on iterative process differentiation. The paper analyzes the behavior of the derivatives of the iterates of SGD (Stochastic Gradient Descent). Based on a set of assumptions, the paper establishes the convergence of the derivatives of SGD and conducts numerical experiments to validate its findings.
strength_weakness: strength_weakness: I believe the main weaknesses of the paper are that the assumptions used to establish the theory are too strong; moreover, the practical significance of the theory is not clearly articulated, especially in relation to stochastic hyperparameter optimization.
questions: questions: The smoothness assumption in Assumption 1(b) requires that the gradient are jointly L-Lipschitz continuous in $x$ and $\theta$ . Can this assumption be relaxed?
limitations: limitations: Not applicable.
paper_summary: paper_summary: The paper considers stochastic optimizations where the objective depends on some parameter.  Instead of the SGD, the paper considers the derivatives of the iterates of the SGD with respect to that parameter in the context where the objective is strongly convex. 
Convergence analysis is obtained for the derivatives of the iterates of SGD, which can be viewed as an inexact SGD on a different objective, perturbed by the convergence of the original SGD.
strength_weakness: strength_weakness: (1) Derivatives of SGD are much less studied than SGD. As a result, it would be helpful to add more discussions about Assumption 1, Assumption 2, what kind of examples of interest satisfy these two assumptions (especially the part that is unique to the setting that involves the parameter).

(2) Numerical experiments are only synthetic. It would be nice if the paper can add an experiment on real data.

(3) I do not see adequate discussions whether the assumptions for the theoretical part can be satisfied for the examples considered
in the numerical section.

(4) Inexact SGD has been well studied in the literature. Since the paper views derivatives of SGD as an inexact SGD, it is not clear
what technical novelty and contributions arise from this context.
questions: questions: (1) In Theorem 2.2, I understand that constant step-size is a popular choice in the SGD literature. But can you comment on the choice $\eta_{k}=\frac{1}{\mu}\frac{2}{k+8\kappa^{2}}$ for the sublinear rate regime, and moreover the interpolation regime, in which the assumption $\sigma=0$ seems to be super strong to me, and can you provide some examples of interest that satisfy this particular assumption?

(2) In the paragraph after equation (1), you wrote that the error term is of order... Please specify which term is the error term. 

(3) To improve the readability of the paper, I suggest you state somewhere in the main paper how you view the derivatives of SGD as an inexact SGD. For example, in the proof of Theorem 2.2., you defined $e_{k+1}$, and I think you can define $e_{k+1}$, as well as $\nabla_{x}g(x_{k};\xi_{k+1})$ when you explain how you view the derivatives of SGD as an inexact SGD before you state the main results to help the readers understand better.

(4) Some of the journal names in the references should be capitalized. For example, for Robbins and Monro, 
it should be The Annals of Mathematical Statistics.
limitations: limitations: More discussions on limitations should be added.
paper_summary: paper_summary: The authors consider parametric stochastic optimization problems of the form $\min_x F(\theta,x)$ where $F(\theta,x)= \mathbb E_\xi [ f(x, \theta, \xi)]$ under the condition that $f$ is strongly convex in $x$ for any fixed $\theta, \xi$. This ensures that for fixed $\theta$, there exists a unique minimizer $x^*(\theta)$. The authors construct a sequence $x_k$ by gradient descent for $F(\theta, \cdot)$ and demonstrate that an associated sequence, denoted by $\partial_\theta x_k$, converges to the parameter derivative $\partial_\theta x^*(\theta)$ of the solution map $x^*(\theta)$. They explore various regimes of stochasticity and various learning rate schedules, obtaining rates in different settings. Strong continuity assumptions are placed on $f, \nabla f, D^2f$.
strength_weakness: strength_weakness: * I find the title almost misleading. The authors do not consider derivatives (modifications) of the algorithm, but they consider the derivatives of iterates with respect to an additional parameter. I would propose something along the lines of "Derivatives in parametric optimization and their behavior along SGD iteration".

* I do not follow the numerical illustration in Section 4 at all. The independent parameter $\theta$ becomes a random quantity in this section, and it is unclear what stochastic gradient estimates the authors use: Only the deterministic objective function $F$ is specified (line 291), and $\xi$ is never mentioned in this section. I am not sure why the authors draw $\theta$ from a random distribution. I believe that the experiments either do not match the setting considered above or the presentation needs to be clarified considerably.
questions: questions: * Is there a conflict between the statement in line 131 that "[...] the initialization of the algorithm $x_0(\theta)$ depend[s] on some parameter $\theta$" and the assumption that $\partial_\theta x_0(\theta) =0$ in Theorem 2.2?

* In Lemma 2.1, the restriction that $\eta_k \leq \mu/L^2$ is generally much more severe than the usual bound $\eta_k \leq 1/L$. Perhaps by considering the quadratic case, could the authors speculate whether it is necessary to ensure the convergence of derivatives or whether it could be relaxed?

* In Remark 2.3, if we use a lower estimate for $\mu$, this also changes the estimate for $\kappa$: The constants $c, u$ are not independent. In fact, $\eta_0 = 1/(4\mu \kappa^2) = \mu/(4L^2)$ satisfies the necessary condition above. If we increased $c$ without adjusting $u$, we may easily enter a regime where $\eta_0> \mu/L^2$. A more careful consideration appears to be needed.
limitations: limitations: Yes
paper_summary: paper_summary: The paper studies stochastic optimization problems where the objective depends on a parameter, and more specifically the derivatives w.r.t. that parameter of the SGD iterates. The paper makes various quite strong albeit common assumptions, and for various more specific settings concrete convergence rates are established. The proof relies on analysis via an inexact SGD sequence. Finally, the results are illustrated by some experiments.
strength_weakness: strength_weakness: My main concern is of a motivational nature: why is the question set out inn ll. 35-36 interesting? I do not find ll. 37 sufficiently convincing. (I may not have understood that paragraph fully.)
questions: questions: 1. Can you elaborate on the motivation?
2. Why do you need that the gradient for the first iterates vanish (l. 194)? That appears to be an odd and strong assumption.
3. How restrictive are the assumptions? (I understand that they are mostly common in the literature.)
limitations: limitations: Assumptions are discussed.

Comments: comment: Thanks for the clarification / explanation. Although I have not studied those future improvements in detail, I believe that relaxing the assumptions in this interesting theoretical issue could offer more valuable insights for practical work. For now, I would prefer to maintain my original rating.
Thank you for your clarifications. The authors have addressed my points. In particular, I belief that the authors will be able to present a more convincing case for their motivation in a revision.

I belief my original assessment of the paper's impact is accurate.
Dear Reviewer d938,

Thank you again for your detailed feedback on our paper. We hope that our rebuttal addressed the concerns you raised. If you have any further questions or require additional clarifications, we would be happy to provide them.

If you are satisfied with our responses, we kindly ask you _to consider_ raising your score in the light of our responses since your current rating leans toward a reject. We appreciate your time and effort in reviewing our work.

Best regards,

Authors
Dear Reviewer mZD2,

Thank you again for your detailed feedback on our paper. We hope that our rebuttal addressed the concerns you raised. If you have any further questions or require additional clarifications, we would be happy to provide them.

If you are satisfied with our responses, we kindly ask you _to consider_ raising your score in the light of our responses. We appreciate your time and effort in reviewing our work.

Best regards,

Authors
Dear Reviewer cZZE,

Thank you again for your detailed feedback on our paper. We hope that our rebuttal addressed the concerns you raised. If you have any further questions or require additional clarifications, we would be happy to provide them.

If you are satisfied with our responses, we kindly ask you _to consider_ raising your score in the light of our responses. We appreciate your time and effort in reviewing our work.

Best regards,

Authors
Dear reviewer bPEV,

Thank you very much for your thoughtful feedback and for raising your score!  You bring up an excellent point regarding the learning rate in the context of strongly convex optimization. Indeed, the distinction you mention between the convergence rates of the objective function and its derivatives is important. Exploring this aspect in more detail is indeed an interesting direction for future work.

Best,

Authors
Thank you for the comprehensive answer. I believe that with minor corrections, my concerns can be addressed. I choose to raise my score to 7.

For strongly convex optimization, it should be noted that in general the learning rate is $1/L$, not $\mu/L^2$ when considering the convergence of the objective function rather than its derivatives. This is true for both gradient descent and Nesterov's method. Naturally, smaller step sizes have to be chosen in the stochastic case. I would be curious to see a broader exploration.