Skip to content
DraconiticResearch
Search Sources API
197,787 studies31 sourcesUpdated 46 min ago
PreprintCC0arXiv

Stochastic Gradient Descent over P2

Abstract

Stochastic gradient descent (SGD) admits diffusion approximations that replace the complicated randomness of stochastic gradients by Gaussian noise, providing a powerful tool for understanding its dynamics and long-time behavior. We investigate whether an analogous approximation principle holds for optimization over probability measures, where the objective is a functional defined on the Wasserstein space P2. The nonlinear geometry and infinite-dimensional nature of P2 prevent a direct extension of the classical Euclidean theory. Using Lions differentiability, we lift the problem to a linear Hilbert space, where higher-order differential calculus becomes available. We then construct a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient. By exploiting this moment matching through higher-order Taylor expansions, we show that the Gaussian approximation captures the SGD dynamics with second-order weak accuracy. Our result provides a rigorous foundation for replacing sample-driven randomness by analytically tractable Gaussian fluctuations in stochastic optimization over probability measures.

Related

  1. A Rate Transfer Method: Convergence Rates in Stochastic Gradient Descent via Stochastic Calculus
    Neil Walton
    arXivPreprintCC BY 4.0Full textOptimisation & controlProbabilityarXiv
  2. Convergence rate of stochastic gradient descent under Łojasiewicz type condition and polynomially controlled noise
    Paweł Węgrzyn
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
  3. Exact Theory and Optimal Stepsizes for Stochastic Gradient Descent in Smooth Convex Minimization
    Benjamin Grimmer, Qining Shen
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Continuous Delayed-Memory Stochastic Gradient Descent and Continuous-Time Reinforcement Learning from History of Astrophysical Time Series Studies
    Juncheng Yi
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent
    Zijun Chen, Zihan Zhang
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
BibTeX
@misc{oprea2026stochastic,
  title = {{Stochastic Gradient Descent over P2}},
  author = {Maria Oprea and Qin Li and Yunan Yang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13343},
  eprint = {2609.13343},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13343},
  note = {CC0},
}
RIS
TY  - UNPB
TI  - Stochastic Gradient Descent over P2
AU  - Maria Oprea
AU  - Qin Li
AU  - Yunan Yang
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.13343
UR  - https://arxiv.org/abs/2609.13343
AB  - Stochastic gradient descent (SGD) admits diffusion approximations that replace the complicated randomness of stochastic gradients by Gaussian noise, providing a powerful tool for understanding its dynamics and long-time behavior. We investigate whether an analogous approximation principle holds for optimization over probability measures, where the objective is a functional defined on the Wasserstein space P2. The nonlinear geometry and infinite-dimensional nature of P2 prevent a direct extension of the classical Euclidean theory. Using Lions differentiability, we lift the problem to a linear Hilbert space, where higher-order differential calculus becomes available. We then construct a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient. By exploiting this moment matching through higher-order Taylor expansions, we show that the Gaussian approximation captures the SGD dynamics with second-order weak accuracy. Our result provides a rigorous foundation for replacing sample-driven randomness by analytically tractable Gaussian fluctuations in stochastic optimization over probability measures.
ER  -