mlsanityData to 7 Oct 2026

Stochastic Gradient Descent in Continuous Time

arXiv 1611.05545 ↗First posted 17 Nov 2016math.PR math.OC math.STcited by 14

Not on the map. Why?

Abstract (arXiv)

Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm follows a (noisy) descent direction along a continuous stream of data. SGDCT performs an online parameter update in continuous time, with the parameter updates θt satisfying a stochastic differential equation. We prove that limt rightarrow ∞ nabla bar g(θt) = 0 where bar g is a natural objective function for the estimation of the continuous-time dynamics. The convergence proof leverages ergodicity by using an appropriate Poisson equation to help describe the evolution of the parameters for large times. SGDCT can also be used to solve continuous-time optimization problems, such as American options. For certain continuous-time problems, SGDCT has some promising advantages compared to a traditional stochastic gradient descent algorithm. As an example application, SGDCT is combined with a deep neural network to price high-dimensional American options (up to 100 dimensions).

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Nov 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 0; 2024: 1; 2025: 3; 2026: 4.

14 papers.

Sort: